./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array19_pattern.c --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/array-patterns/array19_pattern.c -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 21ab39d122ec2c6e96fa6b8c9d53d6f966068253a8a3d3ba32389613dd7dc54a --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:31:24,174 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:31:24,235 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:31:24,242 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:31:24,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:31:24,272 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:31:24,273 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:31:24,273 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:31:24,274 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:31:24,274 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:31:24,274 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:31:24,274 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:31:24,274 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:31:24,274 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:31:24,274 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:31:24,275 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:31:24,275 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:31:24,275 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:31:24,275 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:31:24,275 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:31:24,275 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:31:24,275 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:31:24,275 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:31:24,275 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:31:24,276 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:31:24,276 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:31:24,276 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:31:24,276 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:31:24,276 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:31:24,276 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:31:24,276 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:31:24,276 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:31:24,276 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:31:24,276 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:31:24,277 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:31:24,277 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:31:24,277 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:31:24,277 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:31:24,277 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:31:24,277 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:31:24,277 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:31:24,277 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:31:24,277 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:31:24,278 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:31:24,278 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:31:24,278 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:31:24,278 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:31:24,278 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:31:24,278 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 -> 21ab39d122ec2c6e96fa6b8c9d53d6f966068253a8a3d3ba32389613dd7dc54a [2025-01-08 22:31:24,498 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:31:24,505 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:31:24,507 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:31:24,508 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:31:24,508 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:31:24,511 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array19_pattern.c [2025-01-08 22:31:25,648 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ffc467aa/c6f68cd199aa4f4f9b43eac8cc04dc54/FLAG78c8181ca [2025-01-08 22:31:25,866 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:31:25,870 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-patterns/array19_pattern.c [2025-01-08 22:31:25,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ffc467aa/c6f68cd199aa4f4f9b43eac8cc04dc54/FLAG78c8181ca [2025-01-08 22:31:25,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ffc467aa/c6f68cd199aa4f4f9b43eac8cc04dc54 [2025-01-08 22:31:25,899 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:31:25,900 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:31:25,902 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:31:25,902 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:31:25,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:31:25,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:31:25" (1/1) ... [2025-01-08 22:31:25,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65d090e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:25, skipping insertion in model container [2025-01-08 22:31:25,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:31:25" (1/1) ... [2025-01-08 22:31:25,917 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:31:26,023 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/array-patterns/array19_pattern.c[1442,1455] [2025-01-08 22:31:26,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:31:26,048 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:31:26,054 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/array-patterns/array19_pattern.c[1442,1455] [2025-01-08 22:31:26,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:31:26,070 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:31:26,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26 WrapperNode [2025-01-08 22:31:26,071 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:31:26,072 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:31:26,072 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:31:26,072 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:31:26,076 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:31:26" (1/1) ... [2025-01-08 22:31:26,085 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:31:26" (1/1) ... [2025-01-08 22:31:26,098 INFO L138 Inliner]: procedures = 16, calls = 20, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 89 [2025-01-08 22:31:26,100 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:31:26,101 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:31:26,102 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:31:26,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:31:26,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26" (1/1) ... [2025-01-08 22:31:26,108 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26" (1/1) ... [2025-01-08 22:31:26,109 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26" (1/1) ... [2025-01-08 22:31:26,119 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-01-08 22:31:26,120 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26" (1/1) ... [2025-01-08 22:31:26,120 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26" (1/1) ... [2025-01-08 22:31:26,123 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26" (1/1) ... [2025-01-08 22:31:26,123 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26" (1/1) ... [2025-01-08 22:31:26,125 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26" (1/1) ... [2025-01-08 22:31:26,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26" (1/1) ... [2025-01-08 22:31:26,126 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26" (1/1) ... [2025-01-08 22:31:26,127 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:31:26,128 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:31:26,128 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:31:26,128 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:31:26,128 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26" (1/1) ... [2025-01-08 22:31:26,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:31:26,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:31:26,150 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:31:26,151 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:31:26,165 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:31:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-08 22:31:26,166 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-08 22:31:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:31:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-01-08 22:31:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-01-08 22:31:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-01-08 22:31:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-01-08 22:31:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:31:26,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:31:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-01-08 22:31:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-01-08 22:31:26,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-01-08 22:31:26,215 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:31:26,216 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:31:26,357 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2025-01-08 22:31:26,357 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:31:26,367 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:31:26,367 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:31:26,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:31:26 BoogieIcfgContainer [2025-01-08 22:31:26,368 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:31:26,369 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:31:26,369 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:31:26,373 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:31:26,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:31:25" (1/3) ... [2025-01-08 22:31:26,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3863ef4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:31:26, skipping insertion in model container [2025-01-08 22:31:26,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:31:26" (2/3) ... [2025-01-08 22:31:26,375 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3863ef4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:31:26, skipping insertion in model container [2025-01-08 22:31:26,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:31:26" (3/3) ... [2025-01-08 22:31:26,376 INFO L128 eAbstractionObserver]: Analyzing ICFG array19_pattern.c [2025-01-08 22:31:26,387 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:31:26,390 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array19_pattern.c that has 2 procedures, 28 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-01-08 22:31:26,439 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:31:26,447 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;@59500978, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:31:26,447 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:31:26,449 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 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:31:26,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-01-08 22:31:26,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:31:26,454 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:31:26,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:31:26,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:31:26,457 INFO L85 PathProgramCache]: Analyzing trace with hash 334322140, now seen corresponding path program 1 times [2025-01-08 22:31:26,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:31:26,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138967599] [2025-01-08 22:31:26,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:31:26,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:31:26,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-01-08 22:31:26,520 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-01-08 22:31:26,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:31:26,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:26,565 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:31:26,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:31:26,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138967599] [2025-01-08 22:31:26,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138967599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:31:26,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:31:26,567 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:31:26,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312136899] [2025-01-08 22:31:26,568 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:31:26,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-08 22:31:26,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:31:26,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-08 22:31:26,594 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:31:26,595 INFO L87 Difference]: Start difference. First operand has 28 states, 22 states have (on average 1.5) internal successors, (33), 23 states have internal predecessors, (33), 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 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:31:26,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:31:26,609 INFO L93 Difference]: Finished difference Result 53 states and 77 transitions. [2025-01-08 22:31:26,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-08 22:31:26,611 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-01-08 22:31:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:31:26,615 INFO L225 Difference]: With dead ends: 53 [2025-01-08 22:31:26,615 INFO L226 Difference]: Without dead ends: 24 [2025-01-08 22:31:26,618 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-08 22:31:26,620 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:31:26,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:31:26,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2025-01-08 22:31:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2025-01-08 22:31:26,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 19 states have (on average 1.368421052631579) internal successors, (26), 19 states have internal predecessors, (26), 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:31:26,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 32 transitions. [2025-01-08 22:31:26,649 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 32 transitions. Word has length 14 [2025-01-08 22:31:26,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:31:26,650 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 32 transitions. [2025-01-08 22:31:26,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-08 22:31:26,650 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 32 transitions. [2025-01-08 22:31:26,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-01-08 22:31:26,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:31:26,651 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:31:26,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:31:26,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:31:26,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:31:26,652 INFO L85 PathProgramCache]: Analyzing trace with hash -1608517388, now seen corresponding path program 1 times [2025-01-08 22:31:26,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:31:26,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796158932] [2025-01-08 22:31:26,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:31:26,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:31:26,671 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-01-08 22:31:26,697 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-01-08 22:31:26,698 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:31:26,698 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:26,958 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-01-08 22:31:26,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:31:26,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796158932] [2025-01-08 22:31:26,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796158932] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:31:26,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:31:26,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:31:26,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541540360] [2025-01-08 22:31:26,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:31:26,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:31:26,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:31:26,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:31:26,961 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:31:26,961 INFO L87 Difference]: Start difference. First operand 24 states and 32 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:31:26,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:31:26,975 INFO L93 Difference]: Finished difference Result 29 states and 38 transitions. [2025-01-08 22:31:26,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:31:26,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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 29 [2025-01-08 22:31:26,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:31:26,976 INFO L225 Difference]: With dead ends: 29 [2025-01-08 22:31:26,976 INFO L226 Difference]: Without dead ends: 26 [2025-01-08 22:31:26,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:31:26,977 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:31:26,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:31:26,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-01-08 22:31:26,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-01-08 22:31:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.380952380952381) internal successors, (29), 21 states have internal predecessors, (29), 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:31:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 35 transitions. [2025-01-08 22:31:26,986 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 35 transitions. Word has length 29 [2025-01-08 22:31:26,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:31:26,987 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 35 transitions. [2025-01-08 22:31:26,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 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:31:26,987 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 35 transitions. [2025-01-08 22:31:26,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-01-08 22:31:26,987 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:31:26,987 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:31:26,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:31:26,987 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:31:26,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:31:26,988 INFO L85 PathProgramCache]: Analyzing trace with hash -627034129, now seen corresponding path program 1 times [2025-01-08 22:31:26,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:31:26,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1410023822] [2025-01-08 22:31:26,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:31:26,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:31:27,020 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-01-08 22:31:27,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-01-08 22:31:27,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:31:27,037 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:27,135 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:31:27,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:31:27,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1410023822] [2025-01-08 22:31:27,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1410023822] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:31:27,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:31:27,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-08 22:31:27,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728876556] [2025-01-08 22:31:27,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:31:27,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:31:27,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:31:27,136 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:31:27,136 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:31:27,136 INFO L87 Difference]: Start difference. First operand 26 states and 35 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:31:27,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:31:27,215 INFO L93 Difference]: Finished difference Result 52 states and 71 transitions. [2025-01-08 22:31:27,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:31:27,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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 32 [2025-01-08 22:31:27,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:31:27,216 INFO L225 Difference]: With dead ends: 52 [2025-01-08 22:31:27,216 INFO L226 Difference]: Without dead ends: 31 [2025-01-08 22:31:27,217 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:31:27,217 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:31:27,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 46 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:31:27,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-01-08 22:31:27,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-01-08 22:31:27,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.3636363636363635) internal successors, (30), 22 states have internal predecessors, (30), 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:31:27,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 36 transitions. [2025-01-08 22:31:27,224 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 36 transitions. Word has length 32 [2025-01-08 22:31:27,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:31:27,224 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 36 transitions. [2025-01-08 22:31:27,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 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:31:27,225 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 36 transitions. [2025-01-08 22:31:27,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-01-08 22:31:27,226 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:31:27,226 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:31:27,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:31:27,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:31:27,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:31:27,228 INFO L85 PathProgramCache]: Analyzing trace with hash 1588889269, now seen corresponding path program 1 times [2025-01-08 22:31:27,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:31:27,228 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525630019] [2025-01-08 22:31:27,228 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:31:27,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:31:27,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-01-08 22:31:27,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-01-08 22:31:27,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:31:27,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:27,326 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:31:27,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:31:27,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525630019] [2025-01-08 22:31:27,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525630019] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:31:27,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:31:27,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:31:27,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1028026895] [2025-01-08 22:31:27,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:31:27,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:31:27,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:31:27,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:31:27,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:31:27,331 INFO L87 Difference]: Start difference. First operand 27 states and 36 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:31:27,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:31:27,358 INFO L93 Difference]: Finished difference Result 52 states and 72 transitions. [2025-01-08 22:31:27,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:31:27,359 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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 34 [2025-01-08 22:31:27,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:31:27,359 INFO L225 Difference]: With dead ends: 52 [2025-01-08 22:31:27,359 INFO L226 Difference]: Without dead ends: 30 [2025-01-08 22:31:27,359 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:31:27,360 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 5 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:31:27,360 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 47 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:31:27,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-01-08 22:31:27,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2025-01-08 22:31:27,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 23 states have internal predecessors, (30), 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:31:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2025-01-08 22:31:27,368 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 34 [2025-01-08 22:31:27,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:31:27,368 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2025-01-08 22:31:27,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 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:31:27,368 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2025-01-08 22:31:27,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-08 22:31:27,369 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:31:27,369 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:31:27,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:31:27,369 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:31:27,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:31:27,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1445167689, now seen corresponding path program 1 times [2025-01-08 22:31:27,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:31:27,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804337976] [2025-01-08 22:31:27,371 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:31:27,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:31:27,381 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-08 22:31:27,407 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:31:27,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:31:27,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-08 22:31:27,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [32460919] [2025-01-08 22:31:27,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:31:27,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:31:27,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:31:27,411 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:31:27,412 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:31:27,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-08 22:31:27,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:31:27,470 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:31:27,470 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:27,472 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 50 conjuncts are in the unsatisfiable core [2025-01-08 22:31:27,479 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:31:27,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:31:28,002 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2025-01-08 22:31:28,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 18 [2025-01-08 22:31:28,092 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:31:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-01-08 22:31:28,214 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:31:48,657 WARN L286 SmtUtils]: Spent 9.11s on a formula simplification that was a NOOP. DAG size: 137 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-08 22:31:54,051 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:31:54,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804337976] [2025-01-08 22:31:54,052 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-08 22:31:54,052 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [32460919] [2025-01-08 22:31:54,052 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [32460919] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:31:54,052 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:31:54,052 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22] total 22 [2025-01-08 22:31:54,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571164431] [2025-01-08 22:31:54,052 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-08 22:31:54,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-08 22:31:54,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:31:54,053 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-08 22:31:54,055 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=851, Unknown=1, NotChecked=0, Total=992 [2025-01-08 22:31:54,055 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:31:54,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:31:54,718 INFO L93 Difference]: Finished difference Result 80 states and 105 transitions. [2025-01-08 22:31:54,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-08 22:31:54,718 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 35 [2025-01-08 22:31:54,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:31:54,720 INFO L225 Difference]: With dead ends: 80 [2025-01-08 22:31:54,720 INFO L226 Difference]: Without dead ends: 59 [2025-01-08 22:31:54,720 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 15 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 21.6s TimeCoverageRelationStatistics Valid=191, Invalid=1290, Unknown=1, NotChecked=0, Total=1482 [2025-01-08 22:31:54,721 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 44 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:31:54,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 158 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:31:54,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-01-08 22:31:54,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2025-01-08 22:31:54,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 43 states have (on average 1.302325581395349) internal successors, (56), 43 states have internal predecessors, (56), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-08 22:31:54,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2025-01-08 22:31:54,727 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 35 [2025-01-08 22:31:54,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:31:54,728 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2025-01-08 22:31:54,728 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.380952380952381) internal successors, (29), 20 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-01-08 22:31:54,728 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2025-01-08 22:31:54,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-08 22:31:54,728 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:31:54,729 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:31:54,734 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:31:54,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:31:54,929 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:31:54,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:31:54,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1187002251, now seen corresponding path program 1 times [2025-01-08 22:31:54,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:31:54,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184786231] [2025-01-08 22:31:54,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:31:54,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:31:54,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-08 22:31:54,945 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:31:54,946 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:31:54,946 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:54,976 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-01-08 22:31:54,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:31:54,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184786231] [2025-01-08 22:31:54,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184786231] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:31:54,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:31:54,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:31:54,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975755604] [2025-01-08 22:31:54,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:31:54,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:31:54,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:31:54,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:31:54,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:31:54,978 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:31:55,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:31:55,016 INFO L93 Difference]: Finished difference Result 75 states and 95 transitions. [2025-01-08 22:31:55,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:31:55,016 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2025-01-08 22:31:55,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:31:55,019 INFO L225 Difference]: With dead ends: 75 [2025-01-08 22:31:55,019 INFO L226 Difference]: Without dead ends: 55 [2025-01-08 22:31:55,019 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:31:55,019 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 1 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:31:55,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 42 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-08 22:31:55,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-01-08 22:31:55,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2025-01-08 22:31:55,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-01-08 22:31:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 68 transitions. [2025-01-08 22:31:55,031 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 68 transitions. Word has length 35 [2025-01-08 22:31:55,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:31:55,031 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 68 transitions. [2025-01-08 22:31:55,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:31:55,032 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 68 transitions. [2025-01-08 22:31:55,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-01-08 22:31:55,032 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:31:55,032 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:31:55,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:31:55,032 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:31:55,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:31:55,033 INFO L85 PathProgramCache]: Analyzing trace with hash -1580029261, now seen corresponding path program 1 times [2025-01-08 22:31:55,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:31:55,033 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689070401] [2025-01-08 22:31:55,033 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:31:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:31:55,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-08 22:31:55,064 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:31:55,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:31:55,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:55,284 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:31:55,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:31:55,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689070401] [2025-01-08 22:31:55,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689070401] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:31:55,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548743068] [2025-01-08 22:31:55,285 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:31:55,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:31:55,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:31:55,286 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:31:55,304 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:31:55,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-01-08 22:31:55,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-01-08 22:31:55,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:31:55,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:55,351 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-01-08 22:31:55,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:31:55,487 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-01-08 22:31:55,487 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:31:55,682 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:31:55,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1548743068] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:31:55,682 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:31:55,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 11] total 23 [2025-01-08 22:31:55,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828478569] [2025-01-08 22:31:55,682 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:31:55,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-08 22:31:55,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:31:55,683 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-08 22:31:55,683 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=402, Unknown=0, NotChecked=0, Total=506 [2025-01-08 22:31:55,684 INFO L87 Difference]: Start difference. First operand 54 states and 68 transitions. Second operand has 23 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-08 22:31:56,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:31:56,302 INFO L93 Difference]: Finished difference Result 206 states and 281 transitions. [2025-01-08 22:31:56,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-08 22:31:56,303 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 35 [2025-01-08 22:31:56,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:31:56,306 INFO L225 Difference]: With dead ends: 206 [2025-01-08 22:31:56,307 INFO L226 Difference]: Without dead ends: 163 [2025-01-08 22:31:56,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 319 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=283, Invalid=977, Unknown=0, NotChecked=0, Total=1260 [2025-01-08 22:31:56,309 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 132 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 231 SdHoareTripleChecker+Invalid, 708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:31:56,311 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 231 Invalid, 708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:31:56,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2025-01-08 22:31:56,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 96. [2025-01-08 22:31:56,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 80 states have (on average 1.325) internal successors, (106), 82 states have internal predecessors, (106), 9 states have call successors, (9), 6 states have call predecessors, (9), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2025-01-08 22:31:56,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 124 transitions. [2025-01-08 22:31:56,337 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 124 transitions. Word has length 35 [2025-01-08 22:31:56,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:31:56,338 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 124 transitions. [2025-01-08 22:31:56,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.210526315789474) internal successors, (42), 17 states have internal predecessors, (42), 6 states have call successors, (7), 3 states have call predecessors, (7), 6 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2025-01-08 22:31:56,338 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 124 transitions. [2025-01-08 22:31:56,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-08 22:31:56,338 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:31:56,338 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:31:56,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 22:31:56,539 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:31:56,540 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:31:56,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:31:56,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1011652875, now seen corresponding path program 2 times [2025-01-08 22:31:56,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:31:56,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304362022] [2025-01-08 22:31:56,540 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:31:56,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:31:56,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-08 22:31:56,559 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:31:56,561 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:31:56,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:56,634 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:31:56,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:31:56,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304362022] [2025-01-08 22:31:56,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304362022] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:31:56,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2077650500] [2025-01-08 22:31:56,634 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-01-08 22:31:56,634 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:31:56,635 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:31:56,636 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:31:56,638 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:31:56,667 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 36 statements into 2 equivalence classes. [2025-01-08 22:31:56,686 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 36 of 36 statements. [2025-01-08 22:31:56,686 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-01-08 22:31:56,686 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:56,687 INFO L256 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:31:56,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:31:56,755 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:31:56,755 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:31:56,815 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:31:56,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2077650500] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:31:56,815 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:31:56,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-08 22:31:56,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100087495] [2025-01-08 22:31:56,816 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:31:56,816 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:31:56,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:31:56,817 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:31:56,817 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:31:56,817 INFO L87 Difference]: Start difference. First operand 96 states and 124 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:31:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:31:57,031 INFO L93 Difference]: Finished difference Result 182 states and 238 transitions. [2025-01-08 22:31:57,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-08 22:31:57,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 36 [2025-01-08 22:31:57,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:31:57,033 INFO L225 Difference]: With dead ends: 182 [2025-01-08 22:31:57,033 INFO L226 Difference]: Without dead ends: 149 [2025-01-08 22:31:57,033 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 64 SyntacticMatches, 4 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=241, Unknown=0, NotChecked=0, Total=342 [2025-01-08 22:31:57,034 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 18 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 212 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:31:57,034 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 138 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 212 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:31:57,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-08 22:31:57,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 102. [2025-01-08 22:31:57,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 83 states have (on average 1.2409638554216869) internal successors, (103), 85 states have internal predecessors, (103), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-08 22:31:57,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2025-01-08 22:31:57,056 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 36 [2025-01-08 22:31:57,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:31:57,056 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2025-01-08 22:31:57,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 states have internal predecessors, (38), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:31:57,056 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2025-01-08 22:31:57,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-01-08 22:31:57,059 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:31:57,060 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:31:57,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:31:57,260 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:31:57,260 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:31:57,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:31:57,261 INFO L85 PathProgramCache]: Analyzing trace with hash -1852434906, now seen corresponding path program 3 times [2025-01-08 22:31:57,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:31:57,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635821001] [2025-01-08 22:31:57,261 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:31:57,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:31:57,270 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 5 equivalence classes. [2025-01-08 22:31:57,289 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 36 statements. [2025-01-08 22:31:57,289 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:31:57,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:57,364 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:31:57,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:31:57,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635821001] [2025-01-08 22:31:57,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [635821001] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:31:57,364 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171940081] [2025-01-08 22:31:57,364 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-01-08 22:31:57,364 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:31:57,365 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:31:57,367 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:31:57,369 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:31:57,402 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 36 statements into 5 equivalence classes. [2025-01-08 22:31:57,417 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 33 of 36 statements. [2025-01-08 22:31:57,417 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-01-08 22:31:57,418 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:57,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:31:57,419 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:31:57,465 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:31:57,466 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:31:57,512 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:31:57,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1171940081] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:31:57,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:31:57,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-01-08 22:31:57,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315214933] [2025-01-08 22:31:57,513 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:31:57,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-08 22:31:57,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:31:57,513 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-08 22:31:57,513 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:31:57,513 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:31:57,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:31:57,648 INFO L93 Difference]: Finished difference Result 141 states and 178 transitions. [2025-01-08 22:31:57,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:31:57,648 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 36 [2025-01-08 22:31:57,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:31:57,649 INFO L225 Difference]: With dead ends: 141 [2025-01-08 22:31:57,649 INFO L226 Difference]: Without dead ends: 116 [2025-01-08 22:31:57,650 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 65 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-01-08 22:31:57,650 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:31:57,650 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 90 Invalid, 136 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:31:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2025-01-08 22:31:57,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 103. [2025-01-08 22:31:57,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 84 states have (on average 1.25) internal successors, (105), 86 states have internal predecessors, (105), 11 states have call successors, (11), 7 states have call predecessors, (11), 7 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-01-08 22:31:57,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2025-01-08 22:31:57,661 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 36 [2025-01-08 22:31:57,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:31:57,661 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2025-01-08 22:31:57,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 states have internal predecessors, (34), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-01-08 22:31:57,661 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2025-01-08 22:31:57,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-01-08 22:31:57,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:31:57,662 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:31:57,668 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:31:57,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-01-08 22:31:57,862 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:31:57,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:31:57,862 INFO L85 PathProgramCache]: Analyzing trace with hash -474097588, now seen corresponding path program 4 times [2025-01-08 22:31:57,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:31:57,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [715173499] [2025-01-08 22:31:57,863 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:31:57,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:31:57,868 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-01-08 22:31:57,871 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 38 statements. [2025-01-08 22:31:57,871 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:31:57,871 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:57,923 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:31:57,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:31:57,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [715173499] [2025-01-08 22:31:57,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [715173499] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:31:57,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [44048878] [2025-01-08 22:31:57,923 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-01-08 22:31:57,924 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:31:57,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:31:57,925 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:31:57,927 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:31:57,960 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 38 statements into 2 equivalence classes. [2025-01-08 22:31:57,968 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 32 of 38 statements. [2025-01-08 22:31:57,968 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-01-08 22:31:57,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:57,970 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:31:57,972 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:31:58,027 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:31:58,027 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:31:58,078 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-01-08 22:31:58,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [44048878] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:31:58,078 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:31:58,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-01-08 22:31:58,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242356348] [2025-01-08 22:31:58,078 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:31:58,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 22:31:58,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:31:58,079 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 22:31:58,079 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2025-01-08 22:31:58,079 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:31:58,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:31:58,222 INFO L93 Difference]: Finished difference Result 124 states and 154 transitions. [2025-01-08 22:31:58,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-01-08 22:31:58,222 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 38 [2025-01-08 22:31:58,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:31:58,223 INFO L225 Difference]: With dead ends: 124 [2025-01-08 22:31:58,223 INFO L226 Difference]: Without dead ends: 91 [2025-01-08 22:31:58,223 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 69 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2025-01-08 22:31:58,224 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 10 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:31:58,224 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 80 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:31:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-01-08 22:31:58,236 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 82. [2025-01-08 22:31:58,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-08 22:31:58,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 97 transitions. [2025-01-08 22:31:58,237 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 97 transitions. Word has length 38 [2025-01-08 22:31:58,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:31:58,237 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 97 transitions. [2025-01-08 22:31:58,237 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 11 states have internal predecessors, (40), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:31:58,237 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 97 transitions. [2025-01-08 22:31:58,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-01-08 22:31:58,240 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:31:58,240 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:31:58,246 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-08 22:31:58,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-08 22:31:58,441 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:31:58,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:31:58,441 INFO L85 PathProgramCache]: Analyzing trace with hash -297829240, now seen corresponding path program 5 times [2025-01-08 22:31:58,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:31:58,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [179565339] [2025-01-08 22:31:58,442 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:31:58,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:31:58,447 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 7 equivalence classes. [2025-01-08 22:31:58,457 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 27 of 43 statements. [2025-01-08 22:31:58,457 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-08 22:31:58,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:58,516 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-01-08 22:31:58,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:31:58,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [179565339] [2025-01-08 22:31:58,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [179565339] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:31:58,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725136939] [2025-01-08 22:31:58,517 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-01-08 22:31:58,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:31:58,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:31:58,519 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:31:58,521 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:31:58,557 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 43 statements into 7 equivalence classes. [2025-01-08 22:31:58,595 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) and asserted 27 of 43 statements. [2025-01-08 22:31:58,595 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2025-01-08 22:31:58,595 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:58,596 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 22:31:58,597 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:31:58,652 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 26 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:31:58,652 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 22:31:58,700 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 18 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-01-08 22:31:58,701 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [725136939] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 22:31:58,701 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 22:31:58,701 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 10 [2025-01-08 22:31:58,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109622204] [2025-01-08 22:31:58,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 22:31:58,705 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-08 22:31:58,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:31:58,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-08 22:31:58,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-08 22:31:58,705 INFO L87 Difference]: Start difference. First operand 82 states and 97 transitions. Second operand has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:31:58,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:31:58,795 INFO L93 Difference]: Finished difference Result 94 states and 111 transitions. [2025-01-08 22:31:58,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-08 22:31:58,795 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 43 [2025-01-08 22:31:58,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:31:58,796 INFO L225 Difference]: With dead ends: 94 [2025-01-08 22:31:58,796 INFO L226 Difference]: Without dead ends: 87 [2025-01-08 22:31:58,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 81 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2025-01-08 22:31:58,796 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 6 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:31:58,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 114 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-08 22:31:58,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-01-08 22:31:58,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2025-01-08 22:31:58,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 70 states have (on average 1.1857142857142857) internal successors, (83), 71 states have internal predecessors, (83), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-01-08 22:31:58,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 99 transitions. [2025-01-08 22:31:58,804 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 99 transitions. Word has length 43 [2025-01-08 22:31:58,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:31:58,804 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 99 transitions. [2025-01-08 22:31:58,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.3) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-01-08 22:31:58,804 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 99 transitions. [2025-01-08 22:31:58,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-01-08 22:31:58,805 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:31:58,805 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:31:58,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-08 22:31:59,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-01-08 22:31:59,005 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:31:59,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:31:59,006 INFO L85 PathProgramCache]: Analyzing trace with hash -875340708, now seen corresponding path program 6 times [2025-01-08 22:31:59,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:31:59,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [185753620] [2025-01-08 22:31:59,006 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:31:59,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:31:59,012 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 7 equivalence classes. [2025-01-08 22:31:59,035 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 22:31:59,036 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-08 22:31:59,036 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-08 22:31:59,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1584204684] [2025-01-08 22:31:59,036 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-01-08 22:31:59,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:31:59,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:31:59,038 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:31:59,040 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-01-08 22:31:59,073 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 45 statements into 7 equivalence classes. [2025-01-08 22:31:59,575 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 45 of 45 statements. [2025-01-08 22:31:59,575 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-01-08 22:31:59,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:31:59,577 WARN L254 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-01-08 22:31:59,580 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:31:59,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-01-08 22:31:59,705 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 19 treesize of output 18 [2025-01-08 22:31:59,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:31:59,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:31:59,802 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:31:59,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2025-01-08 22:31:59,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:31:59,858 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:31:59,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:31:59,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:31:59,861 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-01-08 22:31:59,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-01-08 22:32:00,579 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-01-08 22:32:00,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 210 treesize of output 195 [2025-01-08 22:32:00,643 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,650 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,657 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,660 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,662 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,676 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,683 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,688 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,691 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,699 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,701 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,702 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:00,755 INFO L349 Elim1Store]: treesize reduction 127, result has 0.8 percent of original size [2025-01-08 22:32:00,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 4 select indices, 4 select index equivalence classes, 25 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 3 case distinctions, treesize of input 152 treesize of output 639 [2025-01-08 22:32:01,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,009 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,087 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,095 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-08 22:32:01,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,151 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-08 22:32:01,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,170 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,185 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,186 INFO L173 IndexEqualityManager]: detected equality via solver [2025-01-08 22:32:01,216 INFO L349 Elim1Store]: treesize reduction 139, result has 0.7 percent of original size [2025-01-08 22:32:01,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 23 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 149 [2025-01-08 22:32:01,880 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 353 treesize of output 325 [2025-01-08 22:32:01,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,900 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,918 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,929 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:01,985 INFO L349 Elim1Store]: treesize reduction 297, result has 0.3 percent of original size [2025-01-08 22:32:01,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 5 select indices, 5 select index equivalence classes, 13 disjoint index pairs (out of 10 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 232 treesize of output 370 [2025-01-08 22:32:02,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:02,237 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:02,238 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:02,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:02,255 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:02,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:02,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:02,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:02,262 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:02,266 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:02,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-01-08 22:32:02,412 INFO L349 Elim1Store]: treesize reduction 164, result has 47.1 percent of original size [2025-01-08 22:32:02,413 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 13 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 8 case distinctions, treesize of input 229 treesize of output 266 [2025-01-08 22:32:16,377 WARN L286 SmtUtils]: Spent 6.04s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-08 22:32:24,125 WARN L286 SmtUtils]: Spent 5.15s on a formula simplification. DAG size of input: 3 DAG size of output: 1 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-08 22:32:51,467 WARN L286 SmtUtils]: Spent 5.32s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-08 22:33:06,791 WARN L286 SmtUtils]: Spent 11.01s on a formula simplification that was a NOOP. DAG size: 25 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)