./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_szymanski.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_szymanski.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 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:02:14,843 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:02:14,895 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:14,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:02:14,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:02:14,921 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:02:14,922 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:02:14,922 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:02:14,922 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:02:14,922 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:02:14,922 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:02:14,922 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:02:14,922 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:02:14,922 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:02:14,922 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:02:14,922 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:02:14,923 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:02:14,923 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:02:14,924 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:02:14,924 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:02:14,924 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:02:14,924 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:02:14,924 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:02:14,924 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:02:14,925 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:02:14,925 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:02:14,925 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:02:14,925 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:02:14,925 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:02:14,925 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:02:14,925 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:02:14,925 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:02:14,925 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:02:14,926 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:02:14,926 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:02:14,926 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:02:14,926 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:02:14,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:02:14,926 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:02:14,926 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:02:14,926 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:02:14,926 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:02:14,926 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:02:14,926 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:02:14,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:02:14,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:02:14,927 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:02:14,927 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:02:14,927 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 -> 8c5cb1d1ec86f1df708ae47d652aad74925d4eb7bf3fc3a2c37d76896a5071e8 [2025-01-09 05:02:15,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:02:15,164 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:02:15,166 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:02:15,167 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:02:15,168 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:02:15,169 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_szymanski.i [2025-01-09 05:02:16,254 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/036efe0c1/300eb0a6d27c498c914897becdf78366/FLAG02d49afab [2025-01-09 05:02:16,624 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:02:16,625 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_szymanski.i [2025-01-09 05:02:16,634 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/036efe0c1/300eb0a6d27c498c914897becdf78366/FLAG02d49afab [2025-01-09 05:02:16,649 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/036efe0c1/300eb0a6d27c498c914897becdf78366 [2025-01-09 05:02:16,651 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:02:16,653 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:02:16,655 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:02:16,655 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:02:16,658 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:02:16,659 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:02:16" (1/1) ... [2025-01-09 05:02:16,663 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17654bc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:02:16, skipping insertion in model container [2025-01-09 05:02:16,663 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:02:16" (1/1) ... [2025-01-09 05:02:16,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:02:17,024 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_szymanski.i[23606,23619] [2025-01-09 05:02:17,086 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:02:17,096 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:02:17,125 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_szymanski.i[23606,23619] [2025-01-09 05:02:17,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:02:17,233 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:02:17,235 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,236 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:02:17,236 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:02:17,236 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:02:17,236 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:02:17,242 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,267 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,296 INFO L138 Inliner]: procedures = 145, calls = 298, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 403 [2025-01-09 05:02:17,296 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:02:17,297 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:02:17,297 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:02:17,297 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:02:17,306 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,306 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,317 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,347 INFO L175 MemorySlicer]: Split 144 memory accesses to 16 slices as follows [2, 13, 8, 8, 8, 29, 21, 7, 7, 7, 5, 5, 6, 0, 5, 13]. 20 percent of accesses are in the largest equivalence class. The 40 initializations are split as follows [2, 0, 3, 3, 3, 9, 9, 3, 3, 3, 0, 0, 2, 0, 0, 0]. The 36 writes are split as follows [0, 1, 2, 2, 2, 11, 6, 2, 2, 2, 1, 1, 2, 0, 1, 1]. [2025-01-09 05:02:17,351 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,351 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,378 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,380 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,382 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,386 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,389 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,403 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:02:17,403 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:02:17,403 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:02:17,403 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:02:17,404 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,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:02:17,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:17,446 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,448 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,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 05:02:17,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 05:02:17,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 05:02:17,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 05:02:17,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 05:02:17,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 05:02:17,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 05:02:17,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 05:02:17,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 05:02:17,464 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 05:02:17,465 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 05:02:17,466 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 05:02:17,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 05:02:17,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-01-09 05:02:17,468 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 05:02:17,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-01-09 05:02:17,469 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:02:17,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 05:02:17,469 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-01-09 05:02:17,470 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 05:02:17,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 05:02:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 05:02:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 05:02:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 05:02:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 05:02:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 05:02:17,471 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:02:17,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:02:17,627 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:02:17,629 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:02:22,140 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2025-01-09 05:02:22,140 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:02:22,148 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:02:22,148 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:02:22,149 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:02:22 BoogieIcfgContainer [2025-01-09 05:02:22,149 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:02:22,150 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:02:22,151 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:02:22,154 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:02:22,154 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:02:16" (1/3) ... [2025-01-09 05:02:22,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ab7b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:02:22, skipping insertion in model container [2025-01-09 05:02:22,155 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:22,155 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72ab7b28 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:02:22, skipping insertion in model container [2025-01-09 05:02:22,155 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:02:22" (3/3) ... [2025-01-09 05:02:22,156 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_szymanski.i [2025-01-09 05:02:22,167 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:02:22,168 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_szymanski.i that has 6 procedures, 106 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 05:02:22,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:02:22,212 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;@686d2e6c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:02:22,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 05:02:22,215 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 68 states have internal predecessors, (88), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 05:02:22,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-09 05:02:22,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:22,224 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,224 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:22,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:22,228 INFO L85 PathProgramCache]: Analyzing trace with hash -475652121, now seen corresponding path program 1 times [2025-01-09 05:02:22,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:22,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002365693] [2025-01-09 05:02:22,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:22,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:22,394 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-09 05:02:22,467 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-09 05:02:22,467 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:22,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:22,746 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 05:02:22,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:22,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002365693] [2025-01-09 05:02:22,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002365693] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:22,750 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:22,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:02:22,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105409803] [2025-01-09 05:02:22,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:22,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:02:22,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:22,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:02:22,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:02:22,775 INFO L87 Difference]: Start difference. First operand has 106 states, 67 states have (on average 1.3134328358208955) internal successors, (88), 68 states have internal predecessors, (88), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) Second operand has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 05:02:26,804 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:26,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:26,868 INFO L93 Difference]: Finished difference Result 210 states and 332 transitions. [2025-01-09 05:02:26,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:02:26,870 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 119 [2025-01-09 05:02:26,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:26,877 INFO L225 Difference]: With dead ends: 210 [2025-01-09 05:02:26,877 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 05:02:26,880 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:26,881 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 2 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 291 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.1s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:26,882 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 291 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 1 Unknown, 0 Unchecked, 4.1s Time] [2025-01-09 05:02:26,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 05:02:26,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 103. [2025-01-09 05:02:26,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 65 states have (on average 1.2769230769230768) internal successors, (83), 65 states have internal predecessors, (83), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 05:02:26,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 147 transitions. [2025-01-09 05:02:26,943 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 147 transitions. Word has length 119 [2025-01-09 05:02:26,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:26,943 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 147 transitions. [2025-01-09 05:02:26,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 05:02:26,943 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 147 transitions. [2025-01-09 05:02:26,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2025-01-09 05:02:26,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:26,949 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:02:26,950 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:26,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:26,951 INFO L85 PathProgramCache]: Analyzing trace with hash -578532035, now seen corresponding path program 1 times [2025-01-09 05:02:26,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:26,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099413697] [2025-01-09 05:02:26,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:26,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:27,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 121 statements into 1 equivalence classes. [2025-01-09 05:02:27,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 121 of 121 statements. [2025-01-09 05:02:27,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:27,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:27,241 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 05:02:27,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:27,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099413697] [2025-01-09 05:02:27,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099413697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:27,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:27,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:02:27,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915679389] [2025-01-09 05:02:27,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:27,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:02:27,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:27,244 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:02:27,244 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:02:27,244 INFO L87 Difference]: Start difference. First operand 103 states and 147 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 05:02:27,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:27,266 INFO L93 Difference]: Finished difference Result 204 states and 293 transitions. [2025-01-09 05:02:27,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:02:27,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 121 [2025-01-09 05:02:27,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:27,268 INFO L225 Difference]: With dead ends: 204 [2025-01-09 05:02:27,268 INFO L226 Difference]: Without dead ends: 104 [2025-01-09 05:02:27,269 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:27,270 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 287 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:27,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 287 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:27,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-01-09 05:02:27,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2025-01-09 05:02:27,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 66 states have internal predecessors, (84), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 05:02:27,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 148 transitions. [2025-01-09 05:02:27,278 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 148 transitions. Word has length 121 [2025-01-09 05:02:27,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:27,279 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 148 transitions. [2025-01-09 05:02:27,279 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 05:02:27,279 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 148 transitions. [2025-01-09 05:02:27,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-01-09 05:02:27,280 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:27,280 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,281 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:02:27,281 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:27,281 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:27,281 INFO L85 PathProgramCache]: Analyzing trace with hash 596086095, now seen corresponding path program 1 times [2025-01-09 05:02:27,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:27,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1478343082] [2025-01-09 05:02:27,282 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:27,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:27,353 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:02:27,365 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:02:27,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:27,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:27,477 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 05:02:27,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1478343082] [2025-01-09 05:02:27,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1478343082] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:27,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1086090802] [2025-01-09 05:02:27,478 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:27,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:27,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:27,486 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:27,487 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:27,732 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-01-09 05:02:27,867 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-01-09 05:02:27,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:27,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:27,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 852 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:02:27,878 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:27,925 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 05:02:27,926 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:28,062 INFO L134 CoverageAnalysis]: Checked inductivity of 614 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2025-01-09 05:02:28,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1086090802] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:28,064 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:28,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 05:02:28,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126958667] [2025-01-09 05:02:28,065 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:28,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:02:28,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:28,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:02:28,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:02:28,066 INFO L87 Difference]: Start difference. First operand 104 states and 148 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-01-09 05:02:28,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:28,114 INFO L93 Difference]: Finished difference Result 207 states and 297 transitions. [2025-01-09 05:02:28,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:02:28,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) Word has length 122 [2025-01-09 05:02:28,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:28,117 INFO L225 Difference]: With dead ends: 207 [2025-01-09 05:02:28,117 INFO L226 Difference]: Without dead ends: 106 [2025-01-09 05:02:28,118 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 241 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:28,121 INFO L435 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 284 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:28,121 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 429 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:02:28,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-01-09 05:02:28,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2025-01-09 05:02:28,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 68 states have (on average 1.2647058823529411) internal successors, (86), 68 states have internal predecessors, (86), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2025-01-09 05:02:28,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 150 transitions. [2025-01-09 05:02:28,135 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 150 transitions. Word has length 122 [2025-01-09 05:02:28,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:28,136 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 150 transitions. [2025-01-09 05:02:28,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (36), 2 states have call predecessors, (36), 2 states have return successors, (36), 1 states have call predecessors, (36), 1 states have call successors, (36) [2025-01-09 05:02:28,136 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 150 transitions. [2025-01-09 05:02:28,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-01-09 05:02:28,139 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:28,139 INFO L218 NwaCegarLoop]: trace histogram [18, 18, 18, 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] [2025-01-09 05:02:28,148 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:28,340 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:28,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:28,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:28,342 INFO L85 PathProgramCache]: Analyzing trace with hash 1881133839, now seen corresponding path program 2 times [2025-01-09 05:02:28,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:28,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941660499] [2025-01-09 05:02:28,342 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:02:28,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:28,440 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 124 statements into 2 equivalence classes. [2025-01-09 05:02:28,470 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 124 statements. [2025-01-09 05:02:28,473 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:02:28,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:28,629 INFO L134 CoverageAnalysis]: Checked inductivity of 619 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 619 trivial. 0 not checked. [2025-01-09 05:02:28,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:28,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941660499] [2025-01-09 05:02:28,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941660499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:28,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:28,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:02:28,630 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376097797] [2025-01-09 05:02:28,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:28,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:02:28,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:28,631 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:02:28,631 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:02:28,631 INFO L87 Difference]: Start difference. First operand 106 states and 150 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 05:02:28,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:28,666 INFO L93 Difference]: Finished difference Result 202 states and 291 transitions. [2025-01-09 05:02:28,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:02:28,667 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 124 [2025-01-09 05:02:28,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:28,669 INFO L225 Difference]: With dead ends: 202 [2025-01-09 05:02:28,669 INFO L226 Difference]: Without dead ends: 160 [2025-01-09 05:02:28,670 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:28,670 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 95 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 95 SdHoareTripleChecker+Valid, 454 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:28,670 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [95 Valid, 454 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:28,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2025-01-09 05:02:28,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2025-01-09 05:02:28,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 104 states have (on average 1.2980769230769231) internal successors, (135), 104 states have internal predecessors, (135), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2025-01-09 05:02:28,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 229 transitions. [2025-01-09 05:02:28,695 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 229 transitions. Word has length 124 [2025-01-09 05:02:28,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:28,696 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 229 transitions. [2025-01-09 05:02:28,696 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2025-01-09 05:02:28,696 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 229 transitions. [2025-01-09 05:02:28,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-01-09 05:02:28,699 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:28,699 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:28,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:02:28,699 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:28,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:28,700 INFO L85 PathProgramCache]: Analyzing trace with hash 461746777, now seen corresponding path program 1 times [2025-01-09 05:02:28,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:28,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909815711] [2025-01-09 05:02:28,701 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:28,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:28,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 05:02:28,785 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 05:02:28,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:28,786 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:28,976 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2025-01-09 05:02:28,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:28,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909815711] [2025-01-09 05:02:28,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909815711] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:28,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1089739868] [2025-01-09 05:02:28,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:28,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:28,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:28,983 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:28,987 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:29,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-01-09 05:02:29,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-01-09 05:02:29,408 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:29,408 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:29,412 INFO L256 TraceCheckSpWp]: Trace formula consists of 1360 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:02:29,421 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:29,445 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2025-01-09 05:02:29,445 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:29,643 INFO L134 CoverageAnalysis]: Checked inductivity of 965 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2025-01-09 05:02:29,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1089739868] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:29,643 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:29,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 05:02:29,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506567639] [2025-01-09 05:02:29,643 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:29,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:02:29,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:29,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:02:29,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:02:29,645 INFO L87 Difference]: Start difference. First operand 160 states and 229 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-01-09 05:02:33,680 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:37,693 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:38,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:38,235 INFO L93 Difference]: Finished difference Result 322 states and 462 transitions. [2025-01-09 05:02:38,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:02:38,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) Word has length 193 [2025-01-09 05:02:38,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:38,237 INFO L225 Difference]: With dead ends: 322 [2025-01-09 05:02:38,237 INFO L226 Difference]: Without dead ends: 170 [2025-01-09 05:02:38,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 388 GetRequests, 383 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:38,238 INFO L435 NwaCegarLoop]: 143 mSDtfsCounter, 2 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:38,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 284 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 2 Unknown, 0 Unchecked, 8.6s Time] [2025-01-09 05:02:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2025-01-09 05:02:38,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2025-01-09 05:02:38,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 114 states have internal predecessors, (147), 45 states have call successors, (45), 10 states have call predecessors, (45), 10 states have return successors, (49), 45 states have call predecessors, (49), 45 states have call successors, (49) [2025-01-09 05:02:38,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 241 transitions. [2025-01-09 05:02:38,249 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 241 transitions. Word has length 193 [2025-01-09 05:02:38,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:38,249 INFO L471 AbstractCegarLoop]: Abstraction has 170 states and 241 transitions. [2025-01-09 05:02:38,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 6 states have internal predecessors, (87), 2 states have call successors, (54), 2 states have call predecessors, (54), 2 states have return successors, (54), 2 states have call predecessors, (54), 2 states have call successors, (54) [2025-01-09 05:02:38,250 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 241 transitions. [2025-01-09 05:02:38,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 05:02:38,251 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:38,251 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38,262 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 05:02:38,452 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:38,452 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:38,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:38,453 INFO L85 PathProgramCache]: Analyzing trace with hash -356777511, now seen corresponding path program 2 times [2025-01-09 05:02:38,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:38,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1404034131] [2025-01-09 05:02:38,453 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:02:38,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:38,521 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 203 statements into 2 equivalence classes. [2025-01-09 05:02:38,533 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 203 statements. [2025-01-09 05:02:38,533 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:02:38,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:38,764 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-01-09 05:02:38,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:38,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1404034131] [2025-01-09 05:02:38,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1404034131] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:38,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:38,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:02:38,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687019744] [2025-01-09 05:02:38,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:38,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:02:38,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:38,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:02:38,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:02:38,767 INFO L87 Difference]: Start difference. First operand 170 states and 241 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 05:02:43,671 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:43,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:43,766 INFO L93 Difference]: Finished difference Result 448 states and 643 transitions. [2025-01-09 05:02:43,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:02:43,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 203 [2025-01-09 05:02:43,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:43,770 INFO L225 Difference]: With dead ends: 448 [2025-01-09 05:02:43,772 INFO L226 Difference]: Without dead ends: 312 [2025-01-09 05:02:43,774 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:43,774 INFO L435 NwaCegarLoop]: 236 mSDtfsCounter, 130 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:43,779 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 601 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 1 Unknown, 0 Unchecked, 5.0s Time] [2025-01-09 05:02:43,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 312 states. [2025-01-09 05:02:43,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 312 to 308. [2025-01-09 05:02:43,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 200 states have (on average 1.285) internal successors, (257), 200 states have internal predecessors, (257), 87 states have call successors, (87), 20 states have call predecessors, (87), 20 states have return successors, (102), 87 states have call predecessors, (102), 87 states have call successors, (102) [2025-01-09 05:02:43,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 446 transitions. [2025-01-09 05:02:43,799 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 446 transitions. Word has length 203 [2025-01-09 05:02:43,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:43,799 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 446 transitions. [2025-01-09 05:02:43,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 05:02:43,800 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 446 transitions. [2025-01-09 05:02:43,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 05:02:43,802 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:43,802 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:02:43,802 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:43,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:43,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1722650749, now seen corresponding path program 1 times [2025-01-09 05:02:43,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:43,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429181276] [2025-01-09 05:02:43,804 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:43,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:43,882 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 05:02:43,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 05:02:43,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:43,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:44,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-01-09 05:02:44,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:44,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429181276] [2025-01-09 05:02:44,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429181276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:02:44,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:02:44,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:02:44,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445757509] [2025-01-09 05:02:44,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:02:44,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:02:44,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:44,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:02:44,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:02:44,413 INFO L87 Difference]: Start difference. First operand 308 states and 446 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 05:02:45,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:45,793 INFO L93 Difference]: Finished difference Result 562 states and 801 transitions. [2025-01-09 05:02:45,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:02:45,793 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 203 [2025-01-09 05:02:45,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:45,796 INFO L225 Difference]: With dead ends: 562 [2025-01-09 05:02:45,799 INFO L226 Difference]: Without dead ends: 282 [2025-01-09 05:02:45,800 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,800 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 126 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 605 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:45,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 605 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-01-09 05:02:45,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-01-09 05:02:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 278. [2025-01-09 05:02:45,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 181 states have (on average 1.2430939226519337) internal successors, (225), 181 states have internal predecessors, (225), 78 states have call successors, (78), 18 states have call predecessors, (78), 18 states have return successors, (86), 78 states have call predecessors, (86), 78 states have call successors, (86) [2025-01-09 05:02:45,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 389 transitions. [2025-01-09 05:02:45,830 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 389 transitions. Word has length 203 [2025-01-09 05:02:45,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:45,831 INFO L471 AbstractCegarLoop]: Abstraction has 278 states and 389 transitions. [2025-01-09 05:02:45,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (27), 1 states have call predecessors, (27), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 05:02:45,831 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 389 transitions. [2025-01-09 05:02:45,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 05:02:45,835 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:45,835 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:02:45,836 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:45,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:45,837 INFO L85 PathProgramCache]: Analyzing trace with hash -269086355, now seen corresponding path program 1 times [2025-01-09 05:02:45,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:45,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971419803] [2025-01-09 05:02:45,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:45,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:45,915 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 05:02:45,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 05:02:45,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:45,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:46,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2025-01-09 05:02:46,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:46,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971419803] [2025-01-09 05:02:46,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971419803] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:46,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1722228089] [2025-01-09 05:02:46,395 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:46,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:46,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:46,397 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:46,400 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:46,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 05:02:46,865 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 05:02:46,865 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:46,865 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:46,873 INFO L256 TraceCheckSpWp]: Trace formula consists of 1618 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 05:02:46,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:46,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 288 proven. 4 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2025-01-09 05:02:46,988 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:47,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2025-01-09 05:02:47,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1722228089] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:47,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:47,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 05:02:47,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620507415] [2025-01-09 05:02:47,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:47,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 05:02:47,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:47,374 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 05:02:47,374 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:02:47,374 INFO L87 Difference]: Start difference. First operand 278 states and 389 transitions. Second operand has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (54), 5 states have call predecessors, (54), 6 states have return successors, (55), 7 states have call predecessors, (55), 9 states have call successors, (55) [2025-01-09 05:02:48,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:02:48,347 INFO L93 Difference]: Finished difference Result 562 states and 800 transitions. [2025-01-09 05:02:48,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:02:48,347 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (54), 5 states have call predecessors, (54), 6 states have return successors, (55), 7 states have call predecessors, (55), 9 states have call successors, (55) Word has length 203 [2025-01-09 05:02:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:02:48,350 INFO L225 Difference]: With dead ends: 562 [2025-01-09 05:02:48,350 INFO L226 Difference]: Without dead ends: 308 [2025-01-09 05:02:48,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 405 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:48,354 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 194 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 437 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 05:02:48,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 437 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 05:02:48,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2025-01-09 05:02:48,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 305. [2025-01-09 05:02:48,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 203 states have (on average 1.2610837438423645) internal successors, (256), 205 states have internal predecessors, (256), 73 states have call successors, (73), 26 states have call predecessors, (73), 28 states have return successors, (93), 73 states have call predecessors, (93), 73 states have call successors, (93) [2025-01-09 05:02:48,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 422 transitions. [2025-01-09 05:02:48,379 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 422 transitions. Word has length 203 [2025-01-09 05:02:48,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:02:48,380 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 422 transitions. [2025-01-09 05:02:48,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.2727272727272725) internal successors, (80), 11 states have internal predecessors, (80), 9 states have call successors, (54), 5 states have call predecessors, (54), 6 states have return successors, (55), 7 states have call predecessors, (55), 9 states have call successors, (55) [2025-01-09 05:02:48,380 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 422 transitions. [2025-01-09 05:02:48,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-09 05:02:48,383 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:02:48,383 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 05:02:48,587 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:48,587 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:02:48,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:02:48,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1424372915, now seen corresponding path program 1 times [2025-01-09 05:02:48,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:02:48,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803767288] [2025-01-09 05:02:48,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:48,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:02:48,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 05:02:48,744 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 05:02:48,744 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:48,744 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:50,343 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2025-01-09 05:02:50,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:02:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803767288] [2025-01-09 05:02:50,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803767288] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:50,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1938331608] [2025-01-09 05:02:50,343 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:02:50,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:02:50,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:02:50,348 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:50,351 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:02:50,722 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-09 05:02:50,921 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-09 05:02:50,922 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:02:50,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:02:50,931 INFO L256 TraceCheckSpWp]: Trace formula consists of 1716 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-01-09 05:02:50,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:02:50,983 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 10 treesize of output 8 [2025-01-09 05:02:51,032 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 11 treesize of output 7 [2025-01-09 05:02:51,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_old(~__CS_thread_index~0)| 1))) (or (exists ((|v_old(#memory_int#12)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#12)_AFTER_CALL_8| |c_#memory_int#12|))) (and (not (= .cse0 |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (= .cse1 (select (select |v_old(#memory_int#12)_AFTER_CALL_8| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)) (= (store |v_old(#memory_int#12)_AFTER_CALL_8| .cse0 (select |c_#memory_int#12| .cse0)) |c_#memory_int#12|)))) (= .cse1 (select (select |c_#memory_int#12| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)))) is different from false [2025-01-09 05:02:51,188 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_old(~__CS_thread_index~0)| 1))) (or (exists ((|v_old(#memory_int#12)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#12)_AFTER_CALL_8| |c_#memory_int#12|))) (and (not (= .cse0 |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (= .cse1 (select (select |v_old(#memory_int#12)_AFTER_CALL_8| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)) (= (store |v_old(#memory_int#12)_AFTER_CALL_8| .cse0 (select |c_#memory_int#12| .cse0)) |c_#memory_int#12|)))) (= .cse1 (select (select |c_#memory_int#12| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)))) is different from true [2025-01-09 05:02:51,224 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 17 treesize of output 9 [2025-01-09 05:02:51,310 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 288 proven. 4 refuted. 0 times theorem prover too weak. 738 trivial. 0 not checked. [2025-01-09 05:02:51,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:51,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:02:51,520 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 23 [2025-01-09 05:02:51,523 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-09 05:02:51,524 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 12 [2025-01-09 05:02:51,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1938331608] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:02:51,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 05:02:51,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 18] total 26 [2025-01-09 05:02:51,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601887403] [2025-01-09 05:02:51,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:51,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-01-09 05:02:51,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:51,801 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-01-09 05:02:51,801 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=771, Unknown=4, NotChecked=56, Total=930 [2025-01-09 05:02:51,801 INFO L87 Difference]: Start difference. First operand 305 states and 422 transitions. Second operand has 26 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 22 states have internal predecessors, (77), 12 states have call successors, (51), 5 states have call predecessors, (51), 9 states have return successors, (52), 10 states have call predecessors, (52), 12 states have call successors, (52) [2025-01-09 05:02:55,819 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:00,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:03:05,610 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:06,029 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_old(~__CS_thread_index~0)| 1))) (let ((.cse2 (= .cse1 (select (select |c_#memory_int#12| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)))) (and (not (= |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t2~0#1.base| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (or (exists ((|v_old(#memory_int#12)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#12)_AFTER_CALL_8| |c_#memory_int#12|))) (and (not (= .cse0 |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (= .cse1 (select (select |v_old(#memory_int#12)_AFTER_CALL_8| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)) (= (store |v_old(#memory_int#12)_AFTER_CALL_8| .cse0 (select |c_#memory_int#12| .cse0)) |c_#memory_int#12|)))) .cse2) .cse2))) is different from false [2025-01-09 05:03:06,031 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_old(~__CS_thread_index~0)| 1))) (let ((.cse2 (= .cse1 (select (select |c_#memory_int#12| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)))) (and (not (= |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t2~0#1.base| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (or (exists ((|v_old(#memory_int#12)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_old(#memory_int#12)_AFTER_CALL_8| |c_#memory_int#12|))) (and (not (= .cse0 |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (= .cse1 (select (select |v_old(#memory_int#12)_AFTER_CALL_8| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)) (= (store |v_old(#memory_int#12)_AFTER_CALL_8| .cse0 (select |c_#memory_int#12| .cse0)) |c_#memory_int#12|)))) .cse2) .cse2))) is different from true [2025-01-09 05:03:07,011 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_old(~__CS_thread_index~0)| 1)) (.cse4 (select (select |c_#memory_int#12| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|))) (let ((.cse0 (not (= |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t2~0#1.base| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|))) (.cse3 (= .cse2 .cse4))) (and .cse0 (or (exists ((|v_old(#memory_int#12)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#12)_AFTER_CALL_8| |c_#memory_int#12|))) (and (not (= .cse1 |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (= .cse2 (select (select |v_old(#memory_int#12)_AFTER_CALL_8| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)) (= (store |v_old(#memory_int#12)_AFTER_CALL_8| .cse1 (select |c_#memory_int#12| .cse1)) |c_#memory_int#12|)))) .cse3) (or (not (= |c_old(~__CS_thread_index~0)| 0)) (and (= c_~__CS_thread_index~0 1) .cse0 (= .cse4 1))) .cse3))) is different from false [2025-01-09 05:03:07,013 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_old(~__CS_thread_index~0)| 1)) (.cse4 (select (select |c_#memory_int#12| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|))) (let ((.cse0 (not (= |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t2~0#1.base| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|))) (.cse3 (= .cse2 .cse4))) (and .cse0 (or (exists ((|v_old(#memory_int#12)_AFTER_CALL_8| (Array Int (Array Int Int)))) (let ((.cse1 (@diff |v_old(#memory_int#12)_AFTER_CALL_8| |c_#memory_int#12|))) (and (not (= .cse1 |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|)) (= .cse2 (select (select |v_old(#memory_int#12)_AFTER_CALL_8| |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.base|) |c_##fun~$Pointer$~TO~$Pointer$_main_thread_~#t1~0#1.offset|)) (= (store |v_old(#memory_int#12)_AFTER_CALL_8| .cse1 (select |c_#memory_int#12| .cse1)) |c_#memory_int#12|)))) .cse3) (or (not (= |c_old(~__CS_thread_index~0)| 0)) (and (= c_~__CS_thread_index~0 1) .cse0 (= .cse4 1))) .cse3))) is different from true [2025-01-09 05:03:07,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:03:07,499 INFO L93 Difference]: Finished difference Result 471 states and 668 transitions. [2025-01-09 05:03:07,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-01-09 05:03:07,499 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 22 states have internal predecessors, (77), 12 states have call successors, (51), 5 states have call predecessors, (51), 9 states have return successors, (52), 10 states have call predecessors, (52), 12 states have call successors, (52) Word has length 203 [2025-01-09 05:03:07,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:03:07,502 INFO L225 Difference]: With dead ends: 471 [2025-01-09 05:03:07,502 INFO L226 Difference]: Without dead ends: 332 [2025-01-09 05:03:07,504 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 393 GetRequests, 341 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 503 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=313, Invalid=1947, Unknown=8, NotChecked=282, Total=2550 [2025-01-09 05:03:07,504 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 174 mSDsluCounter, 1340 mSDsCounter, 0 mSdLazyCounter, 2147 mSolverCounterSat, 160 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 1471 SdHoareTripleChecker+Invalid, 2604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 2147 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 294 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:03:07,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 1471 Invalid, 2604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 2147 Invalid, 3 Unknown, 294 Unchecked, 15.3s Time] [2025-01-09 05:03:07,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-01-09 05:03:07,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 321. [2025-01-09 05:03:07,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 212 states have (on average 1.259433962264151) internal successors, (267), 217 states have internal predecessors, (267), 76 states have call successors, (76), 26 states have call predecessors, (76), 32 states have return successors, (112), 77 states have call predecessors, (112), 76 states have call successors, (112) [2025-01-09 05:03:07,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 455 transitions. [2025-01-09 05:03:07,527 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 455 transitions. Word has length 203 [2025-01-09 05:03:07,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:03:07,527 INFO L471 AbstractCegarLoop]: Abstraction has 321 states and 455 transitions. [2025-01-09 05:03:07,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 24 states have (on average 3.2083333333333335) internal successors, (77), 22 states have internal predecessors, (77), 12 states have call successors, (51), 5 states have call predecessors, (51), 9 states have return successors, (52), 10 states have call predecessors, (52), 12 states have call successors, (52) [2025-01-09 05:03:07,528 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 455 transitions. [2025-01-09 05:03:07,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 05:03:07,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:03:07,531 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:07,565 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 05:03:07,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-09 05:03:07,736 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:03:07,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:03:07,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1938039852, now seen corresponding path program 1 times [2025-01-09 05:03:07,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:03:07,737 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [298791603] [2025-01-09 05:03:07,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:03:07,737 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:03:07,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 05:03:07,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 05:03:07,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:03:07,855 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:03:07,931 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1030 trivial. 0 not checked. [2025-01-09 05:03:07,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:03:07,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [298791603] [2025-01-09 05:03:07,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [298791603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:03:07,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:03:07,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:03:07,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1462213742] [2025-01-09 05:03:07,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:03:07,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:03:07,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:03:07,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:03:07,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:03:07,933 INFO L87 Difference]: Start difference. First operand 321 states and 455 transitions. Second operand has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 05:03:07,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:03:07,953 INFO L93 Difference]: Finished difference Result 574 states and 866 transitions. [2025-01-09 05:03:07,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:03:07,953 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 206 [2025-01-09 05:03:07,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:03:07,955 INFO L225 Difference]: With dead ends: 574 [2025-01-09 05:03:07,955 INFO L226 Difference]: Without dead ends: 325 [2025-01-09 05:03:07,957 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:03:07,958 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 0 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:03:07,959 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 284 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:03:07,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 325 states. [2025-01-09 05:03:07,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 325 to 325. [2025-01-09 05:03:07,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 216 states have (on average 1.2546296296296295) internal successors, (271), 221 states have internal predecessors, (271), 76 states have call successors, (76), 26 states have call predecessors, (76), 32 states have return successors, (112), 77 states have call predecessors, (112), 76 states have call successors, (112) [2025-01-09 05:03:07,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 459 transitions. [2025-01-09 05:03:07,985 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 459 transitions. Word has length 206 [2025-01-09 05:03:07,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:03:07,987 INFO L471 AbstractCegarLoop]: Abstraction has 325 states and 459 transitions. [2025-01-09 05:03:07,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.666666666666668) internal successors, (59), 3 states have internal predecessors, (59), 2 states have call successors, (27), 1 states have call predecessors, (27), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2025-01-09 05:03:07,987 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 459 transitions. [2025-01-09 05:03:07,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-09 05:03:07,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:03:07,990 INFO L218 NwaCegarLoop]: trace histogram [22, 22, 22, 9, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03:07,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 05:03:07,990 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:03:07,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:03:07,990 INFO L85 PathProgramCache]: Analyzing trace with hash 2007687726, now seen corresponding path program 1 times [2025-01-09 05:03:07,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:03:07,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476589411] [2025-01-09 05:03:07,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:03:07,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:03:08,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 05:03:08,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 05:03:08,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:03:08,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:03:09,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2025-01-09 05:03:09,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:03:09,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476589411] [2025-01-09 05:03:09,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476589411] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:03:09,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [905613777] [2025-01-09 05:03:09,644 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:03:09,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:03:09,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:03:09,650 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 05:03:09,651 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 05:03:10,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-09 05:03:10,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-09 05:03:10,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:03:10,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:03:10,332 INFO L256 TraceCheckSpWp]: Trace formula consists of 1725 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 05:03:10,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:03:10,454 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:16,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 05:03:16,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:03:16,375 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:17,968 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-01-09 05:03:17,969 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:36,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 333 proven. 4 refuted. 0 times theorem prover too weak. 693 trivial. 0 not checked. [2025-01-09 05:03:36,527 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:03:36,717 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:36,720 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:44,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [905613777] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:03:44,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 05:03:44,124 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 23 [2025-01-09 05:03:44,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648681409] [2025-01-09 05:03:44,125 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 05:03:44,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 05:03:44,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:03:44,126 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 05:03:44,127 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=637, Unknown=3, NotChecked=0, Total=756 [2025-01-09 05:03:44,127 INFO L87 Difference]: Start difference. First operand 325 states and 459 transitions. Second operand has 23 states, 22 states have (on average 5.2272727272727275) internal successors, (115), 23 states have internal predecessors, (115), 13 states have call successors, (56), 10 states have call predecessors, (56), 11 states have return successors, (56), 13 states have call predecessors, (56), 13 states have call successors, (56) [2025-01-09 05:03:47,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:03:51,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:03:54,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []