./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/seq-pthread/cs_stack-1.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_stack-1.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 f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 05:01:06,093 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 05:01:06,197 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:01:06,202 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 05:01:06,202 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 05:01:06,225 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 05:01:06,226 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 05:01:06,226 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 05:01:06,227 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 05:01:06,227 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 05:01:06,227 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 05:01:06,228 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 05:01:06,228 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 05:01:06,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 05:01:06,228 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 05:01:06,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 05:01:06,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 05:01:06,229 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 05:01:06,230 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 05:01:06,230 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 05:01:06,230 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 05:01:06,230 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 05:01:06,230 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 05:01:06,230 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 05:01:06,230 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 05:01:06,230 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 05:01:06,230 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 05:01:06,230 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 05:01:06,230 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 05:01:06,230 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:01:06,231 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:01:06,231 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 05:01:06,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 05:01:06,231 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 -> f673ebb9e7e04aacff207de4acfe748a76999a1319247236c14ae51e44f23889 [2025-01-09 05:01:06,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 05:01:06,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 05:01:06,505 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 05:01:06,507 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 05:01:06,507 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 05:01:06,508 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_stack-1.i [2025-01-09 05:01:07,705 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e5c312cf/5ebd5cb6eee1477e982081da127b7349/FLAG4213ad82e [2025-01-09 05:01:08,020 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 05:01:08,021 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i [2025-01-09 05:01:08,037 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e5c312cf/5ebd5cb6eee1477e982081da127b7349/FLAG4213ad82e [2025-01-09 05:01:08,272 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6e5c312cf/5ebd5cb6eee1477e982081da127b7349 [2025-01-09 05:01:08,275 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 05:01:08,276 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 05:01:08,277 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 05:01:08,277 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 05:01:08,280 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 05:01:08,281 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:08,282 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43ccf8b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08, skipping insertion in model container [2025-01-09 05:01:08,282 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:08,314 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 05:01:08,667 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i[34744,34757] [2025-01-09 05:01:08,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:01:08,784 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 05:01:08,814 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_stack-1.i[34744,34757] [2025-01-09 05:01:08,864 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 05:01:08,902 INFO L204 MainTranslator]: Completed translation [2025-01-09 05:01:08,903 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08 WrapperNode [2025-01-09 05:01:08,905 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 05:01:08,905 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 05:01:08,906 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 05:01:08,906 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 05:01:08,911 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:01:08" (1/1) ... [2025-01-09 05:01:08,938 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:01:08" (1/1) ... [2025-01-09 05:01:08,975 INFO L138 Inliner]: procedures = 254, calls = 303, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 681 [2025-01-09 05:01:08,975 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 05:01:08,976 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 05:01:08,976 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 05:01:08,976 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 05:01:08,986 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:08,987 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:08,993 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:09,026 INFO L175 MemorySlicer]: Split 156 memory accesses to 18 slices as follows [2, 6, 8, 8, 8, 20, 12, 3, 12, 3, 4, 5, 21, 0, 22, 8, 7, 7]. 14 percent of accesses are in the largest equivalence class. The 53 initializations are split as follows [2, 2, 3, 3, 3, 6, 6, 0, 2, 0, 2, 2, 10, 0, 10, 2, 0, 0]. The 38 writes are split as follows [0, 2, 2, 2, 2, 8, 3, 1, 3, 1, 1, 1, 1, 0, 6, 3, 1, 1]. [2025-01-09 05:01:09,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:09,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:09,053 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:09,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:09,064 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:09,075 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:09,079 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:09,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 05:01:09,098 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 05:01:09,098 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 05:01:09,098 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 05:01:09,100 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08" (1/1) ... [2025-01-09 05:01:09,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 05:01:09,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:09,127 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:01:09,129 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:01:09,145 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 05:01:09,145 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 05:01:09,145 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-09 05:01:09,145 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-01-09 05:01:09,145 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#14 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#15 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#16 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#17 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-01-09 05:01:09,146 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#14 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#15 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#16 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#17 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-01-09 05:01:09,147 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-01-09 05:01:09,147 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-01-09 05:01:09,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-01-09 05:01:09,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#14 [2025-01-09 05:01:09,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#15 [2025-01-09 05:01:09,148 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#16 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#17 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-01-09 05:01:09,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-01-09 05:01:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-01-09 05:01:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-01-09 05:01:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#14 [2025-01-09 05:01:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#15 [2025-01-09 05:01:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#16 [2025-01-09 05:01:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#17 [2025-01-09 05:01:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure get_top [2025-01-09 05:01:09,150 INFO L138 BoogieDeclarations]: Found implementation of procedure get_top [2025-01-09 05:01:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 05:01:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-01-09 05:01:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-01-09 05:01:09,150 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#14 [2025-01-09 05:01:09,151 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#15 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#16 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#17 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-01-09 05:01:09,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-01-09 05:01:09,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:01:09,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure error [2025-01-09 05:01:09,152 INFO L138 BoogieDeclarations]: Found implementation of procedure error [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-01-09 05:01:09,152 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-01-09 05:01:09,152 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-01-09 05:01:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#14 [2025-01-09 05:01:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#15 [2025-01-09 05:01:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#16 [2025-01-09 05:01:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#17 [2025-01-09 05:01:09,153 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 05:01:09,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 05:01:09,361 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 05:01:09,363 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 05:01:09,404 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:09,404 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);#res := 0; [2025-01-09 05:01:09,805 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##90: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-01-09 05:01:09,805 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##91: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:09,805 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##50: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-01-09 05:01:09,805 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##54: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-01-09 05:01:09,805 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##51: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:09,806 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##55: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:09,806 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##40: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:09,806 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##39: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-01-09 05:01:09,806 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);pop_#res#1 := 0; [2025-01-09 05:01:09,806 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L1005: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296));pop_#res#1 := 0; [2025-01-09 05:01:09,806 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L989-2: SUMMARY for call __CS_cs(); srcloc: null [2025-01-09 05:01:09,806 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##106: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:09,806 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##105: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);push_#res#1 := 0; [2025-01-09 05:01:09,847 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##8: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:09,848 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-01-09 05:01:09,848 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##7: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-01-09 05:01:09,848 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:09,848 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##4: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:09,848 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L933: SUMMARY for call __CS_cs(); srcloc: null [2025-01-09 05:01:09,848 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-01-09 05:01:09,848 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint L933-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-01-09 05:01:09,848 INFO L727 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##3: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296); [2025-01-09 05:01:10,287 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-01-09 05:01:10,287 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 05:01:10,299 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 05:01:10,299 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-09 05:01:10,300 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:01:10 BoogieIcfgContainer [2025-01-09 05:01:10,300 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 05:01:10,301 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 05:01:10,302 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 05:01:10,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 05:01:10,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 05:01:08" (1/3) ... [2025-01-09 05:01:10,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773355d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:01:10, skipping insertion in model container [2025-01-09 05:01:10,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 05:01:08" (2/3) ... [2025-01-09 05:01:10,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@773355d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 05:01:10, skipping insertion in model container [2025-01-09 05:01:10,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 05:01:10" (3/3) ... [2025-01-09 05:01:10,309 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_stack-1.i [2025-01-09 05:01:10,320 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 05:01:10,321 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_stack-1.i that has 10 procedures, 217 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-09 05:01:10,374 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 05:01:10,383 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;@225cab6f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 05:01:10,383 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 05:01:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand has 217 states, 133 states have (on average 1.518796992481203) internal successors, (202), 136 states have internal predecessors, (202), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 05:01:10,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 05:01:10,405 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:10,406 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:10,406 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:10,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:10,410 INFO L85 PathProgramCache]: Analyzing trace with hash 767767038, now seen corresponding path program 1 times [2025-01-09 05:01:10,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:10,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274901317] [2025-01-09 05:01:10,415 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:10,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:10,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 05:01:10,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 05:01:10,653 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:10,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:10,968 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 05:01:10,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:10,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274901317] [2025-01-09 05:01:10,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274901317] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:10,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:10,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:01:10,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929946633] [2025-01-09 05:01:10,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:10,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:01:10,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:10,991 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:01:10,992 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:01:10,994 INFO L87 Difference]: Start difference. First operand has 217 states, 133 states have (on average 1.518796992481203) internal successors, (202), 136 states have internal predecessors, (202), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 05:01:15,030 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:01:15,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:15,111 INFO L93 Difference]: Finished difference Result 432 states and 761 transitions. [2025-01-09 05:01:15,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:01:15,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 95 [2025-01-09 05:01:15,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:15,123 INFO L225 Difference]: With dead ends: 432 [2025-01-09 05:01:15,123 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 05:01:15,127 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:01:15,130 INFO L435 NwaCegarLoop]: 342 mSDtfsCounter, 4 mSDsluCounter, 339 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 681 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:15,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 681 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 1 Unknown, 0 Unchecked, 4.0s Time] [2025-01-09 05:01:15,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 05:01:15,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 214. [2025-01-09 05:01:15,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 131 states have (on average 1.5038167938931297) internal successors, (197), 133 states have internal predecessors, (197), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 05:01:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 343 transitions. [2025-01-09 05:01:15,176 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 343 transitions. Word has length 95 [2025-01-09 05:01:15,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:15,177 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 343 transitions. [2025-01-09 05:01:15,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 05:01:15,177 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 343 transitions. [2025-01-09 05:01:15,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2025-01-09 05:01:15,182 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:15,182 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:15,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 05:01:15,183 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:15,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:15,183 INFO L85 PathProgramCache]: Analyzing trace with hash 2116394567, now seen corresponding path program 1 times [2025-01-09 05:01:15,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:15,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331525254] [2025-01-09 05:01:15,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:15,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:15,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 98 statements into 1 equivalence classes. [2025-01-09 05:01:15,287 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 98 of 98 statements. [2025-01-09 05:01:15,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:15,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:15,482 INFO L134 CoverageAnalysis]: Checked inductivity of 365 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2025-01-09 05:01:15,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:15,486 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331525254] [2025-01-09 05:01:15,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331525254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:15,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:15,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 05:01:15,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392712012] [2025-01-09 05:01:15,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:15,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 05:01:15,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:15,487 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 05:01:15,487 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 05:01:15,487 INFO L87 Difference]: Start difference. First operand 214 states and 343 transitions. Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 05:01:15,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:15,533 INFO L93 Difference]: Finished difference Result 427 states and 687 transitions. [2025-01-09 05:01:15,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 05:01:15,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 98 [2025-01-09 05:01:15,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:15,536 INFO L225 Difference]: With dead ends: 427 [2025-01-09 05:01:15,536 INFO L226 Difference]: Without dead ends: 216 [2025-01-09 05:01:15,537 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:01:15,537 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:15,537 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 676 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:01:15,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 216 states. [2025-01-09 05:01:15,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 216 to 216. [2025-01-09 05:01:15,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 133 states have (on average 1.4962406015037595) internal successors, (199), 135 states have internal predecessors, (199), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 05:01:15,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 345 transitions. [2025-01-09 05:01:15,565 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 345 transitions. Word has length 98 [2025-01-09 05:01:15,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:15,567 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 345 transitions. [2025-01-09 05:01:15,567 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 05:01:15,567 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 345 transitions. [2025-01-09 05:01:15,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-01-09 05:01:15,572 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:15,572 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:15,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 05:01:15,573 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:15,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:15,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2131347753, now seen corresponding path program 1 times [2025-01-09 05:01:15,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:15,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859659316] [2025-01-09 05:01:15,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:15,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:15,645 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:01:15,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:01:15,663 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:15,663 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:15,811 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-01-09 05:01:15,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:15,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859659316] [2025-01-09 05:01:15,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859659316] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:15,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [706355288] [2025-01-09 05:01:15,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:15,813 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:15,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:15,815 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:01:15,818 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:01:16,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 100 statements into 1 equivalence classes. [2025-01-09 05:01:16,163 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 100 of 100 statements. [2025-01-09 05:01:16,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:16,163 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:16,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 822 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 05:01:16,173 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:16,211 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-01-09 05:01:16,211 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:16,285 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-01-09 05:01:16,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [706355288] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:16,285 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:16,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 6 [2025-01-09 05:01:16,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196189436] [2025-01-09 05:01:16,285 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:16,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 05:01:16,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:16,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 05:01:16,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-09 05:01:16,287 INFO L87 Difference]: Start difference. First operand 216 states and 345 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 05:01:16,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:16,323 INFO L93 Difference]: Finished difference Result 433 states and 695 transitions. [2025-01-09 05:01:16,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 05:01:16,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 100 [2025-01-09 05:01:16,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:16,326 INFO L225 Difference]: With dead ends: 433 [2025-01-09 05:01:16,326 INFO L226 Difference]: Without dead ends: 220 [2025-01-09 05:01:16,327 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 197 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:01:16,328 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 0 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:16,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 676 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:01:16,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2025-01-09 05:01:16,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 220. [2025-01-09 05:01:16,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 137 states have (on average 1.4817518248175183) internal successors, (203), 139 states have internal predecessors, (203), 73 states have call successors, (73), 9 states have call predecessors, (73), 9 states have return successors, (73), 73 states have call predecessors, (73), 73 states have call successors, (73) [2025-01-09 05:01:16,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 349 transitions. [2025-01-09 05:01:16,341 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 349 transitions. Word has length 100 [2025-01-09 05:01:16,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:16,341 INFO L471 AbstractCegarLoop]: Abstraction has 220 states and 349 transitions. [2025-01-09 05:01:16,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 6 states have internal predecessors, (41), 1 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-01-09 05:01:16,341 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 349 transitions. [2025-01-09 05:01:16,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-01-09 05:01:16,343 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:16,343 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:16,353 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:01:16,544 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:01:16,544 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:16,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:16,545 INFO L85 PathProgramCache]: Analyzing trace with hash 405919017, now seen corresponding path program 2 times [2025-01-09 05:01:16,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:16,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486655740] [2025-01-09 05:01:16,545 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-09 05:01:16,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:16,604 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 104 statements into 2 equivalence classes. [2025-01-09 05:01:16,625 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 17 of 104 statements. [2025-01-09 05:01:16,625 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-01-09 05:01:16,625 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:16,773 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2025-01-09 05:01:16,774 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:16,774 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486655740] [2025-01-09 05:01:16,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486655740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:16,774 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:16,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 05:01:16,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552171008] [2025-01-09 05:01:16,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:16,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 05:01:16,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:16,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 05:01:16,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 05:01:16,775 INFO L87 Difference]: Start difference. First operand 220 states and 349 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 05:01:16,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:16,826 INFO L93 Difference]: Finished difference Result 426 states and 688 transitions. [2025-01-09 05:01:16,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 05:01:16,827 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2025-01-09 05:01:16,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:16,831 INFO L225 Difference]: With dead ends: 426 [2025-01-09 05:01:16,832 INFO L226 Difference]: Without dead ends: 392 [2025-01-09 05:01:16,832 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:01:16,833 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 295 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 295 SdHoareTripleChecker+Valid, 1058 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:16,833 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [295 Valid, 1058 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 05:01:16,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2025-01-09 05:01:16,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 391. [2025-01-09 05:01:16,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 391 states, 241 states have (on average 1.5228215767634854) internal successors, (367), 245 states have internal predecessors, (367), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2025-01-09 05:01:16,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 391 states and 637 transitions. [2025-01-09 05:01:16,882 INFO L78 Accepts]: Start accepts. Automaton has 391 states and 637 transitions. Word has length 104 [2025-01-09 05:01:16,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:16,882 INFO L471 AbstractCegarLoop]: Abstraction has 391 states and 637 transitions. [2025-01-09 05:01:16,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2025-01-09 05:01:16,883 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 637 transitions. [2025-01-09 05:01:16,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2025-01-09 05:01:16,890 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:16,891 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 5, 5, 5, 5, 5, 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] [2025-01-09 05:01:16,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 05:01:16,891 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:16,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:16,892 INFO L85 PathProgramCache]: Analyzing trace with hash -220785352, now seen corresponding path program 1 times [2025-01-09 05:01:16,892 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:16,892 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631767315] [2025-01-09 05:01:16,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:16,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:16,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:01:16,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:01:16,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:16,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 750 trivial. 0 not checked. [2025-01-09 05:01:17,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:17,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631767315] [2025-01-09 05:01:17,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631767315] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:17,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107267182] [2025-01-09 05:01:17,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:17,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:17,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:17,214 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:01:17,216 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:01:17,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 187 statements into 1 equivalence classes. [2025-01-09 05:01:17,688 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 187 of 187 statements. [2025-01-09 05:01:17,689 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:17,689 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:17,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 1428 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 05:01:17,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:17,745 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2025-01-09 05:01:17,747 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:17,937 INFO L134 CoverageAnalysis]: Checked inductivity of 751 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 744 trivial. 0 not checked. [2025-01-09 05:01:17,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107267182] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:17,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:17,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 9 [2025-01-09 05:01:17,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761151155] [2025-01-09 05:01:17,938 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:17,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 05:01:17,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:17,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 05:01:17,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2025-01-09 05:01:17,940 INFO L87 Difference]: Start difference. First operand 391 states and 637 transitions. Second operand has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 05:01:22,073 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:01:22,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:22,296 INFO L93 Difference]: Finished difference Result 792 states and 1291 transitions. [2025-01-09 05:01:22,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 05:01:22,300 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 187 [2025-01-09 05:01:22,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:22,304 INFO L225 Difference]: With dead ends: 792 [2025-01-09 05:01:22,304 INFO L226 Difference]: Without dead ends: 404 [2025-01-09 05:01:22,306 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 374 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=126, Invalid=216, Unknown=0, NotChecked=0, Total=342 [2025-01-09 05:01:22,307 INFO L435 NwaCegarLoop]: 337 mSDtfsCounter, 12 mSDsluCounter, 1343 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 17 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 1680 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:22,307 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 1680 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 26 Invalid, 1 Unknown, 0 Unchecked, 4.3s Time] [2025-01-09 05:01:22,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 404 states. [2025-01-09 05:01:22,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 404 to 404. [2025-01-09 05:01:22,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 254 states have (on average 1.5039370078740157) internal successors, (382), 258 states have internal predecessors, (382), 131 states have call successors, (131), 18 states have call predecessors, (131), 18 states have return successors, (139), 131 states have call predecessors, (139), 131 states have call successors, (139) [2025-01-09 05:01:22,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 652 transitions. [2025-01-09 05:01:22,336 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 652 transitions. Word has length 187 [2025-01-09 05:01:22,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:22,336 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 652 transitions. [2025-01-09 05:01:22,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.666666666666666) internal successors, (96), 9 states have internal predecessors, (96), 2 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2025-01-09 05:01:22,336 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 652 transitions. [2025-01-09 05:01:22,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 05:01:22,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:22,340 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:22,349 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:01:22,541 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:01:22,541 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:22,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:22,541 INFO L85 PathProgramCache]: Analyzing trace with hash -2050867231, now seen corresponding path program 1 times [2025-01-09 05:01:22,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:22,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88155231] [2025-01-09 05:01:22,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:22,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:22,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 05:01:22,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 05:01:22,636 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:22,636 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:23,233 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-01-09 05:01:23,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:23,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88155231] [2025-01-09 05:01:23,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88155231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:23,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:23,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:01:23,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630518770] [2025-01-09 05:01:23,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:23,235 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:01:23,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:23,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:01:23,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:23,236 INFO L87 Difference]: Start difference. First operand 404 states and 652 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 05:01:27,401 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:01:31,409 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:01:31,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:31,669 INFO L93 Difference]: Finished difference Result 831 states and 1351 transitions. [2025-01-09 05:01:31,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:31,670 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 196 [2025-01-09 05:01:31,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:31,675 INFO L225 Difference]: With dead ends: 831 [2025-01-09 05:01:31,675 INFO L226 Difference]: Without dead ends: 793 [2025-01-09 05:01:31,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:01:31,676 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 397 mSDsluCounter, 1017 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 52 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1409 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:31,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1409 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 103 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-01-09 05:01:31,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2025-01-09 05:01:31,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 786. [2025-01-09 05:01:31,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 786 states, 485 states have (on average 1.5154639175257731) internal successors, (735), 496 states have internal predecessors, (735), 261 states have call successors, (261), 36 states have call predecessors, (261), 39 states have return successors, (293), 261 states have call predecessors, (293), 261 states have call successors, (293) [2025-01-09 05:01:31,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 786 states to 786 states and 1289 transitions. [2025-01-09 05:01:31,767 INFO L78 Accepts]: Start accepts. Automaton has 786 states and 1289 transitions. Word has length 196 [2025-01-09 05:01:31,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:31,768 INFO L471 AbstractCegarLoop]: Abstraction has 786 states and 1289 transitions. [2025-01-09 05:01:31,769 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 05:01:31,769 INFO L276 IsEmpty]: Start isEmpty. Operand 786 states and 1289 transitions. [2025-01-09 05:01:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 05:01:31,776 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:31,776 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:31,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 05:01:31,777 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:31,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:31,777 INFO L85 PathProgramCache]: Analyzing trace with hash 1865819533, now seen corresponding path program 1 times [2025-01-09 05:01:31,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:31,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999021074] [2025-01-09 05:01:31,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:31,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 05:01:31,873 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 05:01:31,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:31,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:32,330 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-01-09 05:01:32,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:32,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999021074] [2025-01-09 05:01:32,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999021074] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:32,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:32,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:01:32,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530791731] [2025-01-09 05:01:32,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:32,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:01:32,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:32,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:01:32,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:32,333 INFO L87 Difference]: Start difference. First operand 786 states and 1289 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 05:01:33,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:33,143 INFO L93 Difference]: Finished difference Result 1532 states and 2505 transitions. [2025-01-09 05:01:33,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-09 05:01:33,144 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 196 [2025-01-09 05:01:33,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:33,152 INFO L225 Difference]: With dead ends: 1532 [2025-01-09 05:01:33,152 INFO L226 Difference]: Without dead ends: 773 [2025-01-09 05:01:33,155 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:01:33,156 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 399 mSDsluCounter, 1020 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:33,157 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 1412 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 05:01:33,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2025-01-09 05:01:33,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 769. [2025-01-09 05:01:33,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 769 states, 476 states have (on average 1.5084033613445378) internal successors, (718), 487 states have internal predecessors, (718), 253 states have call successors, (253), 35 states have call predecessors, (253), 39 states have return successors, (279), 254 states have call predecessors, (279), 253 states have call successors, (279) [2025-01-09 05:01:33,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 769 states to 769 states and 1250 transitions. [2025-01-09 05:01:33,213 INFO L78 Accepts]: Start accepts. Automaton has 769 states and 1250 transitions. Word has length 196 [2025-01-09 05:01:33,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:33,214 INFO L471 AbstractCegarLoop]: Abstraction has 769 states and 1250 transitions. [2025-01-09 05:01:33,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 05:01:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 769 states and 1250 transitions. [2025-01-09 05:01:33,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-01-09 05:01:33,221 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:33,221 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:33,221 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 05:01:33,221 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:33,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1786053943, now seen corresponding path program 1 times [2025-01-09 05:01:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:33,222 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [383817086] [2025-01-09 05:01:33,222 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:33,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:33,281 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-01-09 05:01:33,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-01-09 05:01:33,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:33,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:33,802 INFO L134 CoverageAnalysis]: Checked inductivity of 831 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-01-09 05:01:33,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:33,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [383817086] [2025-01-09 05:01:33,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [383817086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 05:01:33,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 05:01:33,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 05:01:33,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293826909] [2025-01-09 05:01:33,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 05:01:33,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 05:01:33,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:33,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 05:01:33,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 05:01:33,804 INFO L87 Difference]: Start difference. First operand 769 states and 1250 transitions. Second operand has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 05:01:37,823 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:01:41,836 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:01:42,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:42,339 INFO L93 Difference]: Finished difference Result 1218 states and 1948 transitions. [2025-01-09 05:01:42,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 05:01:42,339 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) Word has length 196 [2025-01-09 05:01:42,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:42,345 INFO L225 Difference]: With dead ends: 1218 [2025-01-09 05:01:42,345 INFO L226 Difference]: Without dead ends: 689 [2025-01-09 05:01:42,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 05:01:42,352 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 390 mSDsluCounter, 911 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 37 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1313 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:42,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1313 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 245 Invalid, 2 Unknown, 0 Unchecked, 8.4s Time] [2025-01-09 05:01:42,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 689 states. [2025-01-09 05:01:42,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 689 to 679. [2025-01-09 05:01:42,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 679 states, 425 states have (on average 1.4752941176470589) internal successors, (627), 434 states have internal predecessors, (627), 214 states have call successors, (214), 35 states have call predecessors, (214), 39 states have return successors, (238), 215 states have call predecessors, (238), 214 states have call successors, (238) [2025-01-09 05:01:42,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 679 states to 679 states and 1079 transitions. [2025-01-09 05:01:42,410 INFO L78 Accepts]: Start accepts. Automaton has 679 states and 1079 transitions. Word has length 196 [2025-01-09 05:01:42,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:42,410 INFO L471 AbstractCegarLoop]: Abstraction has 679 states and 1079 transitions. [2025-01-09 05:01:42,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 14.75) internal successors, (59), 5 states have internal predecessors, (59), 4 states have call successors, (23), 1 states have call predecessors, (23), 2 states have return successors, (23), 3 states have call predecessors, (23), 4 states have call successors, (23) [2025-01-09 05:01:42,411 INFO L276 IsEmpty]: Start isEmpty. Operand 679 states and 1079 transitions. [2025-01-09 05:01:42,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 05:01:42,416 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:42,416 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:42,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 05:01:42,416 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:42,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:42,417 INFO L85 PathProgramCache]: Analyzing trace with hash 166864277, now seen corresponding path program 1 times [2025-01-09 05:01:42,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:42,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631654612] [2025-01-09 05:01:42,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:42,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:42,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 05:01:42,557 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 05:01:42,558 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:42,558 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:42,907 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-01-09 05:01:42,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631654612] [2025-01-09 05:01:42,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631654612] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:42,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137115289] [2025-01-09 05:01:42,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:42,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:42,907 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:42,910 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:01:42,913 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:01:43,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 05:01:43,398 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 05:01:43,398 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:43,398 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:43,406 INFO L256 TraceCheckSpWp]: Trace formula consists of 1673 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 05:01:43,414 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:43,536 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 280 proven. 4 refuted. 0 times theorem prover too weak. 551 trivial. 0 not checked. [2025-01-09 05:01:43,538 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:01:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-01-09 05:01:43,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137115289] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:01:43,830 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:01:43,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 5] total 11 [2025-01-09 05:01:43,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [585535783] [2025-01-09 05:01:43,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:01:43,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 05:01:43,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:01:43,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 05:01:43,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=72, Unknown=0, NotChecked=0, Total=110 [2025-01-09 05:01:43,832 INFO L87 Difference]: Start difference. First operand 679 states and 1079 transitions. Second operand has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2025-01-09 05:01:44,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:01:46,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 05:01:46,257 INFO L93 Difference]: Finished difference Result 1715 states and 2745 transitions. [2025-01-09 05:01:46,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 05:01:46,257 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) Word has length 200 [2025-01-09 05:01:46,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 05:01:46,264 INFO L225 Difference]: With dead ends: 1715 [2025-01-09 05:01:46,264 INFO L226 Difference]: Without dead ends: 1063 [2025-01-09 05:01:46,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 410 GetRequests, 399 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:01:46,268 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 1167 mSDsluCounter, 681 mSDsCounter, 0 mSdLazyCounter, 834 mSolverCounterSat, 729 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1250 SdHoareTripleChecker+Valid, 1064 SdHoareTripleChecker+Invalid, 1563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 729 IncrementalHoareTripleChecker+Valid, 834 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-09 05:01:46,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1250 Valid, 1064 Invalid, 1563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [729 Valid, 834 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-09 05:01:46,269 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2025-01-09 05:01:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1042. [2025-01-09 05:01:46,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1042 states, 645 states have (on average 1.4744186046511627) internal successors, (951), 660 states have internal predecessors, (951), 335 states have call successors, (335), 57 states have call predecessors, (335), 61 states have return successors, (373), 334 states have call predecessors, (373), 335 states have call successors, (373) [2025-01-09 05:01:46,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1659 transitions. [2025-01-09 05:01:46,329 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1659 transitions. Word has length 200 [2025-01-09 05:01:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 05:01:46,330 INFO L471 AbstractCegarLoop]: Abstraction has 1042 states and 1659 transitions. [2025-01-09 05:01:46,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.818181818181818) internal successors, (86), 11 states have internal predecessors, (86), 9 states have call successors, (48), 5 states have call predecessors, (48), 6 states have return successors, (49), 7 states have call predecessors, (49), 9 states have call successors, (49) [2025-01-09 05:01:46,330 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1659 transitions. [2025-01-09 05:01:46,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-09 05:01:46,337 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 05:01:46,337 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 19, 10, 6, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 05:01:46,348 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:01:46,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:46,541 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 05:01:46,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 05:01:46,542 INFO L85 PathProgramCache]: Analyzing trace with hash -968751179, now seen corresponding path program 1 times [2025-01-09 05:01:46,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 05:01:46,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602843660] [2025-01-09 05:01:46,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:46,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 05:01:46,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 05:01:46,729 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 05:01:46,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:46,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:48,233 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-01-09 05:01:48,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 05:01:48,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602843660] [2025-01-09 05:01:48,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602843660] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 05:01:48,234 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [495792803] [2025-01-09 05:01:48,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 05:01:48,234 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 05:01:48,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 05:01:48,236 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:01:48,238 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:01:48,656 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-09 05:01:48,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-09 05:01:48,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 05:01:48,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 05:01:48,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 1771 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-01-09 05:01:48,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 05:01:49,055 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:01:55,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-09 05:01:55,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-09 05:01:55,735 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:01:56,463 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2025-01-09 05:01:56,463 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:02:24,159 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 352 proven. 4 refuted. 0 times theorem prover too weak. 479 trivial. 0 not checked. [2025-01-09 05:02:24,159 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 05:02:24,368 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:02:24,378 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:02:24,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-01-09 05:02:24,753 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-01-09 05:02:24,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2025-01-09 05:02:24,812 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 22 [2025-01-09 05:02:24,906 INFO L134 CoverageAnalysis]: Checked inductivity of 835 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 831 trivial. 0 not checked. [2025-01-09 05:02:24,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [495792803] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 05:02:24,906 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 05:02:24,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14, 9] total 37 [2025-01-09 05:02:24,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692381822] [2025-01-09 05:02:24,906 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 05:02:24,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-01-09 05:02:24,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 05:02:24,907 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-01-09 05:02:24,907 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1192, Unknown=4, NotChecked=0, Total=1332 [2025-01-09 05:02:24,908 INFO L87 Difference]: Start difference. First operand 1042 states and 1659 transitions. Second operand has 37 states, 34 states have (on average 4.323529411764706) internal successors, (147), 35 states have internal predecessors, (147), 18 states have call successors, (59), 12 states have call predecessors, (59), 14 states have return successors, (59), 16 states have call predecessors, (59), 18 states have call successors, (59) [2025-01-09 05:02:29,118 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:30,810 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:34,821 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:37,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-01-09 05:02:41,426 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 []