./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/sum20-2.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/reducercommutativity/sum20-2.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7c2f5d73c406c3ffc9c27d7cd89dbe0ce5d7ec9b20c32fdf36fe2abec0cffd86 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:16:03,056 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:16:03,109 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:16:03,114 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:16:03,116 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:16:03,136 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:16:03,136 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:16:03,136 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:16:03,137 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:16:03,137 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:16:03,137 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:16:03,137 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:16:03,137 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:16:03,137 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:16:03,137 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:16:03,137 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:16:03,137 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:16:03,137 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:16:03,137 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:16:03,137 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:16:03,137 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:16:03,138 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:16:03,138 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:16:03,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:16:03,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:16:03,139 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:16:03,139 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:16:03,139 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:16:03,139 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:16:03,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:16:03,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:16:03,140 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:16:03,140 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:16:03,140 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 -> 7c2f5d73c406c3ffc9c27d7cd89dbe0ce5d7ec9b20c32fdf36fe2abec0cffd86 [2025-01-08 22:16:03,336 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:16:03,342 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:16:03,345 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:16:03,346 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:16:03,346 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:16:03,346 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/sum20-2.i [2025-01-08 22:16:04,450 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f06a0bc7b/4f8a875d72c24b2ab751e31d7155b19a/FLAG0e1a9544f [2025-01-08 22:16:04,646 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:16:04,646 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/reducercommutativity/sum20-2.i [2025-01-08 22:16:04,655 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f06a0bc7b/4f8a875d72c24b2ab751e31d7155b19a/FLAG0e1a9544f [2025-01-08 22:16:05,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f06a0bc7b/4f8a875d72c24b2ab751e31d7155b19a [2025-01-08 22:16:05,023 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:16:05,024 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:16:05,025 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:16:05,026 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:16:05,029 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:16:05,029 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,030 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6174b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05, skipping insertion in model container [2025-01-08 22:16:05,030 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,041 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:16:05,131 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/reducercommutativity/sum20-2.i[1277,1290] [2025-01-08 22:16:05,134 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:16:05,140 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:16:05,153 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/reducercommutativity/sum20-2.i[1277,1290] [2025-01-08 22:16:05,154 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:16:05,162 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:16:05,163 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05 WrapperNode [2025-01-08 22:16:05,163 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:16:05,164 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:16:05,164 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:16:05,164 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:16:05,167 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,176 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,184 INFO L138 Inliner]: procedures = 16, calls = 22, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 63 [2025-01-08 22:16:05,185 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:16:05,186 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:16:05,186 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:16:05,187 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:16:05,192 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,192 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,193 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,202 INFO L175 MemorySlicer]: Split 12 memory accesses to 2 slices as follows [2, 10]. 83 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 5 writes are split as follows [0, 5]. [2025-01-08 22:16:05,202 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,202 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,205 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,207 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,209 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,210 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,211 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:16:05,212 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:16:05,212 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:16:05,212 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:16:05,213 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (1/1) ... [2025-01-08 22:16:05,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:16:05,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:05,234 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:16:05,235 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-08 22:16:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:16:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2025-01-08 22:16:05,249 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2025-01-08 22:16:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:16:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:16:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:16:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:16:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:16:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:16:05,249 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:16:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:16:05,249 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:16:05,250 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:16:05,292 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:16:05,293 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:16:05,414 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-01-08 22:16:05,414 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:16:05,421 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:16:05,422 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:16:05,422 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:16:05 BoogieIcfgContainer [2025-01-08 22:16:05,422 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:16:05,424 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:16:05,424 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:16:05,428 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:16:05,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:16:05" (1/3) ... [2025-01-08 22:16:05,428 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3766d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:16:05, skipping insertion in model container [2025-01-08 22:16:05,428 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:16:05" (2/3) ... [2025-01-08 22:16:05,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3766d81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:16:05, skipping insertion in model container [2025-01-08 22:16:05,429 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:16:05" (3/3) ... [2025-01-08 22:16:05,430 INFO L128 eAbstractionObserver]: Analyzing ICFG sum20-2.i [2025-01-08 22:16:05,440 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:16:05,442 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sum20-2.i that has 2 procedures, 21 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-01-08 22:16:05,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:16:05,487 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;@7fce841a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:16:05,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:16:05,490 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:05,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:16:05,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:05,495 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:05,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:05,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:05,499 INFO L85 PathProgramCache]: Analyzing trace with hash -733969895, now seen corresponding path program 1 times [2025-01-08 22:16:05,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:05,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645478172] [2025-01-08 22:16:05,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:05,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:05,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:16:05,575 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:16:05,575 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:05,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:05,693 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:16:05,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:05,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645478172] [2025-01-08 22:16:05,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645478172] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:16:05,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:16:05,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:16:05,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654129692] [2025-01-08 22:16:05,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:16:05,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:16:05,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:05,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:16:05,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:16:05,710 INFO L87 Difference]: Start difference. First operand has 21 states, 15 states have (on average 1.3333333333333333) internal successors, (20), 16 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:16:05,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:05,734 INFO L93 Difference]: Finished difference Result 40 states and 50 transitions. [2025-01-08 22:16:05,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:16:05,736 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 24 [2025-01-08 22:16:05,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:05,739 INFO L225 Difference]: With dead ends: 40 [2025-01-08 22:16:05,739 INFO L226 Difference]: Without dead ends: 18 [2025-01-08 22:16:05,741 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-08 22:16:05,745 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:05,745 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:05,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-01-08 22:16:05,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-01-08 22:16:05,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:05,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-01-08 22:16:05,768 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 24 [2025-01-08 22:16:05,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:05,768 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-01-08 22:16:05,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:16:05,769 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-01-08 22:16:05,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-01-08 22:16:05,769 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:05,769 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:05,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:16:05,770 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:05,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:05,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1924336377, now seen corresponding path program 1 times [2025-01-08 22:16:05,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:05,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1483897923] [2025-01-08 22:16:05,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:05,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:05,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:16:05,791 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:16:05,791 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:05,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:05,879 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:16:05,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:05,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1483897923] [2025-01-08 22:16:05,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1483897923] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:05,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [416792239] [2025-01-08 22:16:05,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:05,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:05,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:05,882 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-08 22:16:05,883 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-08 22:16:05,931 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-01-08 22:16:05,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-01-08 22:16:05,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:05,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:05,960 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:16:05,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:05,977 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:16:05,979 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:16:05,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [416792239] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:16:05,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:16:05,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:16:05,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722020312] [2025-01-08 22:16:05,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:16:05,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:16:05,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:05,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:16:05,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:16:05,982 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:16:05,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:05,990 INFO L93 Difference]: Finished difference Result 32 states and 42 transitions. [2025-01-08 22:16:05,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:16:05,990 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-01-08 22:16:05,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:05,990 INFO L225 Difference]: With dead ends: 32 [2025-01-08 22:16:05,990 INFO L226 Difference]: Without dead ends: 19 [2025-01-08 22:16:05,991 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:16:05,991 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:05,991 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:05,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-01-08 22:16:05,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-01-08 22:16:05,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-01-08 22:16:05,995 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 25 [2025-01-08 22:16:05,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:05,995 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-01-08 22:16:05,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:16:05,996 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-01-08 22:16:05,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-01-08 22:16:05,996 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:05,996 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:06,002 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-08 22:16:06,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:06,198 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:06,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:06,198 INFO L85 PathProgramCache]: Analyzing trace with hash -777568978, now seen corresponding path program 1 times [2025-01-08 22:16:06,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:06,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434027861] [2025-01-08 22:16:06,198 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:06,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:06,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:16:06,210 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:16:06,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:06,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:06,275 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2025-01-08 22:16:06,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434027861] [2025-01-08 22:16:06,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434027861] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:06,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1368942951] [2025-01-08 22:16:06,276 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:06,276 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:06,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:06,278 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-08 22:16:06,280 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-08 22:16:06,324 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-01-08 22:16:06,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-01-08 22:16:06,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:06,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:06,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:16:06,358 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:06,370 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-01-08 22:16:06,370 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:16:06,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1368942951] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:16:06,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:16:06,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-01-08 22:16:06,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097890937] [2025-01-08 22:16:06,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:16:06,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:16:06,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:06,375 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:16:06,375 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:16:06,375 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:16:06,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:06,383 INFO L93 Difference]: Finished difference Result 30 states and 35 transitions. [2025-01-08 22:16:06,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:16:06,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-01-08 22:16:06,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:06,384 INFO L225 Difference]: With dead ends: 30 [2025-01-08 22:16:06,384 INFO L226 Difference]: Without dead ends: 20 [2025-01-08 22:16:06,384 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:16:06,385 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 37 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:06,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:06,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-01-08 22:16:06,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-01-08 22:16:06,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:06,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-01-08 22:16:06,391 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 28 [2025-01-08 22:16:06,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:06,392 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-01-08 22:16:06,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:16:06,392 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-01-08 22:16:06,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:16:06,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:06,393 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:06,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:16:06,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:06,597 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:06,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:06,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1570668432, now seen corresponding path program 1 times [2025-01-08 22:16:06,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:06,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054000590] [2025-01-08 22:16:06,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:06,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:06,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:16:06,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:16:06,609 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:06,609 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:06,657 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:16:06,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054000590] [2025-01-08 22:16:06,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054000590] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:06,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1340480275] [2025-01-08 22:16:06,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:16:06,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:06,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:06,660 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-08 22:16:06,661 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-08 22:16:06,702 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:16:06,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:16:06,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:06,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:06,723 INFO L256 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:16:06,724 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:06,746 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:16:06,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:06,781 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:16:06,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1340480275] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:06,782 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:06,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-08 22:16:06,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786181607] [2025-01-08 22:16:06,782 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:06,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:16:06,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:06,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:16:06,784 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:16:06,784 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-08 22:16:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:06,795 INFO L93 Difference]: Finished difference Result 39 states and 49 transitions. [2025-01-08 22:16:06,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:16:06,796 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 29 [2025-01-08 22:16:06,796 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:06,796 INFO L225 Difference]: With dead ends: 39 [2025-01-08 22:16:06,796 INFO L226 Difference]: Without dead ends: 23 [2025-01-08 22:16:06,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:16:06,797 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:06,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:06,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-08 22:16:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-08 22:16:06,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:06,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-01-08 22:16:06,800 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 29 [2025-01-08 22:16:06,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:06,800 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-01-08 22:16:06,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-08 22:16:06,800 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-01-08 22:16:06,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 22:16:06,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:06,801 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:06,808 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-08 22:16:07,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:07,001 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:07,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:07,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1010131280, now seen corresponding path program 2 times [2025-01-08 22:16:07,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:07,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062505844] [2025-01-08 22:16:07,002 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:16:07,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:07,013 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-08 22:16:07,029 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:16:07,029 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:16:07,030 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:16:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:07,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062505844] [2025-01-08 22:16:07,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062505844] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:07,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085460250] [2025-01-08 22:16:07,092 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:16:07,092 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:07,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:07,094 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-08 22:16:07,095 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-08 22:16:07,137 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 32 statements into 2 equivalence classes. [2025-01-08 22:16:07,156 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:16:07,156 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:16:07,156 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:07,157 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:16:07,158 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:07,200 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:16:07,200 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:07,273 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-01-08 22:16:07,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085460250] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:07,273 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:07,273 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 7, 7] total 14 [2025-01-08 22:16:07,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484590577] [2025-01-08 22:16:07,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:07,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-08 22:16:07,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:07,275 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-08 22:16:07,275 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:16:07,276 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-08 22:16:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:07,313 INFO L93 Difference]: Finished difference Result 46 states and 63 transitions. [2025-01-08 22:16:07,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-08 22:16:07,316 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) Word has length 32 [2025-01-08 22:16:07,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:07,316 INFO L225 Difference]: With dead ends: 46 [2025-01-08 22:16:07,316 INFO L226 Difference]: Without dead ends: 30 [2025-01-08 22:16:07,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2025-01-08 22:16:07,317 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:07,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 155 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:07,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-08 22:16:07,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-01-08 22:16:07,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:07,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2025-01-08 22:16:07,321 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 32 [2025-01-08 22:16:07,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:07,321 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2025-01-08 22:16:07,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.4285714285714284) internal successors, (34), 14 states have internal predecessors, (34), 2 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 1 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-08 22:16:07,321 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2025-01-08 22:16:07,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-01-08 22:16:07,323 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:07,323 INFO L218 NwaCegarLoop]: trace histogram [10, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:07,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:16:07,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:07,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:07,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:07,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1583012915, now seen corresponding path program 3 times [2025-01-08 22:16:07,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:07,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613667277] [2025-01-08 22:16:07,525 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:16:07,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:07,540 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 6 equivalence classes. [2025-01-08 22:16:07,553 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 41 statements. [2025-01-08 22:16:07,553 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:16:07,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:07,595 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-08 22:16:07,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:07,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613667277] [2025-01-08 22:16:07,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613667277] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:07,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [712463027] [2025-01-08 22:16:07,596 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:16:07,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:07,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:07,597 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:16:07,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:16:07,644 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 41 statements into 6 equivalence classes. [2025-01-08 22:16:07,657 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 22 of 41 statements. [2025-01-08 22:16:07,657 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-01-08 22:16:07,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:07,658 INFO L256 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:16:07,659 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:07,670 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-08 22:16:07,670 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:07,698 INFO L134 CoverageAnalysis]: Checked inductivity of 101 backedges. 22 proven. 3 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-01-08 22:16:07,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [712463027] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:07,699 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:07,699 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-01-08 22:16:07,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591143712] [2025-01-08 22:16:07,699 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:07,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-08 22:16:07,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:07,700 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-08 22:16:07,700 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:16:07,700 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:16:07,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:07,710 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2025-01-08 22:16:07,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:16:07,710 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 41 [2025-01-08 22:16:07,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:07,711 INFO L225 Difference]: With dead ends: 50 [2025-01-08 22:16:07,711 INFO L226 Difference]: Without dead ends: 34 [2025-01-08 22:16:07,711 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=36, Unknown=0, NotChecked=0, Total=72 [2025-01-08 22:16:07,711 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:07,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 74 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:07,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-01-08 22:16:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2025-01-08 22:16:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.103448275862069) internal successors, (32), 29 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:07,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2025-01-08 22:16:07,715 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 41 [2025-01-08 22:16:07,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:07,715 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2025-01-08 22:16:07,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:16:07,715 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2025-01-08 22:16:07,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-01-08 22:16:07,716 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:07,716 INFO L218 NwaCegarLoop]: trace histogram [18, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:07,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 22:16:07,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:07,917 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:07,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:07,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1087566323, now seen corresponding path program 4 times [2025-01-08 22:16:07,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:07,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632446475] [2025-01-08 22:16:07,918 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:16:07,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:07,930 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-01-08 22:16:07,942 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 22:16:07,943 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:16:07,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:08,175 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-08 22:16:08,176 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632446475] [2025-01-08 22:16:08,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632446475] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:08,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366104750] [2025-01-08 22:16:08,176 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:16:08,176 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:08,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:08,178 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:16:08,180 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-08 22:16:08,224 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 53 statements into 2 equivalence classes. [2025-01-08 22:16:08,254 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 53 of 53 statements. [2025-01-08 22:16:08,254 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:16:08,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:08,255 INFO L256 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:16:08,257 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:08,283 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-08 22:16:08,285 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:08,442 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2025-01-08 22:16:08,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366104750] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:08,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:08,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 23 [2025-01-08 22:16:08,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495170268] [2025-01-08 22:16:08,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:08,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-08 22:16:08,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:08,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-08 22:16:08,444 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:16:08,444 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-08 22:16:08,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:08,474 INFO L93 Difference]: Finished difference Result 65 states and 82 transitions. [2025-01-08 22:16:08,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-08 22:16:08,477 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 53 [2025-01-08 22:16:08,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:08,477 INFO L225 Difference]: With dead ends: 65 [2025-01-08 22:16:08,477 INFO L226 Difference]: Without dead ends: 44 [2025-01-08 22:16:08,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 94 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:16:08,478 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:08,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 110 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:08,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2025-01-08 22:16:08,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2025-01-08 22:16:08,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 39 states have (on average 1.0769230769230769) internal successors, (42), 39 states have internal predecessors, (42), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:08,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2025-01-08 22:16:08,484 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 53 [2025-01-08 22:16:08,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:08,484 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2025-01-08 22:16:08,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.7826086956521738) internal successors, (41), 23 states have internal predecessors, (41), 1 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-01-08 22:16:08,485 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2025-01-08 22:16:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-01-08 22:16:08,486 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:08,487 INFO L218 NwaCegarLoop]: trace histogram [20, 18, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:08,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-08 22:16:08,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-01-08 22:16:08,687 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:08,688 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:08,688 INFO L85 PathProgramCache]: Analyzing trace with hash -2040601101, now seen corresponding path program 5 times [2025-01-08 22:16:08,688 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:08,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503216098] [2025-01-08 22:16:08,688 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:16:08,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:08,702 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 63 statements into 11 equivalence classes. [2025-01-08 22:16:08,790 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 52 of 63 statements. [2025-01-08 22:16:08,790 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-01-08 22:16:08,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:08,905 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 51 proven. 72 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2025-01-08 22:16:08,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:08,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503216098] [2025-01-08 22:16:08,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503216098] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:08,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2053570341] [2025-01-08 22:16:08,906 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:16:08,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:08,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:08,908 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:16:08,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 22:16:08,959 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 63 statements into 11 equivalence classes. [2025-01-08 22:16:09,333 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) and asserted 52 of 63 statements. [2025-01-08 22:16:09,333 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 10 check-sat command(s) [2025-01-08 22:16:09,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:09,335 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-08 22:16:09,337 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 100 proven. 21 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2025-01-08 22:16:09,360 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:09,444 INFO L134 CoverageAnalysis]: Checked inductivity of 430 backedges. 0 proven. 123 refuted. 0 times theorem prover too weak. 307 trivial. 0 not checked. [2025-01-08 22:16:09,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2053570341] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:09,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:09,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 16 [2025-01-08 22:16:09,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963678043] [2025-01-08 22:16:09,444 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:09,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-08 22:16:09,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:09,445 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-08 22:16:09,445 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:16:09,445 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-08 22:16:09,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:09,464 INFO L93 Difference]: Finished difference Result 72 states and 89 transitions. [2025-01-08 22:16:09,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-08 22:16:09,465 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 63 [2025-01-08 22:16:09,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:09,465 INFO L225 Difference]: With dead ends: 72 [2025-01-08 22:16:09,465 INFO L226 Difference]: Without dead ends: 52 [2025-01-08 22:16:09,466 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2025-01-08 22:16:09,466 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:09,466 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:09,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-01-08 22:16:09,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-01-08 22:16:09,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 47 states have (on average 1.0638297872340425) internal successors, (50), 47 states have internal predecessors, (50), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:09,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2025-01-08 22:16:09,470 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 63 [2025-01-08 22:16:09,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:09,471 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2025-01-08 22:16:09,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.25) internal successors, (36), 16 states have internal predecessors, (36), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2025-01-08 22:16:09,471 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2025-01-08 22:16:09,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-08 22:16:09,471 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:09,472 INFO L218 NwaCegarLoop]: trace histogram [42, 20, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:09,479 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-01-08 22:16:09,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:09,672 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:09,673 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:09,673 INFO L85 PathProgramCache]: Analyzing trace with hash 20328819, now seen corresponding path program 6 times [2025-01-08 22:16:09,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:09,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110671136] [2025-01-08 22:16:09,673 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:16:09,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:09,687 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 87 statements into 17 equivalence classes. [2025-01-08 22:16:09,702 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 37 of 87 statements. [2025-01-08 22:16:09,702 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-01-08 22:16:09,702 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:09,749 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2025-01-08 22:16:09,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:09,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110671136] [2025-01-08 22:16:09,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110671136] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:09,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2049601679] [2025-01-08 22:16:09,749 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:16:09,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:09,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:09,751 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:16:09,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-01-08 22:16:09,812 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 87 statements into 17 equivalence classes. [2025-01-08 22:16:09,833 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) and asserted 37 of 87 statements. [2025-01-08 22:16:09,834 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2025-01-08 22:16:09,834 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:09,835 INFO L256 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:16:09,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:09,847 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 456 proven. 1 refuted. 0 times theorem prover too weak. 753 trivial. 0 not checked. [2025-01-08 22:16:09,848 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:09,870 INFO L134 CoverageAnalysis]: Checked inductivity of 1210 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1209 trivial. 0 not checked. [2025-01-08 22:16:09,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2049601679] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:09,870 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:09,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-08 22:16:09,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647808063] [2025-01-08 22:16:09,871 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:09,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 22:16:09,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:09,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 22:16:09,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:16:09,873 INFO L87 Difference]: Start difference. First operand 52 states and 56 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:16:09,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:09,889 INFO L93 Difference]: Finished difference Result 78 states and 85 transitions. [2025-01-08 22:16:09,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 22:16:09,890 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 87 [2025-01-08 22:16:09,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:09,891 INFO L225 Difference]: With dead ends: 78 [2025-01-08 22:16:09,892 INFO L226 Difference]: Without dead ends: 55 [2025-01-08 22:16:09,892 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-01-08 22:16:09,892 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:09,892 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 54 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:09,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-08 22:16:09,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2025-01-08 22:16:09,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.06) internal successors, (53), 50 states have internal predecessors, (53), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:09,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 59 transitions. [2025-01-08 22:16:09,899 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 59 transitions. Word has length 87 [2025-01-08 22:16:09,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:09,900 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 59 transitions. [2025-01-08 22:16:09,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:16:09,902 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 59 transitions. [2025-01-08 22:16:09,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2025-01-08 22:16:09,902 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:09,902 INFO L218 NwaCegarLoop]: trace histogram [42, 20, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:09,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-01-08 22:16:10,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:10,107 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:10,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:10,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1384402887, now seen corresponding path program 7 times [2025-01-08 22:16:10,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:10,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399992853] [2025-01-08 22:16:10,107 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:16:10,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:10,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-08 22:16:10,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-08 22:16:10,139 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:10,140 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:10,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 0 proven. 559 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-01-08 22:16:10,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:10,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399992853] [2025-01-08 22:16:10,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399992853] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:10,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [429713493] [2025-01-08 22:16:10,459 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-01-08 22:16:10,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:10,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:10,461 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:16:10,462 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-01-08 22:16:10,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 90 statements into 1 equivalence classes. [2025-01-08 22:16:10,582 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 90 of 90 statements. [2025-01-08 22:16:10,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:16:10,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:10,584 INFO L256 TraceCheckSpWp]: Trace formula consists of 541 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-08 22:16:10,586 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:10,622 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 452 proven. 105 refuted. 0 times theorem prover too weak. 662 trivial. 0 not checked. [2025-01-08 22:16:10,622 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:10,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1219 backedges. 0 proven. 559 refuted. 0 times theorem prover too weak. 660 trivial. 0 not checked. [2025-01-08 22:16:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [429713493] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:10,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 23 [2025-01-08 22:16:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127532025] [2025-01-08 22:16:10,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:10,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-08 22:16:10,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:10,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-08 22:16:10,804 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:16:10,804 INFO L87 Difference]: Start difference. First operand 55 states and 59 transitions. Second operand has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:16:10,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:10,827 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2025-01-08 22:16:10,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-08 22:16:10,827 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 90 [2025-01-08 22:16:10,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:10,828 INFO L225 Difference]: With dead ends: 92 [2025-01-08 22:16:10,828 INFO L226 Difference]: Without dead ends: 61 [2025-01-08 22:16:10,828 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 164 SyntacticMatches, 10 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=253, Invalid=253, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:16:10,828 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:10,829 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 56 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:10,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-01-08 22:16:10,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2025-01-08 22:16:10,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 56 states have (on average 1.0535714285714286) internal successors, (59), 56 states have internal predecessors, (59), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:10,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 65 transitions. [2025-01-08 22:16:10,835 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 65 transitions. Word has length 90 [2025-01-08 22:16:10,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:10,835 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 65 transitions. [2025-01-08 22:16:10,836 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.9130434782608696) internal successors, (44), 23 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:16:10,836 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 65 transitions. [2025-01-08 22:16:10,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-01-08 22:16:10,839 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:10,839 INFO L218 NwaCegarLoop]: trace histogram [60, 20, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:10,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-01-08 22:16:11,039 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:11,039 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:11,040 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:11,040 INFO L85 PathProgramCache]: Analyzing trace with hash -946314663, now seen corresponding path program 8 times [2025-01-08 22:16:11,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:11,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375825380] [2025-01-08 22:16:11,040 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:16:11,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:11,055 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-01-08 22:16:11,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 108 of 108 statements. [2025-01-08 22:16:11,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:16:11,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:11,218 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2172 trivial. 0 not checked. [2025-01-08 22:16:11,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375825380] [2025-01-08 22:16:11,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375825380] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:11,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90651700] [2025-01-08 22:16:11,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:16:11,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:11,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:11,221 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:16:11,222 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-01-08 22:16:11,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 108 statements into 2 equivalence classes. [2025-01-08 22:16:11,345 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 108 of 108 statements. [2025-01-08 22:16:11,346 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:16:11,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:11,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 631 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:16:11,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:11,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 888 proven. 10 refuted. 0 times theorem prover too weak. 1284 trivial. 0 not checked. [2025-01-08 22:16:11,362 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:11,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2182 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 2172 trivial. 0 not checked. [2025-01-08 22:16:11,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90651700] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:11,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:11,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2025-01-08 22:16:11,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2129389092] [2025-01-08 22:16:11,412 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:11,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-08 22:16:11,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:11,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-08 22:16:11,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:16:11,413 INFO L87 Difference]: Start difference. First operand 61 states and 65 transitions. Second operand has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:16:11,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:11,428 INFO L93 Difference]: Finished difference Result 96 states and 106 transitions. [2025-01-08 22:16:11,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-01-08 22:16:11,428 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 108 [2025-01-08 22:16:11,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:11,429 INFO L225 Difference]: With dead ends: 96 [2025-01-08 22:16:11,429 INFO L226 Difference]: Without dead ends: 67 [2025-01-08 22:16:11,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 221 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2025-01-08 22:16:11,430 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:11,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 71 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:11,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-01-08 22:16:11,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-01-08 22:16:11,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 62 states have internal predecessors, (65), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:11,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 71 transitions. [2025-01-08 22:16:11,436 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 71 transitions. Word has length 108 [2025-01-08 22:16:11,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:11,437 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 71 transitions. [2025-01-08 22:16:11,437 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3076923076923075) internal successors, (30), 13 states have internal predecessors, (30), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:16:11,437 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2025-01-08 22:16:11,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-08 22:16:11,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:11,439 INFO L218 NwaCegarLoop]: trace histogram [60, 20, 10, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:11,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-01-08 22:16:11,639 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:11,640 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:11,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:11,640 INFO L85 PathProgramCache]: Analyzing trace with hash -594679783, now seen corresponding path program 9 times [2025-01-08 22:16:11,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:11,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114613124] [2025-01-08 22:16:11,640 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:16:11,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:11,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 114 statements into 23 equivalence classes. [2025-01-08 22:16:11,718 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 62 of 114 statements. [2025-01-08 22:16:11,719 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-08 22:16:11,719 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:11,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2227 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2172 trivial. 0 not checked. [2025-01-08 22:16:11,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:11,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114613124] [2025-01-08 22:16:11,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114613124] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:11,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170064607] [2025-01-08 22:16:11,874 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:16:11,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:11,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:11,876 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:16:11,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-01-08 22:16:11,958 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 114 statements into 23 equivalence classes. [2025-01-08 22:16:12,067 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) and asserted 62 of 114 statements. [2025-01-08 22:16:12,067 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 7 check-sat command(s) [2025-01-08 22:16:12,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:12,069 INFO L256 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-08 22:16:12,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2227 backedges. 888 proven. 55 refuted. 0 times theorem prover too weak. 1284 trivial. 0 not checked. [2025-01-08 22:16:12,091 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:16:12,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2227 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 2172 trivial. 0 not checked. [2025-01-08 22:16:12,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170064607] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:16:12,221 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:16:12,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 22 [2025-01-08 22:16:12,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567290222] [2025-01-08 22:16:12,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:16:12,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-08 22:16:12,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:16:12,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-08 22:16:12,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-01-08 22:16:12,222 INFO L87 Difference]: Start difference. First operand 67 states and 71 transitions. Second operand has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:16:12,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:16:12,246 INFO L93 Difference]: Finished difference Result 105 states and 118 transitions. [2025-01-08 22:16:12,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-01-08 22:16:12,247 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 114 [2025-01-08 22:16:12,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:16:12,248 INFO L225 Difference]: With dead ends: 105 [2025-01-08 22:16:12,248 INFO L226 Difference]: Without dead ends: 76 [2025-01-08 22:16:12,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 216 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2025-01-08 22:16:12,249 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:16:12,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:16:12,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-08 22:16:12,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-08 22:16:12,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 71 states have (on average 1.0422535211267605) internal successors, (74), 71 states have internal predecessors, (74), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-01-08 22:16:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 80 transitions. [2025-01-08 22:16:12,255 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 80 transitions. Word has length 114 [2025-01-08 22:16:12,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:16:12,255 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 80 transitions. [2025-01-08 22:16:12,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 1.8181818181818181) internal successors, (40), 22 states have internal predecessors, (40), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2025-01-08 22:16:12,255 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 80 transitions. [2025-01-08 22:16:12,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-08 22:16:12,256 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:16:12,256 INFO L218 NwaCegarLoop]: trace histogram [60, 20, 19, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:16:12,263 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-01-08 22:16:12,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-08 22:16:12,457 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:16:12,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:16:12,457 INFO L85 PathProgramCache]: Analyzing trace with hash 781864147, now seen corresponding path program 10 times [2025-01-08 22:16:12,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:16:12,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549741802] [2025-01-08 22:16:12,457 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:16:12,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:16:12,478 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 123 statements into 2 equivalence classes. [2025-01-08 22:16:13,970 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-01-08 22:16:13,971 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:16:13,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 2362 backedges. 0 proven. 2294 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2025-01-08 22:16:57,319 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:16:57,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549741802] [2025-01-08 22:16:57,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549741802] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:16:57,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1114439046] [2025-01-08 22:16:57,319 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:16:57,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:16:57,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:16:57,321 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:16:57,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-01-08 22:16:57,407 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 123 statements into 2 equivalence classes. [2025-01-08 22:16:59,103 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 123 of 123 statements. [2025-01-08 22:16:59,103 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-01-08 22:16:59,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:16:59,116 WARN L254 TraceCheckSpWp]: Trace formula consists of 736 conjuncts, 451 conjuncts are in the unsatisfiable core [2025-01-08 22:16:59,126 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:16:59,173 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 15 treesize of output 1 [2025-01-08 22:16:59,179 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 15 treesize of output 1 [2025-01-08 22:16:59,188 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 15 treesize of output 1 [2025-01-08 22:16:59,192 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 15 treesize of output 1 [2025-01-08 22:16:59,198 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 15 treesize of output 1 [2025-01-08 22:16:59,206 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 15 treesize of output 1 [2025-01-08 22:16:59,211 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 15 treesize of output 1 [2025-01-08 22:16:59,219 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 15 treesize of output 1 [2025-01-08 22:16:59,227 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 15 treesize of output 1 [2025-01-08 22:16:59,235 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 15 treesize of output 1 [2025-01-08 22:16:59,241 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 15 treesize of output 1 [2025-01-08 22:16:59,246 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 15 treesize of output 1 [2025-01-08 22:16:59,253 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 15 treesize of output 1 [2025-01-08 22:17:01,731 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:01,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 449 treesize of output 247 [2025-01-08 22:17:02,407 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:02,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:02,556 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:02,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:02,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:02,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:02,851 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:02,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:03,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:03,016 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:03,167 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:03,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:03,315 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:03,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:03,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:03,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:03,628 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:03,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:03,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:03,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:03,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:03,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:04,097 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:04,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:04,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:04,264 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:04,430 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:04,430 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:04,595 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:04,595 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:04,754 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:04,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:04,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:04,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:05,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:05,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:05,291 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:05,291 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 131 treesize of output 172 [2025-01-08 22:17:05,449 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:05,449 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 135 treesize of output 169 [2025-01-08 22:17:05,670 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:17:05,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 20 select indices, 20 select index equivalence classes, 190 disjoint index pairs (out of 190 index pairs), introduced 20 new quantified variables, introduced 190 case distinctions, treesize of input 534 treesize of output 134