./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/mods.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 48c9605d 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-fpi/mods.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 f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-07 17:21:30,276 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-07 17:21:30,343 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-07 17:21:30,351 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-07 17:21:30,351 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-07 17:21:30,372 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-07 17:21:30,372 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-07 17:21:30,372 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-07 17:21:30,373 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-07 17:21:30,373 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-07 17:21:30,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-07 17:21:30,373 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-07 17:21:30,373 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-07 17:21:30,373 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-07 17:21:30,373 INFO L153 SettingsManager]: * Use SBE=true [2025-02-07 17:21:30,374 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-07 17:21:30,374 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-07 17:21:30,375 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-07 17:21:30,375 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-07 17:21:30,375 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-07 17:21:30,375 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-07 17:21:30,376 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-07 17:21:30,376 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-07 17:21:30,376 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-07 17:21:30,376 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-07 17:21:30,376 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-07 17:21:30,376 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-07 17:21:30,376 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-07 17:21:30,377 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-07 17:21:30,377 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-07 17:21:30,377 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-07 17:21:30,377 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-07 17:21:30,377 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:21:30,378 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-07 17:21:30,378 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-07 17:21:30,378 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-07 17:21:30,378 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-07 17:21:30,378 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-07 17:21:30,378 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-07 17:21:30,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-07 17:21:30,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-07 17:21:30,378 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-07 17:21:30,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-07 17:21:30,379 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 -> f15d84a1f588b4a2fae1a1f53311fed1d9572550b31409f886696465cdc8f8ba [2025-02-07 17:21:30,661 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-07 17:21:30,672 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-07 17:21:30,674 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-07 17:21:30,676 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-07 17:21:30,677 INFO L274 PluginConnector]: CDTParser initialized [2025-02-07 17:21:30,678 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/mods.c [2025-02-07 17:21:31,918 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a40efd7f2/a487c93d157e493eb2a392af98ebcd79/FLAGdca546d0c [2025-02-07 17:21:32,154 INFO L384 CDTParser]: Found 1 translation units. [2025-02-07 17:21:32,157 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/array-fpi/mods.c [2025-02-07 17:21:32,165 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a40efd7f2/a487c93d157e493eb2a392af98ebcd79/FLAGdca546d0c [2025-02-07 17:21:32,179 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a40efd7f2/a487c93d157e493eb2a392af98ebcd79 [2025-02-07 17:21:32,181 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-07 17:21:32,183 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-07 17:21:32,184 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-07 17:21:32,184 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-07 17:21:32,188 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-07 17:21:32,189 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,190 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54c292c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32, skipping insertion in model container [2025-02-07 17:21:32,190 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,201 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-07 17:21:32,330 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-fpi/mods.c[587,600] [2025-02-07 17:21:32,354 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:21:32,364 INFO L200 MainTranslator]: Completed pre-run [2025-02-07 17:21:32,373 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-fpi/mods.c[587,600] [2025-02-07 17:21:32,383 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-07 17:21:32,397 INFO L204 MainTranslator]: Completed translation [2025-02-07 17:21:32,398 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32 WrapperNode [2025-02-07 17:21:32,399 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-07 17:21:32,400 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-07 17:21:32,401 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-07 17:21:32,401 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-07 17:21:32,406 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,412 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,431 INFO L138 Inliner]: procedures = 17, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2025-02-07 17:21:32,432 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-07 17:21:32,433 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-07 17:21:32,433 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-07 17:21:32,433 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-07 17:21:32,439 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,439 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,441 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,462 INFO L175 MemorySlicer]: Split 21 memory accesses to 4 slices as follows [2, 7, 7, 5]. 33 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7, 0, 0]. The 5 writes are split as follows [0, 0, 3, 2]. [2025-02-07 17:21:32,463 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,463 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,470 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,470 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,476 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,477 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-07 17:21:32,478 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-07 17:21:32,478 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-07 17:21:32,478 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-07 17:21:32,479 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (1/1) ... [2025-02-07 17:21:32,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-07 17:21:32,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:21:32,513 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-02-07 17:21:32,518 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-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-07 17:21:32,538 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-02-07 17:21:32,538 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-07 17:21:32,602 INFO L257 CfgBuilder]: Building ICFG [2025-02-07 17:21:32,603 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-07 17:21:32,753 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L28: call ULTIMATE.dealloc(main_~#sum~0#1.base, main_~#sum~0#1.offset);havoc main_~#sum~0#1.base, main_~#sum~0#1.offset; [2025-02-07 17:21:32,759 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-02-07 17:21:32,760 INFO L308 CfgBuilder]: Performing block encoding [2025-02-07 17:21:32,767 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-07 17:21:32,768 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-07 17:21:32,768 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:21:32 BoogieIcfgContainer [2025-02-07 17:21:32,768 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-07 17:21:32,771 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-07 17:21:32,771 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-07 17:21:32,775 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-07 17:21:32,775 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.02 05:21:32" (1/3) ... [2025-02-07 17:21:32,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d41940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:21:32, skipping insertion in model container [2025-02-07 17:21:32,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.02 05:21:32" (2/3) ... [2025-02-07 17:21:32,776 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36d41940 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.02 05:21:32, skipping insertion in model container [2025-02-07 17:21:32,776 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 07.02 05:21:32" (3/3) ... [2025-02-07 17:21:32,778 INFO L128 eAbstractionObserver]: Analyzing ICFG mods.c [2025-02-07 17:21:32,791 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-07 17:21:32,793 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG mods.c that has 1 procedures, 16 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-02-07 17:21:32,830 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-07 17:21:32,839 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;@48f4b1f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-07 17:21:32,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-07 17:21:32,842 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:32,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 17:21:32,847 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:21:32,848 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:21:32,848 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:21:32,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:21:32,852 INFO L85 PathProgramCache]: Analyzing trace with hash -1208577299, now seen corresponding path program 1 times [2025-02-07 17:21:32,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:21:32,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663923610] [2025-02-07 17:21:32,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:21:32,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:21:32,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 17:21:32,936 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:21:32,937 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:21:32,937 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:21:32,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:21:32,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663923610] [2025-02-07 17:21:32,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1663923610] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:21:32,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:21:32,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-07 17:21:32,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083844929] [2025-02-07 17:21:32,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:21:32,993 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-07 17:21:32,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:21:33,007 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-07 17:21:33,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-07 17:21:33,009 INFO L87 Difference]: Start difference. First operand has 16 states, 14 states have (on average 1.6428571428571428) internal successors, (23), 15 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:33,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:21:33,016 INFO L93 Difference]: Finished difference Result 29 states and 41 transitions. [2025-02-07 17:21:33,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-07 17:21:33,018 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 17:21:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:21:33,022 INFO L225 Difference]: With dead ends: 29 [2025-02-07 17:21:33,022 INFO L226 Difference]: Without dead ends: 13 [2025-02-07 17:21:33,024 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-02-07 17:21:33,026 INFO L435 NwaCegarLoop]: 21 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, 21 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-02-07 17:21:33,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-07 17:21:33,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2025-02-07 17:21:33,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2025-02-07 17:21:33,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 12 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:33,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 17 transitions. [2025-02-07 17:21:33,056 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 17 transitions. Word has length 11 [2025-02-07 17:21:33,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:21:33,057 INFO L471 AbstractCegarLoop]: Abstraction has 13 states and 17 transitions. [2025-02-07 17:21:33,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:33,057 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 17 transitions. [2025-02-07 17:21:33,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-02-07 17:21:33,058 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:21:33,058 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:21:33,059 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-07 17:21:33,059 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:21:33,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:21:33,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1278935534, now seen corresponding path program 1 times [2025-02-07 17:21:33,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:21:33,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220975224] [2025-02-07 17:21:33,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:21:33,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:21:33,083 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-02-07 17:21:33,103 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-02-07 17:21:33,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:21:33,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:33,254 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:21:33,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:21:33,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220975224] [2025-02-07 17:21:33,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220975224] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-07 17:21:33,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-07 17:21:33,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-07 17:21:33,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165301610] [2025-02-07 17:21:33,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-07 17:21:33,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-07 17:21:33,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:21:33,256 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-07 17:21:33,256 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-07 17:21:33,256 INFO L87 Difference]: Start difference. First operand 13 states and 17 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:33,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:21:33,322 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2025-02-07 17:21:33,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-07 17:21:33,323 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-02-07 17:21:33,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:21:33,324 INFO L225 Difference]: With dead ends: 30 [2025-02-07 17:21:33,324 INFO L226 Difference]: Without dead ends: 22 [2025-02-07 17:21:33,324 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-02-07 17:21:33,325 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 18 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:21:33,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 10 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:21:33,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-02-07 17:21:33,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 17. [2025-02-07 17:21:33,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.3125) internal successors, (21), 16 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:33,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 21 transitions. [2025-02-07 17:21:33,331 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 21 transitions. Word has length 11 [2025-02-07 17:21:33,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:21:33,331 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 21 transitions. [2025-02-07 17:21:33,333 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 21 transitions. [2025-02-07 17:21:33,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-02-07 17:21:33,334 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:21:33,334 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:21:33,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-07 17:21:33,335 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:21:33,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:21:33,335 INFO L85 PathProgramCache]: Analyzing trace with hash -2011022226, now seen corresponding path program 1 times [2025-02-07 17:21:33,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:21:33,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258830211] [2025-02-07 17:21:33,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:21:33,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:21:33,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 17:21:33,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 17:21:33,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:21:33,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:21:33,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1838890689] [2025-02-07 17:21:33,458 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:21:33,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:21:33,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:21:33,464 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-02-07 17:21:33,465 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-02-07 17:21:33,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-02-07 17:21:33,564 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-02-07 17:21:33,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:21:33,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:33,568 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 39 conjuncts are in the unsatisfiable core [2025-02-07 17:21:33,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:21:33,666 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-02-07 17:21:33,700 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-02-07 17:21:33,783 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 19 treesize of output 11 [2025-02-07 17:21:33,874 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 19 treesize of output 11 [2025-02-07 17:21:33,938 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 19 treesize of output 11 [2025-02-07 17:21:34,011 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:21:34,011 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:21:34,523 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 38 [2025-02-07 17:21:34,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 47 [2025-02-07 17:21:34,615 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:21:34,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:21:34,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258830211] [2025-02-07 17:21:34,618 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 17:21:34,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838890689] [2025-02-07 17:21:34,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838890689] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:21:34,618 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:21:34,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 23 [2025-02-07 17:21:34,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523637187] [2025-02-07 17:21:34,618 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:21:34,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-02-07 17:21:34,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:21:34,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-02-07 17:21:34,620 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=427, Unknown=0, NotChecked=0, Total=506 [2025-02-07 17:21:34,620 INFO L87 Difference]: Start difference. First operand 17 states and 21 transitions. Second operand has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:35,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:21:35,114 INFO L93 Difference]: Finished difference Result 39 states and 48 transitions. [2025-02-07 17:21:35,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 17:21:35,115 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-02-07 17:21:35,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:21:35,115 INFO L225 Difference]: With dead ends: 39 [2025-02-07 17:21:35,115 INFO L226 Difference]: Without dead ends: 37 [2025-02-07 17:21:35,116 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=119, Invalid=637, Unknown=0, NotChecked=0, Total=756 [2025-02-07 17:21:35,117 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 44 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-07 17:21:35,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 116 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-07 17:21:35,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-07 17:21:35,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2025-02-07 17:21:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.375) internal successors, (33), 24 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:35,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-02-07 17:21:35,124 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 15 [2025-02-07 17:21:35,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:21:35,124 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-02-07 17:21:35,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2025-02-07 17:21:35,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-07 17:21:35,125 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:21:35,125 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:21:35,132 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-02-07 17:21:35,325 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:21:35,326 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:21:35,326 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:21:35,326 INFO L85 PathProgramCache]: Analyzing trace with hash -1359702887, now seen corresponding path program 2 times [2025-02-07 17:21:35,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:21:35,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1390366793] [2025-02-07 17:21:35,326 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:21:35,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:21:35,337 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-07 17:21:35,353 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 17:21:35,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:21:35,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:35,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 17:21:35,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:21:35,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1390366793] [2025-02-07 17:21:35,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1390366793] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:21:35,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [889478952] [2025-02-07 17:21:35,503 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:21:35,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:21:35,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:21:35,505 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-02-07 17:21:35,507 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-02-07 17:21:35,552 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 16 statements into 2 equivalence classes. [2025-02-07 17:21:35,574 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 16 of 16 statements. [2025-02-07 17:21:35,574 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:21:35,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:35,575 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:21:35,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:21:35,624 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 17:21:35,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:21:35,652 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-07 17:21:35,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [889478952] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:21:35,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:21:35,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2025-02-07 17:21:35,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671508405] [2025-02-07 17:21:35,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:21:35,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-07 17:21:35,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:21:35,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-07 17:21:35,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-07 17:21:35,653 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:35,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:21:35,755 INFO L93 Difference]: Finished difference Result 62 states and 79 transitions. [2025-02-07 17:21:35,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-07 17:21:35,756 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2025-02-07 17:21:35,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:21:35,756 INFO L225 Difference]: With dead ends: 62 [2025-02-07 17:21:35,756 INFO L226 Difference]: Without dead ends: 37 [2025-02-07 17:21:35,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:21:35,757 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 20 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:21:35,758 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 34 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:21:35,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-02-07 17:21:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 25. [2025-02-07 17:21:35,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 24 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:35,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 31 transitions. [2025-02-07 17:21:35,767 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 31 transitions. Word has length 16 [2025-02-07 17:21:35,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:21:35,768 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 31 transitions. [2025-02-07 17:21:35,768 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.3) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:35,768 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 31 transitions. [2025-02-07 17:21:35,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-02-07 17:21:35,768 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:21:35,768 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:21:35,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-07 17:21:35,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:21:35,969 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:21:35,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:21:35,969 INFO L85 PathProgramCache]: Analyzing trace with hash -16541202, now seen corresponding path program 3 times [2025-02-07 17:21:35,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:21:35,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61951749] [2025-02-07 17:21:35,969 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:21:35,970 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:21:35,979 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-02-07 17:21:36,002 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 17:21:36,003 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-07 17:21:36,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:36,141 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:21:36,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:21:36,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61951749] [2025-02-07 17:21:36,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61951749] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:21:36,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1910882283] [2025-02-07 17:21:36,142 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:21:36,142 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:21:36,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:21:36,144 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-02-07 17:21:36,146 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-02-07 17:21:36,192 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 17 statements into 2 equivalence classes. [2025-02-07 17:21:36,214 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) and asserted 17 of 17 statements. [2025-02-07 17:21:36,215 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2025-02-07 17:21:36,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:36,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 135 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-07 17:21:36,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:21:36,267 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:21:36,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:21:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-07 17:21:36,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1910882283] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:21:36,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:21:36,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-02-07 17:21:36,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214194687] [2025-02-07 17:21:36,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:21:36,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-07 17:21:36,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:21:36,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-07 17:21:36,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-02-07 17:21:36,316 INFO L87 Difference]: Start difference. First operand 25 states and 31 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:36,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:21:36,428 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2025-02-07 17:21:36,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 17:21:36,429 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-02-07 17:21:36,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:21:36,429 INFO L225 Difference]: With dead ends: 37 [2025-02-07 17:21:36,429 INFO L226 Difference]: Without dead ends: 31 [2025-02-07 17:21:36,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 4 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=126, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:21:36,430 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 51 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:21:36,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 32 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:21:36,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-02-07 17:21:36,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 21. [2025-02-07 17:21:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:36,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-02-07 17:21:36,435 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 17 [2025-02-07 17:21:36,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:21:36,435 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-02-07 17:21:36,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:36,435 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-02-07 17:21:36,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-02-07 17:21:36,436 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:21:36,436 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:21:36,444 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-02-07 17:21:36,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:21:36,637 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:21:36,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:21:36,637 INFO L85 PathProgramCache]: Analyzing trace with hash -350310546, now seen corresponding path program 4 times [2025-02-07 17:21:36,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:21:36,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502096608] [2025-02-07 17:21:36,637 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:21:36,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:21:36,645 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-02-07 17:21:36,689 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 17:21:36,689 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 17:21:36,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:21:36,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1542569701] [2025-02-07 17:21:36,695 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:21:36,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:21:36,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:21:36,699 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-02-07 17:21:36,703 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-02-07 17:21:36,749 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 19 statements into 2 equivalence classes. [2025-02-07 17:21:36,792 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 19 of 19 statements. [2025-02-07 17:21:36,792 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 17:21:36,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:36,798 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 54 conjuncts are in the unsatisfiable core [2025-02-07 17:21:36,801 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:21:36,807 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-02-07 17:21:36,817 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-02-07 17:21:36,838 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 21 treesize of output 20 [2025-02-07 17:21:36,899 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 19 treesize of output 11 [2025-02-07 17:21:36,934 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 19 treesize of output 11 [2025-02-07 17:21:36,995 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:21:36,995 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 1 case distinctions, treesize of input 28 treesize of output 23 [2025-02-07 17:21:37,028 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:21:37,029 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 1 case distinctions, treesize of input 30 treesize of output 23 [2025-02-07 17:21:37,095 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:21:37,096 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 1 case distinctions, treesize of input 28 treesize of output 23 [2025-02-07 17:21:37,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:21:37,134 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 1 case distinctions, treesize of input 30 treesize of output 23 [2025-02-07 17:21:37,204 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:21:37,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:21:38,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 39 [2025-02-07 17:21:38,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-02-07 17:21:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:21:39,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:21:39,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502096608] [2025-02-07 17:21:39,065 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 17:21:39,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1542569701] [2025-02-07 17:21:39,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1542569701] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:21:39,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:21:39,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 29 [2025-02-07 17:21:39,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1064323900] [2025-02-07 17:21:39,066 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:21:39,066 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-02-07 17:21:39,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:21:39,067 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-02-07 17:21:39,068 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=681, Unknown=0, NotChecked=0, Total=812 [2025-02-07 17:21:39,069 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:45,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:21:45,014 INFO L93 Difference]: Finished difference Result 81 states and 102 transitions. [2025-02-07 17:21:45,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-02-07 17:21:45,014 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2025-02-07 17:21:45,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:21:45,015 INFO L225 Difference]: With dead ends: 81 [2025-02-07 17:21:45,015 INFO L226 Difference]: Without dead ends: 79 [2025-02-07 17:21:45,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 702 ImplicationChecksByTransitivity, 6.4s TimeCoverageRelationStatistics Valid=582, Invalid=3078, Unknown=0, NotChecked=0, Total=3660 [2025-02-07 17:21:45,018 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 132 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 422 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 422 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:21:45,018 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 122 Invalid, 515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 422 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-07 17:21:45,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-02-07 17:21:45,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 51. [2025-02-07 17:21:45,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.36) internal successors, (68), 50 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:45,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 68 transitions. [2025-02-07 17:21:45,033 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 68 transitions. Word has length 19 [2025-02-07 17:21:45,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:21:45,033 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 68 transitions. [2025-02-07 17:21:45,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:45,034 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2025-02-07 17:21:45,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-02-07 17:21:45,034 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:21:45,034 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:21:45,042 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-02-07 17:21:45,235 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,SelfDestructingSolverStorable5 [2025-02-07 17:21:45,235 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:21:45,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:21:45,236 INFO L85 PathProgramCache]: Analyzing trace with hash -712615698, now seen corresponding path program 5 times [2025-02-07 17:21:45,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:21:45,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062207534] [2025-02-07 17:21:45,236 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:21:45,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:21:45,251 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-02-07 17:21:45,298 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 17:21:45,299 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-07 17:21:45,299 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:45,448 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 17:21:45,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:21:45,448 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062207534] [2025-02-07 17:21:45,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062207534] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:21:45,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [938998115] [2025-02-07 17:21:45,449 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:21:45,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:21:45,449 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:21:45,452 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-02-07 17:21:45,453 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-02-07 17:21:45,498 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 21 statements into 3 equivalence classes. [2025-02-07 17:21:45,538 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-02-07 17:21:45,539 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-02-07 17:21:45,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:45,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 17:21:45,541 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:21:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 17:21:45,580 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:21:45,628 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-02-07 17:21:45,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [938998115] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:21:45,629 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:21:45,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-02-07 17:21:45,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [295606310] [2025-02-07 17:21:45,629 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:21:45,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-07 17:21:45,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:21:45,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-07 17:21:45,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-02-07 17:21:45,630 INFO L87 Difference]: Start difference. First operand 51 states and 68 transitions. Second operand has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:21:45,844 INFO L93 Difference]: Finished difference Result 101 states and 129 transitions. [2025-02-07 17:21:45,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-07 17:21:45,845 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-02-07 17:21:45,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:21:45,847 INFO L225 Difference]: With dead ends: 101 [2025-02-07 17:21:45,847 INFO L226 Difference]: Without dead ends: 81 [2025-02-07 17:21:45,847 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 33 SyntacticMatches, 7 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2025-02-07 17:21:45,848 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 35 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:21:45,848 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 82 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:21:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-02-07 17:21:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 45. [2025-02-07 17:21:45,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 44 states have (on average 1.2727272727272727) internal successors, (56), 44 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:45,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2025-02-07 17:21:45,866 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 21 [2025-02-07 17:21:45,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:21:45,867 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2025-02-07 17:21:45,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.8333333333333333) internal successors, (22), 12 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:45,867 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2025-02-07 17:21:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-02-07 17:21:45,867 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:21:45,867 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:21:45,876 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-07 17:21:46,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:21:46,069 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:21:46,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:21:46,069 INFO L85 PathProgramCache]: Analyzing trace with hash -386330471, now seen corresponding path program 6 times [2025-02-07 17:21:46,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:21:46,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618249618] [2025-02-07 17:21:46,070 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:21:46,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:21:46,079 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-02-07 17:21:46,108 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 17:21:46,108 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-07 17:21:46,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:46,229 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 5 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-07 17:21:46,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:21:46,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618249618] [2025-02-07 17:21:46,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618249618] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:21:46,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [176715622] [2025-02-07 17:21:46,230 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-02-07 17:21:46,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:21:46,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:21:46,232 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-02-07 17:21:46,233 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-02-07 17:21:46,276 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 22 statements into 3 equivalence classes. [2025-02-07 17:21:46,302 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) and asserted 22 of 22 statements. [2025-02-07 17:21:46,302 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 3 check-sat command(s) [2025-02-07 17:21:46,302 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:46,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-07 17:21:46,305 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:21:46,355 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:21:46,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:21:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-02-07 17:21:46,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [176715622] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:21:46,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:21:46,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-02-07 17:21:46,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116705565] [2025-02-07 17:21:46,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:21:46,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-07 17:21:46,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:21:46,388 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-07 17:21:46,388 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-07 17:21:46,389 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:46,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:21:46,502 INFO L93 Difference]: Finished difference Result 82 states and 97 transitions. [2025-02-07 17:21:46,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-07 17:21:46,502 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2025-02-07 17:21:46,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:21:46,503 INFO L225 Difference]: With dead ends: 82 [2025-02-07 17:21:46,503 INFO L226 Difference]: Without dead ends: 40 [2025-02-07 17:21:46,503 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:21:46,504 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 27 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:21:46,504 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 45 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:21:46,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-02-07 17:21:46,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 25. [2025-02-07 17:21:46,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:46,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2025-02-07 17:21:46,511 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2025-02-07 17:21:46,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:21:46,511 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2025-02-07 17:21:46,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.142857142857143) internal successors, (30), 14 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:21:46,512 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2025-02-07 17:21:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-02-07 17:21:46,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:21:46,512 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:21:46,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-02-07 17:21:46,712 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,SelfDestructingSolverStorable7 [2025-02-07 17:21:46,713 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:21:46,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:21:46,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1279505938, now seen corresponding path program 7 times [2025-02-07 17:21:46,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:21:46,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861119022] [2025-02-07 17:21:46,714 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:21:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:21:46,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 17:21:46,776 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 17:21:46,776 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:21:46,776 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:21:46,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1645347899] [2025-02-07 17:21:46,778 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-02-07 17:21:46,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:21:46,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:21:46,781 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-02-07 17:21:46,783 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-02-07 17:21:46,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-02-07 17:21:46,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-02-07 17:21:46,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:21:46,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:21:46,875 INFO L256 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 74 conjuncts are in the unsatisfiable core [2025-02-07 17:21:46,879 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:21:46,886 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-02-07 17:21:46,900 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-02-07 17:21:46,919 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-02-07 17:21:46,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:21:46,942 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 26 treesize of output 28 [2025-02-07 17:21:46,998 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 19 treesize of output 11 [2025-02-07 17:21:47,028 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 19 treesize of output 11 [2025-02-07 17:21:47,054 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 19 treesize of output 11 [2025-02-07 17:21:47,123 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:21:47,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-02-07 17:21:47,168 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:21:47,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-02-07 17:21:47,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:21:47,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-02-07 17:21:47,268 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:21:47,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-02-07 17:21:47,310 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:21:47,310 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-02-07 17:21:47,352 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:21:47,353 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 31 [2025-02-07 17:21:47,438 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:21:47,438 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:21:48,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 194 treesize of output 182 [2025-02-07 17:21:48,725 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:21:48,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16141 treesize of output 14861 [2025-02-07 17:22:06,412 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:22:06,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:22:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861119022] [2025-02-07 17:22:06,412 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 17:22:06,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1645347899] [2025-02-07 17:22:06,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1645347899] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:22:06,412 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:22:06,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2025-02-07 17:22:06,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102390387] [2025-02-07 17:22:06,412 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:22:06,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2025-02-07 17:22:06,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:22:06,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2025-02-07 17:22:06,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=185, Invalid=1219, Unknown=2, NotChecked=0, Total=1406 [2025-02-07 17:22:06,414 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:22:08,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-02-07 17:22:17,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-02-07 17:22:21,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-02-07 17:22:21,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:22:21,555 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2025-02-07 17:22:21,556 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-02-07 17:22:21,556 INFO L78 Accepts]: Start accepts. Automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2025-02-07 17:22:21,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:22:21,557 INFO L225 Difference]: With dead ends: 76 [2025-02-07 17:22:21,557 INFO L226 Difference]: Without dead ends: 74 [2025-02-07 17:22:21,559 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 424 ImplicationChecksByTransitivity, 20.7s TimeCoverageRelationStatistics Valid=420, Invalid=2548, Unknown=2, NotChecked=0, Total=2970 [2025-02-07 17:22:21,559 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 135 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 54 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.8s IncrementalHoareTripleChecker+Time [2025-02-07 17:22:21,560 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 208 Invalid, 650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 595 Invalid, 1 Unknown, 0 Unchecked, 11.8s Time] [2025-02-07 17:22:21,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-02-07 17:22:21,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 47. [2025-02-07 17:22:21,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.2826086956521738) internal successors, (59), 46 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:22:21,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 59 transitions. [2025-02-07 17:22:21,576 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 59 transitions. Word has length 23 [2025-02-07 17:22:21,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:22:21,576 INFO L471 AbstractCegarLoop]: Abstraction has 47 states and 59 transitions. [2025-02-07 17:22:21,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:22:21,576 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 59 transitions. [2025-02-07 17:22:21,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-02-07 17:22:21,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:22:21,577 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:22:21,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-02-07 17:22:21,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:22:21,777 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:22:21,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:22:21,778 INFO L85 PathProgramCache]: Analyzing trace with hash -1237987559, now seen corresponding path program 8 times [2025-02-07 17:22:21,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:22:21,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579572771] [2025-02-07 17:22:21,778 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:22:21,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:22:21,785 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-07 17:22:21,806 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 17:22:21,808 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:22:21,808 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:22:21,951 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:22:21,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:22:21,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579572771] [2025-02-07 17:22:21,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579572771] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:22:21,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1946627601] [2025-02-07 17:22:21,951 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-07 17:22:21,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:22:21,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:22:21,953 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:22:21,954 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-07 17:22:22,003 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-02-07 17:22:22,023 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-02-07 17:22:22,023 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-07 17:22:22,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:22:22,023 INFO L256 TraceCheckSpWp]: Trace formula consists of 184 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 17:22:22,024 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:22:22,092 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:22:22,093 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:22:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-07 17:22:22,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1946627601] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:22:22,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:22:22,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 16 [2025-02-07 17:22:22,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919559904] [2025-02-07 17:22:22,133 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:22:22,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-07 17:22:22,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:22:22,135 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-07 17:22:22,135 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2025-02-07 17:22:22,136 INFO L87 Difference]: Start difference. First operand 47 states and 59 transitions. Second operand has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:22:22,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:22:22,268 INFO L93 Difference]: Finished difference Result 114 states and 135 transitions. [2025-02-07 17:22:22,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-07 17:22:22,269 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2025-02-07 17:22:22,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:22:22,269 INFO L225 Difference]: With dead ends: 114 [2025-02-07 17:22:22,269 INFO L226 Difference]: Without dead ends: 84 [2025-02-07 17:22:22,270 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 36 SyntacticMatches, 6 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2025-02-07 17:22:22,270 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 68 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-07 17:22:22,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 51 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-07 17:22:22,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-02-07 17:22:22,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 58. [2025-02-07 17:22:22,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1929824561403508) internal successors, (68), 57 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:22:22,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 68 transitions. [2025-02-07 17:22:22,290 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 68 transitions. Word has length 24 [2025-02-07 17:22:22,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:22:22,290 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 68 transitions. [2025-02-07 17:22:22,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.8125) internal successors, (29), 16 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:22:22,291 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 68 transitions. [2025-02-07 17:22:22,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-02-07 17:22:22,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:22:22,291 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:22:22,300 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-02-07 17:22:22,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:22:22,492 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:22:22,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:22:22,493 INFO L85 PathProgramCache]: Analyzing trace with hash 405319534, now seen corresponding path program 9 times [2025-02-07 17:22:22,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:22:22,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112289968] [2025-02-07 17:22:22,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:22:22,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:22:22,503 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-02-07 17:22:22,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 17:22:22,535 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 17:22:22,535 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:22:22,693 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 3 proven. 13 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 17:22:22,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:22:22,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112289968] [2025-02-07 17:22:22,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112289968] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:22:22,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1391144629] [2025-02-07 17:22:22,693 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-07 17:22:22,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:22:22,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:22:22,696 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:22:22,698 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-07 17:22:22,760 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 25 statements into 3 equivalence classes. [2025-02-07 17:22:22,859 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 25 of 25 statements. [2025-02-07 17:22:22,860 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-07 17:22:22,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:22:22,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-07 17:22:22,864 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:22:22,948 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 17:22:22,948 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:22:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-02-07 17:22:23,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1391144629] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:22:23,010 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:22:23,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-02-07 17:22:23,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1000207192] [2025-02-07 17:22:23,010 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:22:23,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-07 17:22:23,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:22:23,011 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-07 17:22:23,011 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-02-07 17:22:23,011 INFO L87 Difference]: Start difference. First operand 58 states and 68 transitions. Second operand has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:22:23,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:22:23,232 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2025-02-07 17:22:23,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-07 17:22:23,233 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2025-02-07 17:22:23,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:22:23,233 INFO L225 Difference]: With dead ends: 98 [2025-02-07 17:22:23,233 INFO L226 Difference]: Without dead ends: 71 [2025-02-07 17:22:23,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 36 SyntacticMatches, 8 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 205 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=148, Invalid=452, Unknown=0, NotChecked=0, Total=600 [2025-02-07 17:22:23,234 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 76 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:22:23,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 105 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:22:23,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-07 17:22:23,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 49. [2025-02-07 17:22:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.125) internal successors, (54), 48 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:22:23,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 54 transitions. [2025-02-07 17:22:23,248 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 54 transitions. Word has length 25 [2025-02-07 17:22:23,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:22:23,248 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 54 transitions. [2025-02-07 17:22:23,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.7058823529411764) internal successors, (29), 17 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:22:23,249 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 54 transitions. [2025-02-07 17:22:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-02-07 17:22:23,249 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:22:23,249 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:22:23,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-02-07 17:22:23,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:22:23,449 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:22:23,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:22:23,450 INFO L85 PathProgramCache]: Analyzing trace with hash 991616238, now seen corresponding path program 10 times [2025-02-07 17:22:23,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:22:23,450 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852268034] [2025-02-07 17:22:23,450 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:22:23,450 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:22:23,457 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-07 17:22:23,510 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 17:22:23,510 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 17:22:23,510 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-07 17:22:23,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [966166453] [2025-02-07 17:22:23,512 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-02-07 17:22:23,512 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:22:23,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:22:23,514 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:22:23,516 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-07 17:22:23,581 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-02-07 17:22:23,682 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-02-07 17:22:23,682 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-02-07 17:22:23,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:22:23,683 INFO L256 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 98 conjuncts are in the unsatisfiable core [2025-02-07 17:22:23,687 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:22:23,692 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-02-07 17:22:23,702 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-02-07 17:22:23,717 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-02-07 17:22:23,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:22:23,737 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 26 treesize of output 28 [2025-02-07 17:22:23,786 INFO L349 Elim1Store]: treesize reduction 48, result has 31.4 percent of original size [2025-02-07 17:22:23,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 35 treesize of output 40 [2025-02-07 17:22:23,888 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 19 treesize of output 11 [2025-02-07 17:22:23,956 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 19 treesize of output 11 [2025-02-07 17:22:24,003 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 19 treesize of output 11 [2025-02-07 17:22:24,045 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 25 treesize of output 17 [2025-02-07 17:22:24,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:22:24,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-02-07 17:22:24,156 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:22:24,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-02-07 17:22:24,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:22:24,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-02-07 17:22:24,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:22:24,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-02-07 17:22:24,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:22:24,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-02-07 17:22:24,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:22:24,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-02-07 17:22:24,419 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:22:24,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-02-07 17:22:24,469 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:22:24,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 41 [2025-02-07 17:22:24,584 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 1 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:22:24,584 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:22:26,571 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 195 treesize of output 183 [2025-02-07 17:22:26,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-07 17:22:26,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 15662 treesize of output 14382 [2025-02-07 17:22:43,718 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:22:43,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:22:43,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852268034] [2025-02-07 17:22:43,718 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-07 17:22:43,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [966166453] [2025-02-07 17:22:43,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [966166453] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:22:43,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-07 17:22:43,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 24] total 46 [2025-02-07 17:22:43,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299692117] [2025-02-07 17:22:43,718 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-07 17:22:43,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-02-07 17:22:43,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:22:43,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-02-07 17:22:43,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=265, Invalid=1804, Unknown=1, NotChecked=0, Total=2070 [2025-02-07 17:22:43,719 INFO L87 Difference]: Start difference. First operand 49 states and 54 transitions. Second operand has 46 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:22:48,870 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse63 (* 8 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse6 (select |c_#memory_int#2| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse69 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset|))) (let ((.cse55 (+ .cse63 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse2 (select (select |c_#memory_int#3| |c_ULTIMATE.start_main_~#sum~0#1.base|) |c_ULTIMATE.start_main_~#sum~0#1.offset|)) (.cse9 (select .cse6 .cse69))) (let ((.cse56 (store .cse6 .cse69 (+ .cse2 .cse9))) (.cse60 (select .cse6 .cse55))) (let ((.cse67 (* c_~N~0 8)) (.cse0 (store .cse56 .cse55 (+ .cse2 .cse60)))) (let ((.cse10 (+ |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse7 (+ 16 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse8 (+ 8 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse54 (store .cse6 .cse69 1)) (.cse49 (+ 2 |c_ULTIMATE.start_main_~i~0#1|)) (.cse61 (let ((.cse68 (+ .cse63 16 |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse68 (+ .cse2 (select .cse6 .cse68))))) (.cse1 (+ .cse2 1)) (.cse5 (select .cse6 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse64 (select .cse6 (+ (- 16) .cse67 |c_ULTIMATE.start_main_~a~0#1.offset|))) (.cse66 (select .cse6 (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset| (- 8))))) (and (= (mod (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1) 0) (= (let ((.cse3 (select .cse6 .cse8)) (.cse4 (select .cse6 .cse7))) (mod (+ .cse2 .cse3 .cse4 (* .cse5 2) 1) (+ .cse2 .cse3 .cse4 .cse5 2))) 0) (or (= (mod (+ .cse2 .cse5 .cse9) (+ .cse2 .cse9 1)) 0) (not (= .cse10 c_~N~0))) (let ((.cse11 (= |c_ULTIMATE.start_main_~i~0#1| 0))) (or (and .cse11 (= (let ((.cse12 (+ .cse2 5))) (mod .cse12 .cse12)) 0)) (let ((.cse23 (= 2 |c_ULTIMATE.start_main_~i~0#1|))) (let ((.cse18 (not .cse23)) (.cse32 (= |c_ULTIMATE.start_main_~i~0#1| 1)) (.cse17 (= .cse49 0)) (.cse14 (= .cse10 0))) (and (or (and (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse13 (* 2 v_arrayElimCell_92))) (or (= (mod (+ .cse2 .cse13 v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (mod (+ .cse2 2 .cse13 v_arrayElimCell_91) (+ .cse2 3 v_arrayElimCell_92 v_arrayElimCell_91)) 0) (= (mod (+ .cse2 3 .cse13) (+ .cse2 4 v_arrayElimCell_92)) 0)))) .cse14) (forall ((v_arrayElimCell_92 Int)) (let ((.cse15 (* 2 v_arrayElimCell_92))) (or (forall ((v_arrayElimCell_91 Int)) (or (forall ((v_arrayElimCell_90 Int)) (or (= (mod (+ .cse2 .cse15 v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (let ((.cse16 (+ .cse2 4 v_arrayElimCell_90))) (mod .cse16 .cse16)) 0))) (= (mod (+ .cse2 2 .cse15 v_arrayElimCell_91) (+ .cse2 3 v_arrayElimCell_92 v_arrayElimCell_91)) 0))) (= (mod (+ .cse2 3 .cse15) (+ .cse2 4 v_arrayElimCell_92)) 0))))) .cse17) (or (and (or (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (= (mod (+ .cse2 2 (* 2 v_arrayElimCell_92) v_arrayElimCell_91) (+ .cse2 3 v_arrayElimCell_92 v_arrayElimCell_91)) 0)) .cse18) (or (and (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (or (= (mod (+ .cse2 (* 2 v_arrayElimCell_92) v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (let ((.cse19 (+ .cse2 3 v_arrayElimCell_91 v_arrayElimCell_90))) (mod .cse19 .cse19)) 0))) .cse14) (or .cse17 (and (or .cse14 (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (= (mod (+ .cse2 (* 2 v_arrayElimCell_92) v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0))) (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (or (= (mod (+ .cse2 (* 2 v_arrayElimCell_92) v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (let ((.cse20 (+ .cse2 4 v_arrayElimCell_90))) (mod .cse20 .cse20)) 0))))) (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (or (= (mod (+ .cse2 (* 2 v_arrayElimCell_92) v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (let ((.cse21 (+ .cse2 3 v_arrayElimCell_91 v_arrayElimCell_90))) (mod .cse21 .cse21)) 0) (= (let ((.cse22 (+ .cse2 4 v_arrayElimCell_90))) (mod .cse22 .cse22)) 0)))) .cse23) (or .cse17 (and (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse24 (* 2 v_arrayElimCell_92))) (or (forall ((v_arrayElimCell_90 Int)) (or (= (mod (+ .cse2 .cse24 v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (let ((.cse25 (+ .cse2 4 v_arrayElimCell_90))) (mod .cse25 .cse25)) 0))) (= (mod (+ .cse2 2 .cse24 v_arrayElimCell_91) (+ .cse2 3 v_arrayElimCell_92 v_arrayElimCell_91)) 0)))) (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse26 (* 2 v_arrayElimCell_92))) (or (= (mod (+ .cse2 .cse26 v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (mod (+ .cse2 2 .cse26 v_arrayElimCell_91) (+ .cse2 3 v_arrayElimCell_92 v_arrayElimCell_91)) 0)))) .cse14))) (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse27 (* 2 v_arrayElimCell_92))) (or (forall ((v_arrayElimCell_90 Int)) (or (= (mod (+ .cse2 .cse27 v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (let ((.cse28 (+ .cse2 3 v_arrayElimCell_91 v_arrayElimCell_90))) (mod .cse28 .cse28)) 0) (= (let ((.cse29 (+ .cse2 4 v_arrayElimCell_90))) (mod .cse29 .cse29)) 0))) (= (mod (+ .cse2 2 .cse27 v_arrayElimCell_91) (+ .cse2 3 v_arrayElimCell_92 v_arrayElimCell_91)) 0)))) (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse30 (* 2 v_arrayElimCell_92))) (or (= (mod (+ .cse2 .cse30 v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (let ((.cse31 (+ .cse2 3 v_arrayElimCell_91 v_arrayElimCell_90))) (mod .cse31 .cse31)) 0) (= (mod (+ .cse2 2 .cse30 v_arrayElimCell_91) (+ .cse2 3 v_arrayElimCell_92 v_arrayElimCell_91)) 0)))) .cse14)) .cse32) (or (forall ((v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse33 (* 2 v_arrayElimCell_92))) (or (= (mod (+ .cse2 2 .cse33 v_arrayElimCell_91) (+ .cse2 3 v_arrayElimCell_92 v_arrayElimCell_91)) 0) (= (mod (+ .cse2 3 .cse33) (+ .cse2 4 v_arrayElimCell_92)) 0)))) .cse18) (not .cse11) (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse34 (* 2 v_arrayElimCell_92))) (or (= (mod (+ .cse2 .cse34 v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (let ((.cse35 (+ .cse2 3 v_arrayElimCell_91 v_arrayElimCell_90))) (mod .cse35 .cse35)) 0) (= (let ((.cse36 (+ .cse2 4 v_arrayElimCell_90))) (mod .cse36 .cse36)) 0) (= (mod (+ .cse2 3 .cse34) (+ .cse2 4 v_arrayElimCell_92)) 0)))) (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse37 (* 2 v_arrayElimCell_92))) (or (= (mod (+ .cse2 .cse37 v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (let ((.cse38 (+ .cse2 3 v_arrayElimCell_91 v_arrayElimCell_90))) (mod .cse38 .cse38)) 0) (= (mod (+ .cse2 2 .cse37 v_arrayElimCell_91) (+ .cse2 3 v_arrayElimCell_92 v_arrayElimCell_91)) 0) (= (mod (+ .cse2 3 .cse37) (+ .cse2 4 v_arrayElimCell_92)) 0)))) .cse14) (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int)) (= (let ((.cse39 (+ .cse2 3 v_arrayElimCell_91 v_arrayElimCell_90))) (mod .cse39 .cse39)) 0)) (not .cse17)) (or (forall ((v_arrayElimCell_92 Int)) (= (mod (+ .cse2 3 (* 2 v_arrayElimCell_92)) (+ .cse2 4 v_arrayElimCell_92)) 0)) (not .cse32)) (or (forall ((v_arrayElimCell_90 Int)) (= (let ((.cse40 (+ .cse2 4 v_arrayElimCell_90))) (mod .cse40 .cse40)) 0)) (not .cse14)) (or .cse23 (and (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse41 (* 2 v_arrayElimCell_92))) (or (= (mod (+ .cse2 .cse41 v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (let ((.cse42 (+ .cse2 3 v_arrayElimCell_91 v_arrayElimCell_90))) (mod .cse42 .cse42)) 0) (= (mod (+ .cse2 3 .cse41) (+ .cse2 4 v_arrayElimCell_92)) 0)))) .cse14) (or .cse17 (and (forall ((v_arrayElimCell_92 Int)) (let ((.cse43 (* 2 v_arrayElimCell_92))) (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int)) (or (= (mod (+ .cse2 .cse43 v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (let ((.cse44 (+ .cse2 4 v_arrayElimCell_90))) (mod .cse44 .cse44)) 0))) (= (mod (+ .cse2 3 .cse43) (+ .cse2 4 v_arrayElimCell_92)) 0)))) (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_92 Int) (v_arrayElimCell_91 Int)) (let ((.cse45 (* 2 v_arrayElimCell_92))) (or (= (mod (+ .cse2 .cse45 v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (mod (+ .cse2 3 .cse45) (+ .cse2 4 v_arrayElimCell_92)) 0)))) .cse14))) (forall ((v_arrayElimCell_92 Int)) (let ((.cse46 (* 2 v_arrayElimCell_92))) (or (forall ((v_arrayElimCell_90 Int) (v_arrayElimCell_91 Int)) (or (= (mod (+ .cse2 .cse46 v_arrayElimCell_91 v_arrayElimCell_90 1) (+ .cse2 2 v_arrayElimCell_92 v_arrayElimCell_91 v_arrayElimCell_90)) 0) (= (let ((.cse47 (+ .cse2 3 v_arrayElimCell_91 v_arrayElimCell_90))) (mod .cse47 .cse47)) 0) (= (let ((.cse48 (+ .cse2 4 v_arrayElimCell_90))) (mod .cse48 .cse48)) 0))) (= (mod (+ .cse2 3 .cse46) (+ .cse2 4 v_arrayElimCell_92)) 0))))))))))) (= (let ((.cse53 (store .cse54 .cse55 1))) (let ((.cse51 (select .cse53 .cse7)) (.cse52 (select .cse53 .cse8)) (.cse50 (select .cse53 |c_ULTIMATE.start_main_~a~0#1.offset|))) (mod (+ .cse2 (* 2 .cse50) .cse51 .cse52 1) (+ .cse2 2 .cse51 .cse52 .cse50)))) 0) (or (= (mod (+ .cse2 .cse5) .cse1) 0) (< |c_ULTIMATE.start_main_~i~0#1| c_~N~0)) (= (mod (select .cse56 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1) 0) (= (let ((.cse59 (select .cse54 |c_ULTIMATE.start_main_~a~0#1.offset|)) (.cse57 (select .cse54 .cse8)) (.cse58 (select .cse54 .cse7))) (mod (+ .cse2 .cse57 .cse58 (* .cse59 2) 1) (+ .cse2 .cse59 .cse57 .cse58 2))) 0) (or (= 0 (mod (+ .cse2 .cse60 .cse5 .cse9) (+ .cse2 .cse60 .cse9 1))) (not (= c_~N~0 .cse49))) (= (mod (select (let ((.cse62 (+ .cse63 |c_ULTIMATE.start_main_~a~0#1.offset| 24))) (store .cse61 .cse62 (+ .cse2 (select .cse6 .cse62)))) |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1) 0) (= (mod (select .cse61 |c_ULTIMATE.start_main_~a~0#1.offset|) .cse1) 0) (or (= (let ((.cse65 (select .cse6 (+ .cse67 |c_ULTIMATE.start_main_~a~0#1.offset| (- 24))))) (mod (+ .cse2 .cse5 .cse64 .cse65 .cse9 .cse66) (+ .cse2 .cse64 .cse65 .cse9 1 .cse66))) 0) (not (= c_~N~0 (+ |c_ULTIMATE.start_main_~i~0#1| 4)))) (or (not (= (+ 3 |c_ULTIMATE.start_main_~i~0#1|) c_~N~0)) (= (mod (+ .cse2 .cse5 .cse64 .cse9 .cse66) (+ .cse2 .cse64 .cse9 1 .cse66)) 0))))))))) is different from false [2025-02-07 17:22:52,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-02-07 17:22:58,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [1] [2025-02-07 17:23:05,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:23:05,264 INFO L93 Difference]: Finished difference Result 113 states and 134 transitions. [2025-02-07 17:23:05,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-02-07 17:23:05,265 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2025-02-07 17:23:05,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:23:05,265 INFO L225 Difference]: With dead ends: 113 [2025-02-07 17:23:05,266 INFO L226 Difference]: Without dead ends: 111 [2025-02-07 17:23:05,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 982 ImplicationChecksByTransitivity, 27.2s TimeCoverageRelationStatistics Valid=880, Invalid=5442, Unknown=2, NotChecked=156, Total=6480 [2025-02-07 17:23:05,268 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 203 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 121 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 41 IncrementalHoareTripleChecker+Unchecked, 11.9s IncrementalHoareTripleChecker+Time [2025-02-07 17:23:05,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 217 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 998 Invalid, 1 Unknown, 41 Unchecked, 11.9s Time] [2025-02-07 17:23:05,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2025-02-07 17:23:05,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 75. [2025-02-07 17:23:05,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.2027027027027026) internal successors, (89), 74 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:23:05,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 89 transitions. [2025-02-07 17:23:05,290 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 89 transitions. Word has length 27 [2025-02-07 17:23:05,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:23:05,291 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 89 transitions. [2025-02-07 17:23:05,291 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 46 states have (on average 1.0869565217391304) internal successors, (50), 46 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:23:05,291 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 89 transitions. [2025-02-07 17:23:05,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-07 17:23:05,291 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:23:05,292 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:23:05,300 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-07 17:23:05,492 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-07 17:23:05,492 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:23:05,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:23:05,493 INFO L85 PathProgramCache]: Analyzing trace with hash -325687207, now seen corresponding path program 11 times [2025-02-07 17:23:05,493 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:23:05,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-02-07 17:23:05,493 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:23:05,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:23:05,501 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-02-07 17:23:05,537 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 17:23:05,537 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-07 17:23:05,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:23:05,727 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-07 17:23:05,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:23:05,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366318073] [2025-02-07 17:23:05,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366318073] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:23:05,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1122149533] [2025-02-07 17:23:05,728 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-02-07 17:23:05,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:23:05,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:23:05,730 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:23:05,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-07 17:23:05,802 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 4 equivalence classes. [2025-02-07 17:23:06,059 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-02-07 17:23:06,059 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-02-07 17:23:06,059 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:23:06,062 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-02-07 17:23:06,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:23:06,126 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-07 17:23:06,127 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-07 17:23:06,194 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 10 proven. 15 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-02-07 17:23:06,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1122149533] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-07 17:23:06,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-07 17:23:06,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 18 [2025-02-07 17:23:06,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017962505] [2025-02-07 17:23:06,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-07 17:23:06,194 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-07 17:23:06,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-07 17:23:06,194 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-07 17:23:06,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2025-02-07 17:23:06,195 INFO L87 Difference]: Start difference. First operand 75 states and 89 transitions. Second operand has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:23:06,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-07 17:23:06,510 INFO L93 Difference]: Finished difference Result 164 states and 193 transitions. [2025-02-07 17:23:06,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-07 17:23:06,511 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2025-02-07 17:23:06,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-07 17:23:06,512 INFO L225 Difference]: With dead ends: 164 [2025-02-07 17:23:06,512 INFO L226 Difference]: Without dead ends: 128 [2025-02-07 17:23:06,512 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 41 SyntacticMatches, 11 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2025-02-07 17:23:06,513 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 83 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-07 17:23:06,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 131 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-07 17:23:06,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-02-07 17:23:06,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 83. [2025-02-07 17:23:06,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.1829268292682926) internal successors, (97), 82 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:23:06,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2025-02-07 17:23:06,545 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 28 [2025-02-07 17:23:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-07 17:23:06,545 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2025-02-07 17:23:06,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.5555555555555556) internal successors, (28), 18 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-07 17:23:06,545 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2025-02-07 17:23:06,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-02-07 17:23:06,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-07 17:23:06,547 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-07 17:23:06,557 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-02-07 17:23:06,748 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-02-07 17:23:06,748 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-07 17:23:06,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-07 17:23:06,749 INFO L85 PathProgramCache]: Analyzing trace with hash -644897906, now seen corresponding path program 1 times [2025-02-07 17:23:06,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-07 17:23:06,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78618881] [2025-02-07 17:23:06,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:23:06,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-07 17:23:06,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 17:23:06,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 17:23:06,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:23:06,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:23:09,482 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 1 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-07 17:23:09,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-07 17:23:09,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78618881] [2025-02-07 17:23:09,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78618881] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-07 17:23:09,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [15449690] [2025-02-07 17:23:09,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-07 17:23:09,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-07 17:23:09,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-07 17:23:09,485 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-07 17:23:09,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-07 17:23:09,558 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-02-07 17:23:09,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-02-07 17:23:09,585 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-07 17:23:09,585 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-07 17:23:09,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 87 conjuncts are in the unsatisfiable core [2025-02-07 17:23:09,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-07 17:23:09,601 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-02-07 17:23:09,609 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-02-07 17:23:09,646 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