./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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_time_var_mutex.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 d5cca3532c956cbfb3f8d24df68dd431ff61516e63bcc0106c0529c479d6a4ef --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:02:15,103 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:02:15,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 05:02:15,172 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:02:15,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:02:15,199 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:02:15,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:02:15,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:02:15,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:02:15,202 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:02:15,202 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:02:15,203 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:02:15,203 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:02:15,203 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:02:15,204 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:02:15,204 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:02:15,204 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:02:15,204 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:02:15,204 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:02:15,205 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:02:15,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:02:15,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:02:15,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:02:15,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:02:15,205 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:02:15,205 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:02:15,205 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:02:15,205 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:02:15,205 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:02:15,205 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:02:15,205 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:02:15,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:02:15,206 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:02:15,206 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:02:15,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:02:15,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:02:15,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:02:15,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:02:15,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:02:15,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:02:15,207 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:02:15,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:02:15,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:02:15,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:02:15,207 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:02:15,207 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:02:15,207 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:02:15,207 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:02:15,208 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 -> d5cca3532c956cbfb3f8d24df68dd431ff61516e63bcc0106c0529c479d6a4ef [2025-01-09 05:02:15,423 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:02:15,431 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:02:15,433 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:02:15,435 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:02:15,436 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:02:15,437 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i [2025-01-09 05:02:16,610 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d90c64bc/d584c01537a74d218bb10ecb0cf176bf/FLAGeeab80e1d [2025-01-09 05:02:16,976 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:02:16,976 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_time_var_mutex.i [2025-01-09 05:02:16,991 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d90c64bc/d584c01537a74d218bb10ecb0cf176bf/FLAGeeab80e1d [2025-01-09 05:02:17,196 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2d90c64bc/d584c01537a74d218bb10ecb0cf176bf [2025-01-09 05:02:17,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:02:17,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:02:17,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:02:17,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:02:17,203 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:02:17,203 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,204 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39cd57ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17, skipping insertion in model container [2025-01-09 05:02:17,204 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,224 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:02:17,386 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_time_var_mutex.i[23611,23624] [2025-01-09 05:02:17,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:02:17,480 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:02:17,515 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_time_var_mutex.i[23611,23624] [2025-01-09 05:02:17,564 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:02:17,595 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:02:17,596 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17 WrapperNode [2025-01-09 05:02:17,596 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:02:17,597 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:02:17,600 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:02:17,601 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:02:17,605 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,630 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,663 INFO L138 Inliner]: procedures = 145, calls = 326, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 529 [2025-01-09 05:02:17,663 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:02:17,664 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:02:17,664 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:02:17,664 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:02:17,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,684 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,697 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,732 INFO L175 MemorySlicer]: Split 173 memory accesses to 19 slices as follows [2, 5, 8, 8, 6, 8, 29, 21, 7, 8, 8, 5, 0, 17, 5, 5, 13, 5, 13]. 17 percent of accesses are in the largest equivalence class. The 46 initializations are split as follows [2, 0, 3, 3, 2, 3, 9, 9, 3, 3, 3, 0, 0, 6, 0, 0, 0, 0, 0]. The 43 writes are split as follows [0, 1, 2, 2, 2, 2, 11, 6, 2, 2, 2, 1, 0, 5, 1, 1, 1, 1, 1]. [2025-01-09 05:02:17,732 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,732 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,765 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,770 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,777 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,786 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,793 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,804 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:02:17,807 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:02:17,807 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:02:17,807 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:02:17,808 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (1/1) ... [2025-01-09 05:02:17,812 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:02:17,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:17,834 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-01-09 05:02:17,837 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-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 05:02:17,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#18 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 05:02:17,860 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 05:02:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 05:02:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 05:02:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 05:02:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 05:02:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 05:02:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 05:02:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#18 [2025-01-09 05:02:17,861 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 05:02:17,861 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 05:02:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:02:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 05:02:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 05:02:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 05:02:17,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 05:02:17,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 05:02:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#18 [2025-01-09 05:02:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_init [2025-01-09 05:02:17,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_init [2025-01-09 05:02:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-01-09 05:02:17,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-01-09 05:02:17,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 05:02:17,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#18 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-01-09 05:02:17,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:02:17,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#18 [2025-01-09 05:02:17,866 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-01-09 05:02:17,868 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 05:02:17,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 05:02:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 05:02:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 05:02:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 05:02:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 05:02:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#18 [2025-01-09 05:02:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_destroy [2025-01-09 05:02:17,870 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_destroy [2025-01-09 05:02:17,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:02:17,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:02:18,111 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:02:18,112 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:02:19,329 INFO L? ?]: Removed 66 outVars from TransFormulas that were not future-live. [2025-01-09 05:02:19,329 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:02:19,340 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:02:19,342 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:02:19,342 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:02:19 BoogieIcfgContainer [2025-01-09 05:02:19,342 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:02:19,343 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:02:19,344 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:02:19,347 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:02:19,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:02:17" (1/3) ... [2025-01-09 05:02:19,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2878907f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:02:19, skipping insertion in model container [2025-01-09 05:02:19,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:17" (2/3) ... [2025-01-09 05:02:19,348 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2878907f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:02:19, skipping insertion in model container [2025-01-09 05:02:19,348 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:02:19" (3/3) ... [2025-01-09 05:02:19,349 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_time_var_mutex.i [2025-01-09 05:02:19,359 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:02:19,360 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_time_var_mutex.i that has 8 procedures, 143 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 05:02:19,395 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:02:19,402 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;@2756648a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:02:19,402 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 05:02:19,405 INFO L276 IsEmpty]: Start isEmpty. Operand has 143 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 90 states have internal predecessors, (118), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 05:02:19,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-01-09 05:02:19,415 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:19,415 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:19,416 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:19,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:19,419 INFO L85 PathProgramCache]: Analyzing trace with hash 533039589, now seen corresponding path program 1 times [2025-01-09 05:02:19,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:19,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908441451] [2025-01-09 05:02:19,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:19,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:19,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-01-09 05:02:19,698 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-01-09 05:02:19,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:19,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:20,086 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 05:02:20,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:20,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908441451] [2025-01-09 05:02:20,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908441451] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:20,087 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:20,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:02:20,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88449455] [2025-01-09 05:02:20,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:20,091 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:02:20,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:20,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:02:20,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:02:20,109 INFO L87 Difference]: Start difference. First operand has 143 states, 89 states have (on average 1.3258426966292134) internal successors, (118), 90 states have internal predecessors, (118), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 05:02:24,148 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-01-09 05:02:24,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:24,203 INFO L93 Difference]: Finished difference Result 284 states and 453 transitions. [2025-01-09 05:02:24,205 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:02:24,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 143 [2025-01-09 05:02:24,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:24,211 INFO L225 Difference]: With dead ends: 284 [2025-01-09 05:02:24,211 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 05:02:24,214 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-01-09 05:02:24,216 INFO L435 NwaCegarLoop]: 203 mSDtfsCounter, 2 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 403 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:24,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 403 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 05:02:24,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 05:02:24,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 140. [2025-01-09 05:02:24,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 05:02:24,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 203 transitions. [2025-01-09 05:02:24,249 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 203 transitions. Word has length 143 [2025-01-09 05:02:24,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:24,249 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 203 transitions. [2025-01-09 05:02:24,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 05:02:24,249 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 203 transitions. [2025-01-09 05:02:24,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2025-01-09 05:02:24,252 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:24,252 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:24,252 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:02:24,253 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:24,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:24,253 INFO L85 PathProgramCache]: Analyzing trace with hash 2072900467, now seen corresponding path program 1 times [2025-01-09 05:02:24,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:24,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880680605] [2025-01-09 05:02:24,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:24,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:24,360 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 145 statements into 1 equivalence classes. [2025-01-09 05:02:24,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 145 of 145 statements. [2025-01-09 05:02:24,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:24,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:24,521 INFO L134 CoverageAnalysis]: Checked inductivity of 925 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 05:02:24,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:24,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880680605] [2025-01-09 05:02:24,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880680605] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:24,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:24,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:02:24,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142845746] [2025-01-09 05:02:24,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:24,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:02:24,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:24,524 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:02:24,524 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:02:24,524 INFO L87 Difference]: Start difference. First operand 140 states and 203 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 05:02:24,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:24,561 INFO L93 Difference]: Finished difference Result 278 states and 405 transitions. [2025-01-09 05:02:24,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:02:24,561 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2025-01-09 05:02:24,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:24,563 INFO L225 Difference]: With dead ends: 278 [2025-01-09 05:02:24,563 INFO L226 Difference]: Without dead ends: 141 [2025-01-09 05:02:24,564 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-01-09 05:02:24,564 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 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-01-09 05:02:24,564 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:02:24,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2025-01-09 05:02:24,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2025-01-09 05:02:24,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 88 states have (on average 1.2954545454545454) internal successors, (114), 88 states have internal predecessors, (114), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 05:02:24,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 204 transitions. [2025-01-09 05:02:24,582 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 204 transitions. Word has length 145 [2025-01-09 05:02:24,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:24,586 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 204 transitions. [2025-01-09 05:02:24,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 05:02:24,587 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 204 transitions. [2025-01-09 05:02:24,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2025-01-09 05:02:24,588 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:24,589 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:24,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:02:24,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:24,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:24,589 INFO L85 PathProgramCache]: Analyzing trace with hash 2052145415, now seen corresponding path program 1 times [2025-01-09 05:02:24,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:24,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89218420] [2025-01-09 05:02:24,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:24,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:24,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 05:02:24,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 05:02:24,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:24,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:24,997 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 05:02:24,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:24,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89218420] [2025-01-09 05:02:24,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89218420] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:24,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152173092] [2025-01-09 05:02:24,998 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:24,998 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:24,998 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:25,003 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-01-09 05:02:25,010 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-01-09 05:02:25,290 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 146 statements into 1 equivalence classes. [2025-01-09 05:02:25,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 146 of 146 statements. [2025-01-09 05:02:25,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:25,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:25,409 INFO L256 TraceCheckSpWp]: Trace formula consists of 1033 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:02:25,416 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:25,450 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 05:02:25,450 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:25,561 INFO L134 CoverageAnalysis]: Checked inductivity of 926 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2025-01-09 05:02:25,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152173092] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:25,562 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:25,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 05:02:25,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25179399] [2025-01-09 05:02:25,562 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:25,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:02:25,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:25,563 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:02:25,563 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:02:25,564 INFO L87 Difference]: Start difference. First operand 141 states and 204 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 05:02:25,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:25,622 INFO L93 Difference]: Finished difference Result 281 states and 409 transitions. [2025-01-09 05:02:25,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:02:25,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) Word has length 146 [2025-01-09 05:02:25,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:25,629 INFO L225 Difference]: With dead ends: 281 [2025-01-09 05:02:25,630 INFO L226 Difference]: Without dead ends: 143 [2025-01-09 05:02:25,630 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 289 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-01-09 05:02:25,631 INFO L435 NwaCegarLoop]: 201 mSDtfsCounter, 0 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:25,631 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 399 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:02:25,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2025-01-09 05:02:25,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2025-01-09 05:02:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 90 states have (on average 1.288888888888889) internal successors, (116), 90 states have internal predecessors, (116), 45 states have call successors, (45), 7 states have call predecessors, (45), 7 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2025-01-09 05:02:25,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 206 transitions. [2025-01-09 05:02:25,657 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 206 transitions. Word has length 146 [2025-01-09 05:02:25,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:25,657 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 206 transitions. [2025-01-09 05:02:25,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 1 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 1 states have call predecessors, (44), 1 states have call successors, (44) [2025-01-09 05:02:25,657 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 206 transitions. [2025-01-09 05:02:25,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-09 05:02:25,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:25,660 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:25,673 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-01-09 05:02:25,860 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-01-09 05:02:25,861 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:25,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:25,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1356996985, now seen corresponding path program 2 times [2025-01-09 05:02:25,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:25,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485494386] [2025-01-09 05:02:25,862 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:02:25,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:25,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 148 statements into 2 equivalence classes. [2025-01-09 05:02:25,972 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 148 statements. [2025-01-09 05:02:25,972 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:02:25,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:26,160 INFO L134 CoverageAnalysis]: Checked inductivity of 931 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 931 trivial. 0 not checked. [2025-01-09 05:02:26,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:26,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485494386] [2025-01-09 05:02:26,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485494386] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:26,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:26,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:02:26,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018698748] [2025-01-09 05:02:26,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:26,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:02:26,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:26,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:02:26,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:02:26,163 INFO L87 Difference]: Start difference. First operand 143 states and 206 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 05:02:26,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:26,207 INFO L93 Difference]: Finished difference Result 276 states and 405 transitions. [2025-01-09 05:02:26,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:02:26,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 148 [2025-01-09 05:02:26,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:26,212 INFO L225 Difference]: With dead ends: 276 [2025-01-09 05:02:26,214 INFO L226 Difference]: Without dead ends: 226 [2025-01-09 05:02:26,215 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-01-09 05:02:26,215 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 142 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:26,215 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 667 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:02:26,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states. [2025-01-09 05:02:26,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 226. [2025-01-09 05:02:26,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 144 states have (on average 1.3263888888888888) internal successors, (191), 144 states have internal predecessors, (191), 67 states have call successors, (67), 14 states have call predecessors, (67), 14 states have return successors, (73), 67 states have call predecessors, (73), 67 states have call successors, (73) [2025-01-09 05:02:26,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 331 transitions. [2025-01-09 05:02:26,245 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 331 transitions. Word has length 148 [2025-01-09 05:02:26,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:26,245 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 331 transitions. [2025-01-09 05:02:26,245 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2025-01-09 05:02:26,246 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 331 transitions. [2025-01-09 05:02:26,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 263 [2025-01-09 05:02:26,250 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:26,250 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:26,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:02:26,251 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:26,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:26,251 INFO L85 PathProgramCache]: Analyzing trace with hash 861282730, now seen corresponding path program 1 times [2025-01-09 05:02:26,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:26,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593256127] [2025-01-09 05:02:26,252 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:26,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:26,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-09 05:02:26,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-09 05:02:26,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:26,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:26,609 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1742 trivial. 0 not checked. [2025-01-09 05:02:26,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:26,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593256127] [2025-01-09 05:02:26,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593256127] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:26,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [81537180] [2025-01-09 05:02:26,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:26,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:26,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:26,612 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-01-09 05:02:26,616 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-01-09 05:02:26,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 262 statements into 1 equivalence classes. [2025-01-09 05:02:27,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 262 of 262 statements. [2025-01-09 05:02:27,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:27,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:27,123 INFO L256 TraceCheckSpWp]: Trace formula consists of 1694 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:02:27,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:27,169 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1742 trivial. 0 not checked. [2025-01-09 05:02:27,169 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:27,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1743 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1742 trivial. 0 not checked. [2025-01-09 05:02:27,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [81537180] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:27,441 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:27,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 05:02:27,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609497002] [2025-01-09 05:02:27,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:27,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:02:27,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:27,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:02:27,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:02:27,443 INFO L87 Difference]: Start difference. First operand 226 states and 331 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 2 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 05:02:31,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:35,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:39,909 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-01-09 05:02:39,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:39,950 INFO L93 Difference]: Finished difference Result 454 states and 666 transitions. [2025-01-09 05:02:39,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:02:39,956 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 2 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) Word has length 262 [2025-01-09 05:02:39,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:39,958 INFO L225 Difference]: With dead ends: 454 [2025-01-09 05:02:39,958 INFO L226 Difference]: Without dead ends: 236 [2025-01-09 05:02:39,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 521 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-01-09 05:02:39,959 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 2 mSDsluCounter, 788 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 987 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.5s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:39,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 987 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 3 Unknown, 0 Unchecked, 12.5s Time] [2025-01-09 05:02:39,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2025-01-09 05:02:39,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 236. [2025-01-09 05:02:39,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 154 states have (on average 1.3181818181818181) internal successors, (203), 154 states have internal predecessors, (203), 67 states have call successors, (67), 14 states have call predecessors, (67), 14 states have return successors, (73), 67 states have call predecessors, (73), 67 states have call successors, (73) [2025-01-09 05:02:39,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 343 transitions. [2025-01-09 05:02:39,975 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 343 transitions. Word has length 262 [2025-01-09 05:02:39,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:39,975 INFO L471 AbstractCegarLoop]: Abstraction has 236 states and 343 transitions. [2025-01-09 05:02:39,975 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 6 states have internal predecessors, (109), 2 states have call successors, (72), 2 states have call predecessors, (72), 2 states have return successors, (72), 2 states have call predecessors, (72), 2 states have call successors, (72) [2025-01-09 05:02:39,975 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 343 transitions. [2025-01-09 05:02:39,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 05:02:39,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:39,978 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 9, 7, 7, 7, 7, 7, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:39,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 05:02:40,179 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-01-09 05:02:40,179 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:40,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:40,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1115961578, now seen corresponding path program 2 times [2025-01-09 05:02:40,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:40,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5308656] [2025-01-09 05:02:40,180 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:02:40,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:40,280 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 272 statements into 2 equivalence classes. [2025-01-09 05:02:40,294 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 272 statements. [2025-01-09 05:02:40,295 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:02:40,295 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:40,487 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1808 trivial. 0 not checked. [2025-01-09 05:02:40,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:40,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5308656] [2025-01-09 05:02:40,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5308656] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:40,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:40,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:02:40,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993847055] [2025-01-09 05:02:40,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:40,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:02:40,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:40,489 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:02:40,489 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:02:40,489 INFO L87 Difference]: Start difference. First operand 236 states and 343 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 05:02:44,501 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-01-09 05:02:45,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:45,180 INFO L93 Difference]: Finished difference Result 646 states and 949 transitions. [2025-01-09 05:02:45,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:02:45,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 272 [2025-01-09 05:02:45,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:45,183 INFO L225 Difference]: With dead ends: 646 [2025-01-09 05:02:45,183 INFO L226 Difference]: Without dead ends: 444 [2025-01-09 05:02:45,184 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-01-09 05:02:45,185 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 186 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:45,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 834 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 4.6s Time] [2025-01-09 05:02:45,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-09 05:02:45,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 440. [2025-01-09 05:02:45,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 440 states, 280 states have (on average 1.3178571428571428) internal successors, (369), 280 states have internal predecessors, (369), 131 states have call successors, (131), 28 states have call predecessors, (131), 28 states have return successors, (150), 131 states have call predecessors, (150), 131 states have call successors, (150) [2025-01-09 05:02:45,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 440 states to 440 states and 650 transitions. [2025-01-09 05:02:45,230 INFO L78 Accepts]: Start accepts. Automaton has 440 states and 650 transitions. Word has length 272 [2025-01-09 05:02:45,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:45,230 INFO L471 AbstractCegarLoop]: Abstraction has 440 states and 650 transitions. [2025-01-09 05:02:45,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 05:02:45,231 INFO L276 IsEmpty]: Start isEmpty. Operand 440 states and 650 transitions. [2025-01-09 05:02:45,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 05:02:45,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:45,235 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 9, 7, 7, 7, 7, 7, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:45,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:02:45,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:45,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:45,236 INFO L85 PathProgramCache]: Analyzing trace with hash -108519286, now seen corresponding path program 1 times [2025-01-09 05:02:45,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:45,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102240362] [2025-01-09 05:02:45,236 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:45,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 05:02:45,436 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 05:02:45,436 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:45,436 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:46,035 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1808 trivial. 0 not checked. [2025-01-09 05:02:46,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:46,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102240362] [2025-01-09 05:02:46,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102240362] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:46,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:46,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:02:46,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [409740595] [2025-01-09 05:02:46,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:46,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:02:46,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:46,037 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:02:46,037 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:02:46,037 INFO L87 Difference]: Start difference. First operand 440 states and 650 transitions. Second operand has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 05:02:50,053 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-01-09 05:02:53,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:53,873 INFO L93 Difference]: Finished difference Result 811 states and 1186 transitions. [2025-01-09 05:02:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:02:53,874 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 272 [2025-01-09 05:02:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:53,878 INFO L225 Difference]: With dead ends: 811 [2025-01-09 05:02:53,881 INFO L226 Difference]: Without dead ends: 399 [2025-01-09 05:02:53,883 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-01-09 05:02:53,884 INFO L435 NwaCegarLoop]: 327 mSDtfsCounter, 182 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 839 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:53,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 839 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 1 Unknown, 0 Unchecked, 7.8s Time] [2025-01-09 05:02:53,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 399 states. [2025-01-09 05:02:53,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 399 to 395. [2025-01-09 05:02:53,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 395 states, 252 states have (on average 1.2658730158730158) internal successors, (319), 252 states have internal predecessors, (319), 117 states have call successors, (117), 25 states have call predecessors, (117), 25 states have return successors, (129), 117 states have call predecessors, (129), 117 states have call successors, (129) [2025-01-09 05:02:53,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 395 states to 395 states and 565 transitions. [2025-01-09 05:02:53,927 INFO L78 Accepts]: Start accepts. Automaton has 395 states and 565 transitions. Word has length 272 [2025-01-09 05:02:53,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:53,927 INFO L471 AbstractCegarLoop]: Abstraction has 395 states and 565 transitions. [2025-01-09 05:02:53,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.25) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (36), 1 states have call predecessors, (36), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2025-01-09 05:02:53,928 INFO L276 IsEmpty]: Start isEmpty. Operand 395 states and 565 transitions. [2025-01-09 05:02:53,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 05:02:53,935 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:53,936 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 9, 7, 7, 7, 7, 7, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:53,936 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:02:53,936 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:53,937 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:53,937 INFO L85 PathProgramCache]: Analyzing trace with hash 834334762, now seen corresponding path program 1 times [2025-01-09 05:02:53,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:53,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200996416] [2025-01-09 05:02:53,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:53,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:54,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 05:02:54,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 05:02:54,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:54,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:54,541 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-01-09 05:02:54,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:54,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200996416] [2025-01-09 05:02:54,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200996416] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:54,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2036928184] [2025-01-09 05:02:54,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:54,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:54,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:54,544 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-01-09 05:02:54,545 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-01-09 05:02:54,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 05:02:55,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 05:02:55,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:55,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:55,126 INFO L256 TraceCheckSpWp]: Trace formula consists of 2000 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 05:02:55,135 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:55,265 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 616 proven. 4 refuted. 0 times theorem prover too weak. 1188 trivial. 0 not checked. [2025-01-09 05:02:55,265 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:55,699 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-01-09 05:02:55,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2036928184] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:55,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:55,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 05:02:55,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228544824] [2025-01-09 05:02:55,700 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:55,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 05:02:55,700 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:55,701 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 05:02:55,701 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:02:55,701 INFO L87 Difference]: Start difference. First operand 395 states and 565 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 9 states have call successors, (72), 5 states have call predecessors, (72), 6 states have return successors, (73), 7 states have call predecessors, (73), 9 states have call successors, (73) [2025-01-09 05:02:56,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:57,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:57,613 INFO L93 Difference]: Finished difference Result 788 states and 1145 transitions. [2025-01-09 05:02:57,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:02:57,614 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 9 states have call successors, (72), 5 states have call predecessors, (72), 6 states have return successors, (73), 7 states have call predecessors, (73), 9 states have call successors, (73) Word has length 272 [2025-01-09 05:02:57,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:57,618 INFO L225 Difference]: With dead ends: 788 [2025-01-09 05:02:57,618 INFO L226 Difference]: Without dead ends: 432 [2025-01-09 05:02:57,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 554 GetRequests, 543 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2025-01-09 05:02:57,623 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 289 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:57,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 801 Invalid, 918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 05:02:57,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2025-01-09 05:02:57,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 429. [2025-01-09 05:02:57,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 279 states have (on average 1.2939068100358424) internal successors, (361), 281 states have internal predecessors, (361), 113 states have call successors, (113), 34 states have call predecessors, (113), 36 states have return successors, (137), 113 states have call predecessors, (137), 113 states have call successors, (137) [2025-01-09 05:02:57,653 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 611 transitions. [2025-01-09 05:02:57,654 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 611 transitions. Word has length 272 [2025-01-09 05:02:57,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:57,654 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 611 transitions. [2025-01-09 05:02:57,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 11 states have internal predecessors, (100), 9 states have call successors, (72), 5 states have call predecessors, (72), 6 states have return successors, (73), 7 states have call predecessors, (73), 9 states have call successors, (73) [2025-01-09 05:02:57,655 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 611 transitions. [2025-01-09 05:02:57,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2025-01-09 05:02:57,659 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:57,659 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 29, 9, 7, 7, 7, 7, 7, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 05:02:57,673 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-01-09 05:02:57,864 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:57,864 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:57,865 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:57,865 INFO L85 PathProgramCache]: Analyzing trace with hash 96930314, now seen corresponding path program 1 times [2025-01-09 05:02:57,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:57,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733222388] [2025-01-09 05:02:57,865 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:57,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:58,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 05:02:58,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 05:02:58,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:58,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:59,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-01-09 05:02:59,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:59,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733222388] [2025-01-09 05:02:59,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733222388] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:59,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195356935] [2025-01-09 05:02:59,934 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:59,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:59,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:59,937 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-01-09 05:02:59,938 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-01-09 05:03:00,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 272 statements into 1 equivalence classes. [2025-01-09 05:03:00,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 272 of 272 statements. [2025-01-09 05:03:00,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:03:00,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:03:00,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 2098 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 05:03:00,582 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:03:00,872 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-01-09 05:03:03,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 05:03:03,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:03:03,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 15 [2025-01-09 05:03:05,674 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-01-09 05:03:05,674 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2025-01-09 05:03:28,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 742 proven. 4 refuted. 0 times theorem prover too weak. 1062 trivial. 0 not checked. [2025-01-09 05:03:28,437 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:03:28,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 23 [2025-01-09 05:03:28,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 31 [2025-01-09 05:03:29,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-01-09 05:03:29,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-01-09 05:03:29,153 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-01-09 05:03:29,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-01-09 05:03:29,318 INFO L134 CoverageAnalysis]: Checked inductivity of 1808 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1804 trivial. 0 not checked. [2025-01-09 05:03:29,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195356935] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:03:29,318 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:03:29,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 37 [2025-01-09 05:03:29,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616233727] [2025-01-09 05:03:29,318 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:03:29,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 05:03:29,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:03:29,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 05:03:29,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1191, Unknown=1, NotChecked=0, Total=1332 [2025-01-09 05:03:29,321 INFO L87 Difference]: Start difference. First operand 429 states and 611 transitions. Second operand has 37 states, 34 states have (on average 4.823529411764706) internal successors, (164), 34 states have internal predecessors, (164), 18 states have call successors, (87), 12 states have call predecessors, (87), 14 states have return successors, (87), 16 states have call predecessors, (87), 18 states have call successors, (87) [2025-01-09 05:03:33,353 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-01-09 05:03:37,363 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-01-09 05:03:40,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:03:44,497 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-09 05:03:48,504 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:03:52,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:03:54,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []