./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/reducercommutativity/max.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/max.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 97795e7b99ddd869ecccb7f865206a167342b52333873684a94abd35acf6650e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:13:49,000 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:13:49,052 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:13:49,057 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:13:49,060 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:13:49,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:13:49,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:13:49,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:13:49,082 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:13:49,082 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:13:49,082 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:13:49,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:13:49,083 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:13:49,084 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:13:49,084 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:13:49,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:13:49,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:13:49,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:13:49,085 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:13:49,085 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:13:49,085 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:13:49,085 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:13:49,085 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:13:49,085 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:13:49,086 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:13:49,086 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:13:49,086 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:13:49,086 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:13:49,086 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:13:49,086 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:13:49,086 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:13:49,086 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:13:49,086 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:13:49,086 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 -> 97795e7b99ddd869ecccb7f865206a167342b52333873684a94abd35acf6650e [2025-01-08 22:13:49,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:13:49,301 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:13:49,303 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:13:49,304 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:13:49,304 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:13:49,305 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/reducercommutativity/max.i [2025-01-08 22:13:50,397 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49ad04483/5dc56644da0d4274a1359bc9a461818c/FLAG44bc55129 [2025-01-08 22:13:50,618 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:13:50,619 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/reducercommutativity/max.i [2025-01-08 22:13:50,625 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49ad04483/5dc56644da0d4274a1359bc9a461818c/FLAG44bc55129 [2025-01-08 22:13:50,977 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/49ad04483/5dc56644da0d4274a1359bc9a461818c [2025-01-08 22:13:50,978 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:13:50,979 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:13:50,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:13:50,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:13:50,983 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:13:50,983 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:13:50" (1/1) ... [2025-01-08 22:13:50,984 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5e464de0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:50, skipping insertion in model container [2025-01-08 22:13:50,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:13:50" (1/1) ... [2025-01-08 22:13:50,992 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:13:51,094 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/max.i[1295,1308] [2025-01-08 22:13:51,100 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:13:51,106 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:13:51,122 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/max.i[1295,1308] [2025-01-08 22:13:51,123 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:13:51,132 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:13:51,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51 WrapperNode [2025-01-08 22:13:51,133 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:13:51,134 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:13:51,134 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:13:51,134 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:13:51,141 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:13:51" (1/1) ... [2025-01-08 22:13:51,146 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:13:51" (1/1) ... [2025-01-08 22:13:51,158 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 64 [2025-01-08 22:13:51,158 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:13:51,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:13:51,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:13:51,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:13:51,164 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51" (1/1) ... [2025-01-08 22:13:51,164 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51" (1/1) ... [2025-01-08 22:13:51,166 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51" (1/1) ... [2025-01-08 22:13:51,182 INFO L175 MemorySlicer]: Split 18 memory accesses to 3 slices as follows [2, 6, 10]. 56 percent of accesses are in the largest equivalence class. The 8 initializations are split as follows [2, 6, 0]. The 4 writes are split as follows [0, 0, 4]. [2025-01-08 22:13:51,182 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51" (1/1) ... [2025-01-08 22:13:51,183 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51" (1/1) ... [2025-01-08 22:13:51,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51" (1/1) ... [2025-01-08 22:13:51,189 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51" (1/1) ... [2025-01-08 22:13:51,194 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51" (1/1) ... [2025-01-08 22:13:51,194 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51" (1/1) ... [2025-01-08 22:13:51,195 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51" (1/1) ... [2025-01-08 22:13:51,200 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:13:51,200 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:13:51,200 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:13:51,200 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:13:51,201 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51" (1/1) ... [2025-01-08 22:13:51,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:13:51,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:13:51,224 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:13:51,231 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:13:51,244 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:13:51,244 INFO L130 BoogieDeclarations]: Found specification of procedure max [2025-01-08 22:13:51,244 INFO L138 BoogieDeclarations]: Found implementation of procedure max [2025-01-08 22:13:51,244 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-01-08 22:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-01-08 22:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:13:51,245 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:13:51,245 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:13:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:13:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-01-08 22:13:51,246 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:13:51,308 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:13:51,309 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:13:51,414 INFO L? ?]: Removed 17 outVars from TransFormulas that were not future-live. [2025-01-08 22:13:51,414 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:13:51,420 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:13:51,420 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-01-08 22:13:51,420 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:13:51 BoogieIcfgContainer [2025-01-08 22:13:51,420 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:13:51,422 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:13:51,422 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:13:51,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:13:51,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:13:50" (1/3) ... [2025-01-08 22:13:51,425 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53175d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:13:51, skipping insertion in model container [2025-01-08 22:13:51,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:13:51" (2/3) ... [2025-01-08 22:13:51,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53175d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:13:51, skipping insertion in model container [2025-01-08 22:13:51,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:13:51" (3/3) ... [2025-01-08 22:13:51,426 INFO L128 eAbstractionObserver]: Analyzing ICFG max.i [2025-01-08 22:13:51,435 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:13:51,436 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG max.i that has 2 procedures, 24 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-08 22:13:51,475 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:13:51,484 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;@2265da14, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:13:51,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:13:51,488 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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:13:51,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-08 22:13:51,494 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:51,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:13:51,495 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:51,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash 62930974, now seen corresponding path program 1 times [2025-01-08 22:13:51,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:51,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [428386090] [2025-01-08 22:13:51,506 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:51,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:51,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:13:51,598 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:13:51,598 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:51,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:51,792 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:13:51,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:51,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [428386090] [2025-01-08 22:13:51,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [428386090] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:13:51,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [965245571] [2025-01-08 22:13:51,793 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:51,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:51,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:13:51,796 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:13:51,800 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:13:51,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-08 22:13:51,893 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-08 22:13:51,893 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:51,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:51,895 INFO L256 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:13:51,901 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:13:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:13:51,960 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:13:51,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [965245571] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:13:51,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:13:51,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2025-01-08 22:13:51,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1948759] [2025-01-08 22:13:51,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:13:51,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:13:51,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:51,979 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:13:51,980 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:13:51,981 INFO L87 Difference]: Start difference. First operand has 24 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 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 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:13:52,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:52,023 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2025-01-08 22:13:52,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:13:52,024 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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 24 [2025-01-08 22:13:52,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:52,028 INFO L225 Difference]: With dead ends: 51 [2025-01-08 22:13:52,028 INFO L226 Difference]: Without dead ends: 22 [2025-01-08 22:13:52,030 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:13:52,031 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 27 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:52,032 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 44 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:13:52,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-08 22:13:52,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 20. [2025-01-08 22:13:52,054 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:13:52,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-01-08 22:13:52,057 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 24 [2025-01-08 22:13:52,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:52,059 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-01-08 22:13:52,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 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:13:52,060 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-01-08 22:13:52,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-01-08 22:13:52,061 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:52,061 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:52,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:13:52,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-08 22:13:52,265 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:52,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:52,266 INFO L85 PathProgramCache]: Analyzing trace with hash -885104962, now seen corresponding path program 1 times [2025-01-08 22:13:52,266 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:52,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264741183] [2025-01-08 22:13:52,266 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:52,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:52,282 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-01-08 22:13:52,311 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-01-08 22:13:52,314 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:52,314 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:52,418 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-01-08 22:13:52,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:52,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1264741183] [2025-01-08 22:13:52,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1264741183] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:13:52,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:13:52,419 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:13:52,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958047823] [2025-01-08 22:13:52,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:13:52,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:13:52,420 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:52,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:13:52,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:13:52,420 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:13:52,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:52,450 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2025-01-08 22:13:52,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:13:52,451 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 33 [2025-01-08 22:13:52,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:52,452 INFO L225 Difference]: With dead ends: 33 [2025-01-08 22:13:52,452 INFO L226 Difference]: Without dead ends: 21 [2025-01-08 22:13:52,453 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:13:52,453 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 17 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:52,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 28 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:13:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-01-08 22:13:52,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-01-08 22:13:52,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 16 states have (on average 1.1875) internal successors, (19), 16 states have internal predecessors, (19), 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:13:52,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-01-08 22:13:52,460 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 33 [2025-01-08 22:13:52,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:52,462 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-01-08 22:13:52,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:13:52,462 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-01-08 22:13:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-08 22:13:52,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:52,463 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:52,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:13:52,465 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:52,466 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:52,466 INFO L85 PathProgramCache]: Analyzing trace with hash 1187497748, now seen corresponding path program 1 times [2025-01-08 22:13:52,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:52,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923384075] [2025-01-08 22:13:52,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:52,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:52,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-08 22:13:52,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-08 22:13:52,511 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:52,511 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:52,601 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:13:52,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:52,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923384075] [2025-01-08 22:13:52,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1923384075] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:13:52,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1312861361] [2025-01-08 22:13:52,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:13:52,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:52,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:13:52,606 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:13:52,607 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:13:52,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-08 22:13:52,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-08 22:13:52,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:13:52,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:52,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-01-08 22:13:52,676 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:13:52,721 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 14 proven. 1 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 22:13:52,721 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:13:52,815 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:13:52,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1312861361] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:13:52,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:13:52,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 10 [2025-01-08 22:13:52,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664309313] [2025-01-08 22:13:52,815 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:13:52,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:13:52,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:13:52,816 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:13:52,816 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:13:52,817 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-08 22:13:52,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:13:52,872 INFO L93 Difference]: Finished difference Result 43 states and 56 transitions. [2025-01-08 22:13:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-08 22:13:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) Word has length 34 [2025-01-08 22:13:52,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:13:52,873 INFO L225 Difference]: With dead ends: 43 [2025-01-08 22:13:52,874 INFO L226 Difference]: Without dead ends: 26 [2025-01-08 22:13:52,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 63 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:13:52,875 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:13:52,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 45 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:13:52,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-08 22:13:52,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2025-01-08 22:13:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 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:13:52,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2025-01-08 22:13:52,878 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 34 [2025-01-08 22:13:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:13:52,878 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2025-01-08 22:13:52,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) internal successors, (38), 10 states have internal predecessors, (38), 2 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 1 states have call predecessors, (6), 2 states have call successors, (6) [2025-01-08 22:13:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2025-01-08 22:13:52,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:13:52,879 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:13:52,879 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:13:52,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:13:53,079 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:13:53,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:13:53,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:13:53,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1393818832, now seen corresponding path program 2 times [2025-01-08 22:13:53,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:13:53,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559278396] [2025-01-08 22:13:53,081 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:13:53,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:13:53,094 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-08 22:13:53,130 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:13:53,131 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:13:53,131 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:54,063 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:13:54,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:13:54,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559278396] [2025-01-08 22:13:54,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559278396] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:13:54,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210551944] [2025-01-08 22:13:54,063 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:13:54,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:13:54,063 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:13:54,068 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:13:54,073 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:13:54,112 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-08 22:13:54,137 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:13:54,137 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:13:54,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:13:54,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-01-08 22:13:54,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:13:54,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 7 [2025-01-08 22:13:54,540 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:13:54,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2025-01-08 22:13:54,587 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:13:54,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2025-01-08 22:13:54,846 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 12 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:13:54,847 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:14:03,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210551944] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:14:03,478 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:14:03,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 24] total 32 [2025-01-08 22:14:03,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184580369] [2025-01-08 22:14:03,478 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:14:03,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-01-08 22:14:03,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:03,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-01-08 22:14:03,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=205, Invalid=1515, Unknown=2, NotChecked=0, Total=1722 [2025-01-08 22:14:03,480 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 32 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-08 22:14:05,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:05,337 INFO L93 Difference]: Finished difference Result 176 states and 239 transitions. [2025-01-08 22:14:05,337 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 72 states. [2025-01-08 22:14:05,337 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 43 [2025-01-08 22:14:05,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:05,340 INFO L225 Difference]: With dead ends: 176 [2025-01-08 22:14:05,340 INFO L226 Difference]: Without dead ends: 130 [2025-01-08 22:14:05,343 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3181 ImplicationChecksByTransitivity, 10.2s TimeCoverageRelationStatistics Valid=1141, Invalid=8559, Unknown=2, NotChecked=0, Total=9702 [2025-01-08 22:14:05,344 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 210 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 694 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 694 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:14:05,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 230 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 694 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:14:05,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2025-01-08 22:14:05,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 96. [2025-01-08 22:14:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.3375) internal successors, (107), 83 states have internal predecessors, (107), 8 states have call successors, (8), 4 states have call predecessors, (8), 7 states have return successors, (22), 8 states have call predecessors, (22), 8 states have call successors, (22) [2025-01-08 22:14:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 137 transitions. [2025-01-08 22:14:05,369 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 137 transitions. Word has length 43 [2025-01-08 22:14:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:05,369 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 137 transitions. [2025-01-08 22:14:05,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 29 states have (on average 1.9655172413793103) internal successors, (57), 28 states have internal predecessors, (57), 5 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-08 22:14:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 137 transitions. [2025-01-08 22:14:05,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:14:05,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:05,370 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:05,380 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:14:05,571 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:14:05,571 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:05,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:05,572 INFO L85 PathProgramCache]: Analyzing trace with hash 1612673550, now seen corresponding path program 1 times [2025-01-08 22:14:05,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:05,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066873648] [2025-01-08 22:14:05,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:05,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:05,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-08 22:14:05,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:14:05,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:05,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:11,627 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 1 proven. 68 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-01-08 22:14:11,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:14:11,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066873648] [2025-01-08 22:14:11,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2066873648] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:14:11,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80904900] [2025-01-08 22:14:11,628 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:14:11,628 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:11,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:14:11,630 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:14:11,632 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:14:11,672 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-01-08 22:14:11,794 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:14:11,794 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:14:11,794 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:11,796 INFO L256 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-01-08 22:14:11,800 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:14:12,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 17 [2025-01-08 22:14:12,340 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2025-01-08 22:14:12,397 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:14:12,761 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 91 treesize of output 59 [2025-01-08 22:14:12,949 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 3 proven. 70 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:14:12,949 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:14:13,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2025-01-08 22:14:13,457 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 44 [2025-01-08 22:14:13,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 41 [2025-01-08 22:14:13,485 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 48 [2025-01-08 22:14:14,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 61 [2025-01-08 22:14:14,467 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2025-01-08 22:14:14,467 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 21 [2025-01-08 22:14:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:14:14,612 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80904900] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:14:14,612 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:14:14,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 24] total 65 [2025-01-08 22:14:14,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1701779680] [2025-01-08 22:14:14,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:14:14,613 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 65 states [2025-01-08 22:14:14,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:14,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 65 interpolants. [2025-01-08 22:14:14,615 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=260, Invalid=3899, Unknown=1, NotChecked=0, Total=4160 [2025-01-08 22:14:14,615 INFO L87 Difference]: Start difference. First operand 96 states and 137 transitions. Second operand has 65 states, 59 states have (on average 1.576271186440678) internal successors, (93), 58 states have internal predecessors, (93), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-08 22:14:17,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:17,303 INFO L93 Difference]: Finished difference Result 253 states and 371 transitions. [2025-01-08 22:14:17,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2025-01-08 22:14:17,303 INFO L78 Accepts]: Start accepts. Automaton has has 65 states, 59 states have (on average 1.576271186440678) internal successors, (93), 58 states have internal predecessors, (93), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) Word has length 43 [2025-01-08 22:14:17,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:17,305 INFO L225 Difference]: With dead ends: 253 [2025-01-08 22:14:17,305 INFO L226 Difference]: Without dead ends: 249 [2025-01-08 22:14:17,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 152 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3298 ImplicationChecksByTransitivity, 7.6s TimeCoverageRelationStatistics Valid=768, Invalid=9737, Unknown=1, NotChecked=0, Total=10506 [2025-01-08 22:14:17,309 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 92 mSDsluCounter, 345 mSDsCounter, 0 mSdLazyCounter, 1836 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 360 SdHoareTripleChecker+Invalid, 1873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 1836 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:14:17,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 360 Invalid, 1873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 1836 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-08 22:14:17,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 249 states. [2025-01-08 22:14:17,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 249 to 150. [2025-01-08 22:14:17,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 127 states have (on average 1.3464566929133859) internal successors, (171), 132 states have internal predecessors, (171), 11 states have call successors, (11), 6 states have call predecessors, (11), 11 states have return successors, (31), 11 states have call predecessors, (31), 11 states have call successors, (31) [2025-01-08 22:14:17,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 213 transitions. [2025-01-08 22:14:17,332 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 213 transitions. Word has length 43 [2025-01-08 22:14:17,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:17,334 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 213 transitions. [2025-01-08 22:14:17,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 65 states, 59 states have (on average 1.576271186440678) internal successors, (93), 58 states have internal predecessors, (93), 7 states have call successors, (9), 3 states have call predecessors, (9), 8 states have return successors, (9), 6 states have call predecessors, (9), 7 states have call successors, (9) [2025-01-08 22:14:17,334 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 213 transitions. [2025-01-08 22:14:17,336 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:14:17,336 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:17,336 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:17,344 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 22:14:17,536 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:14:17,537 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:17,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:17,538 INFO L85 PathProgramCache]: Analyzing trace with hash 803326924, now seen corresponding path program 2 times [2025-01-08 22:14:17,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:17,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957527647] [2025-01-08 22:14:17,538 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:14:17,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:17,545 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-08 22:14:17,561 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:14:17,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:14:17,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 9 proven. 63 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-01-08 22:14:18,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:14:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957527647] [2025-01-08 22:14:18,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957527647] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:14:18,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [341398325] [2025-01-08 22:14:18,561 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:14:18,561 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:18,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:14:18,563 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:14:18,565 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:14:18,603 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-01-08 22:14:18,627 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:14:18,627 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:14:18,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:18,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-01-08 22:14:18,634 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:14:19,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:14:19,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 20 [2025-01-08 22:14:19,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:14:19,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 23 [2025-01-08 22:14:19,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:14:19,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 40 treesize of output 20 [2025-01-08 22:14:19,789 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 1 proven. 70 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:14:19,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:14:20,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [341398325] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:14:20,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:14:20,310 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 41 [2025-01-08 22:14:20,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479644116] [2025-01-08 22:14:20,310 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:14:20,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-01-08 22:14:20,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:20,311 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-01-08 22:14:20,311 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=2255, Unknown=0, NotChecked=0, Total=2450 [2025-01-08 22:14:20,311 INFO L87 Difference]: Start difference. First operand 150 states and 213 transitions. Second operand has 41 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-08 22:14:22,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:14:22,104 INFO L93 Difference]: Finished difference Result 250 states and 345 transitions. [2025-01-08 22:14:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2025-01-08 22:14:22,104 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) Word has length 43 [2025-01-08 22:14:22,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:14:22,106 INFO L225 Difference]: With dead ends: 250 [2025-01-08 22:14:22,106 INFO L226 Difference]: Without dead ends: 241 [2025-01-08 22:14:22,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2274 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=733, Invalid=6749, Unknown=0, NotChecked=0, Total=7482 [2025-01-08 22:14:22,108 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 119 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 1124 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 1153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:14:22,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 242 Invalid, 1153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1124 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:14:22,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2025-01-08 22:14:22,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 167. [2025-01-08 22:14:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 141 states have (on average 1.326241134751773) internal successors, (187), 148 states have internal predecessors, (187), 11 states have call successors, (11), 7 states have call predecessors, (11), 14 states have return successors, (32), 11 states have call predecessors, (32), 11 states have call successors, (32) [2025-01-08 22:14:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 230 transitions. [2025-01-08 22:14:22,130 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 230 transitions. Word has length 43 [2025-01-08 22:14:22,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:14:22,131 INFO L471 AbstractCegarLoop]: Abstraction has 167 states and 230 transitions. [2025-01-08 22:14:22,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 39 states have (on average 1.641025641025641) internal successors, (64), 39 states have internal predecessors, (64), 4 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 3 states have call predecessors, (6), 4 states have call successors, (6) [2025-01-08 22:14:22,131 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 230 transitions. [2025-01-08 22:14:22,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:14:22,132 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:14:22,132 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:14:22,139 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:14:22,336 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:14:22,336 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:14:22,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:14:22,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1504391502, now seen corresponding path program 3 times [2025-01-08 22:14:22,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:14:22,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726903028] [2025-01-08 22:14:22,338 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:14:22,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:14:22,345 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 6 equivalence classes. [2025-01-08 22:14:22,365 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:14:22,367 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-08 22:14:22,367 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:23,005 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 19 proven. 47 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:14:23,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:14:23,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726903028] [2025-01-08 22:14:23,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726903028] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:14:23,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [254339766] [2025-01-08 22:14:23,006 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:14:23,006 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:14:23,006 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:14:23,011 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:14:23,017 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:14:23,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 43 statements into 6 equivalence classes. [2025-01-08 22:14:23,085 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 43 statements. [2025-01-08 22:14:23,085 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-01-08 22:14:23,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:14:23,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-08 22:14:23,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:14:23,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-01-08 22:14:23,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 25 treesize of output 1 [2025-01-08 22:14:31,623 INFO L134 CoverageAnalysis]: Checked inductivity of 76 backedges. 40 proven. 27 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-01-08 22:14:31,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:14:31,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [254339766] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:14:31,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-08 22:14:31,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17] total 30 [2025-01-08 22:14:31,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803571855] [2025-01-08 22:14:31,744 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-08 22:14:31,744 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-01-08 22:14:31,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:14:31,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-01-08 22:14:31,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=832, Unknown=2, NotChecked=0, Total=930 [2025-01-08 22:14:31,745 INFO L87 Difference]: Start difference. First operand 167 states and 230 transitions. Second operand has 30 states, 27 states have (on average 2.259259259259259) internal successors, (61), 28 states have internal predecessors, (61), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-01-08 22:14:35,774 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:14:39,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:14:47,901 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:14:56,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:04,638 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:08,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:13,232 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:17,254 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:22,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:26,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-01-08 22:15:31,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]