./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array8_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-patterns/array8_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 06625eaf591a62e295090a882d83c1e11aaafca7ac8895e7d4adcf51d5b26e02 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:40:26,999 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:40:27,046 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:40:27,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:40:27,053 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:40:27,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:40:27,069 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:40:27,069 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:40:27,070 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:40:27,070 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:40:27,070 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:40:27,071 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:40:27,071 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:40:27,071 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:40:27,071 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:40:27,071 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:40:27,072 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:40:27,072 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:40:27,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:40:27,073 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:40:27,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:40:27,073 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:40:27,073 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:40:27,073 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:40:27,073 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:40:27,073 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:40:27,073 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:40:27,073 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:40:27,073 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:40:27,073 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:40:27,073 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:40:27,073 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/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 -> 06625eaf591a62e295090a882d83c1e11aaafca7ac8895e7d4adcf51d5b26e02 [2025-03-08 00:40:27,277 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:40:27,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:40:27,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:40:27,287 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:40:27,287 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:40:27,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array8_pattern.c [2025-03-08 00:40:28,414 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935a61812/7f4270f6ea6044f7aa4a24ae6875240c/FLAG825207dde [2025-03-08 00:40:28,615 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:40:28,615 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array8_pattern.c [2025-03-08 00:40:28,633 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935a61812/7f4270f6ea6044f7aa4a24ae6875240c/FLAG825207dde [2025-03-08 00:40:28,973 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/935a61812/7f4270f6ea6044f7aa4a24ae6875240c [2025-03-08 00:40:28,975 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:40:28,976 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:40:28,977 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:40:28,977 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:40:28,980 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:40:28,981 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:40:28" (1/1) ... [2025-03-08 00:40:28,983 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22da2d19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:28, skipping insertion in model container [2025-03-08 00:40:28,984 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:40:28" (1/1) ... [2025-03-08 00:40:28,994 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:40:29,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array8_pattern.c[1321,1334] [2025-03-08 00:40:29,110 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:40:29,118 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:40:29,125 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array8_pattern.c[1321,1334] [2025-03-08 00:40:29,133 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:40:29,145 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:40:29,146 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29 WrapperNode [2025-03-08 00:40:29,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:40:29,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:40:29,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:40:29,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:40:29,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (1/1) ... [2025-03-08 00:40:29,158 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (1/1) ... [2025-03-08 00:40:29,172 INFO L138 Inliner]: procedures = 16, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 76 [2025-03-08 00:40:29,173 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:40:29,174 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:40:29,174 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:40:29,174 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:40:29,179 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (1/1) ... [2025-03-08 00:40:29,179 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (1/1) ... [2025-03-08 00:40:29,180 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (1/1) ... [2025-03-08 00:40:29,193 INFO L175 MemorySlicer]: Split 9 memory accesses to 3 slices as follows [2, 4, 3]. 44 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 4 writes are split as follows [0, 2, 2]. [2025-03-08 00:40:29,193 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (1/1) ... [2025-03-08 00:40:29,193 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (1/1) ... [2025-03-08 00:40:29,196 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (1/1) ... [2025-03-08 00:40:29,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (1/1) ... [2025-03-08 00:40:29,197 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (1/1) ... [2025-03-08 00:40:29,198 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (1/1) ... [2025-03-08 00:40:29,199 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:40:29,199 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:40:29,199 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:40:29,200 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:40:29,200 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (1/1) ... [2025-03-08 00:40:29,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:40:29,213 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:29,223 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:40:29,224 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:40:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:40:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 00:40:29,239 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 00:40:29,239 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:40:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 00:40:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 00:40:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 00:40:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 00:40:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 00:40:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 00:40:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:40:29,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:40:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 00:40:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 00:40:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 00:40:29,240 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 00:40:29,291 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:40:29,292 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:40:29,425 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: call ULTIMATE.dealloc(main_~#array1~0#1.base, main_~#array1~0#1.offset);havoc main_~#array1~0#1.base, main_~#array1~0#1.offset;call ULTIMATE.dealloc(main_~#array2~0#1.base, main_~#array2~0#1.offset);havoc main_~#array2~0#1.base, main_~#array2~0#1.offset; [2025-03-08 00:40:29,433 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2025-03-08 00:40:29,434 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:40:29,439 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:40:29,439 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:40:29,440 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:40:29 BoogieIcfgContainer [2025-03-08 00:40:29,440 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:40:29,442 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:40:29,442 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:40:29,445 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:40:29,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:40:28" (1/3) ... [2025-03-08 00:40:29,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c11665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:40:29, skipping insertion in model container [2025-03-08 00:40:29,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:40:29" (2/3) ... [2025-03-08 00:40:29,446 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73c11665 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:40:29, skipping insertion in model container [2025-03-08 00:40:29,446 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:40:29" (3/3) ... [2025-03-08 00:40:29,447 INFO L128 eAbstractionObserver]: Analyzing ICFG array8_pattern.c [2025-03-08 00:40:29,456 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:40:29,457 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array8_pattern.c that has 2 procedures, 24 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-08 00:40:29,488 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:40:29,497 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;@60cf7c2c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:40:29,497 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:40:29,499 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:29,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-08 00:40:29,503 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:29,504 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:29,504 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:29,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:29,508 INFO L85 PathProgramCache]: Analyzing trace with hash 1079372888, now seen corresponding path program 1 times [2025-03-08 00:40:29,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:29,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339163534] [2025-03-08 00:40:29,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:40:29,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:29,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-08 00:40:29,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-08 00:40:29,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:29,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:29,617 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:40:29,618 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:29,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339163534] [2025-03-08 00:40:29,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339163534] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:40:29,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:40:29,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:40:29,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515973198] [2025-03-08 00:40:29,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:40:29,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 00:40:29,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:29,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 00:40:29,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 00:40:29,636 INFO L87 Difference]: Start difference. First operand has 24 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 00:40:29,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:29,645 INFO L93 Difference]: Finished difference Result 45 states and 60 transitions. [2025-03-08 00:40:29,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 00:40:29,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-08 00:40:29,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:29,649 INFO L225 Difference]: With dead ends: 45 [2025-03-08 00:40:29,649 INFO L226 Difference]: Without dead ends: 20 [2025-03-08 00:40:29,653 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-03-08 00:40:29,656 INFO L435 NwaCegarLoop]: 28 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, 28 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-03-08 00:40:29,657 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:40:29,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-08 00:40:29,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-08 00:40:29,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 16 states have (on average 1.25) internal successors, (20), 16 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:29,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-08 00:40:29,680 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2025-03-08 00:40:29,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:29,681 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-08 00:40:29,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-08 00:40:29,681 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-08 00:40:29,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 00:40:29,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:29,682 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:29,682 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:40:29,682 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:29,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:29,682 INFO L85 PathProgramCache]: Analyzing trace with hash -120524069, now seen corresponding path program 1 times [2025-03-08 00:40:29,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:29,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [796325861] [2025-03-08 00:40:29,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:40:29,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:29,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:40:29,723 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:40:29,724 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:29,724 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:29,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:40:30,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:30,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [796325861] [2025-03-08 00:40:30,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [796325861] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:40:30,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [528626941] [2025-03-08 00:40:30,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:40:30,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:30,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:30,003 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:30,005 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:40:30,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 00:40:30,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 00:40:30,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:30,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:30,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 00:40:30,071 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:30,142 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:40:30,142 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:40:30,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [528626941] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:40:30,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:40:30,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2025-03-08 00:40:30,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564659695] [2025-03-08 00:40:30,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:40:30,144 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 00:40:30,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:30,145 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 00:40:30,146 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:40:30,147 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:30,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:30,224 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2025-03-08 00:40:30,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 00:40:30,225 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2025-03-08 00:40:30,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:30,225 INFO L225 Difference]: With dead ends: 46 [2025-03-08 00:40:30,225 INFO L226 Difference]: Without dead ends: 25 [2025-03-08 00:40:30,226 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:40:30,226 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 2 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:40:30,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 81 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:40:30,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-08 00:40:30,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 21. [2025-03-08 00:40:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:30,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2025-03-08 00:40:30,231 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 23 [2025-03-08 00:40:30,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:30,232 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2025-03-08 00:40:30,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.1666666666666665) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:30,234 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2025-03-08 00:40:30,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-08 00:40:30,235 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:30,236 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:30,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:40:30,440 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:30,440 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:30,441 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:30,441 INFO L85 PathProgramCache]: Analyzing trace with hash -141643144, now seen corresponding path program 1 times [2025-03-08 00:40:30,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:30,441 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634742881] [2025-03-08 00:40:30,441 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:40:30,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:30,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:40:30,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:40:30,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:30,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:30,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:40:30,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:30,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634742881] [2025-03-08 00:40:30,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634742881] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:40:30,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2070776081] [2025-03-08 00:40:30,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:40:30,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:30,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:30,595 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:30,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:40:30,631 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-08 00:40:30,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-08 00:40:30,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:30,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:30,650 INFO L256 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-08 00:40:30,651 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:30,700 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:40:30,701 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:40:30,749 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:40:30,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2070776081] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:40:30,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:40:30,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 00:40:30,751 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990170827] [2025-03-08 00:40:30,751 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:40:30,751 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 00:40:30,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:30,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 00:40:30,752 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-08 00:40:30,753 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:40:30,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:30,830 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2025-03-08 00:40:30,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:40:30,831 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 24 [2025-03-08 00:40:30,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:30,831 INFO L225 Difference]: With dead ends: 29 [2025-03-08 00:40:30,831 INFO L226 Difference]: Without dead ends: 26 [2025-03-08 00:40:30,832 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:40:30,832 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 15 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:40:30,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 92 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:40:30,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2025-03-08 00:40:30,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2025-03-08 00:40:30,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:30,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2025-03-08 00:40:30,838 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2025-03-08 00:40:30,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:30,838 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2025-03-08 00:40:30,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 9 states have internal predecessors, (33), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:40:30,839 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2025-03-08 00:40:30,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-08 00:40:30,839 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:30,839 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:30,845 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:40:31,044 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 00:40:31,045 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:31,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:31,045 INFO L85 PathProgramCache]: Analyzing trace with hash -95938415, now seen corresponding path program 1 times [2025-03-08 00:40:31,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:31,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982444501] [2025-03-08 00:40:31,046 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:40:31,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:31,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:40:31,073 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:40:31,074 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:31,074 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:40:31,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744082266] [2025-03-08 00:40:31,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:40:31,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:31,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:31,079 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:31,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:40:31,116 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-08 00:40:31,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-08 00:40:31,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:31,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:31,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-08 00:40:31,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:31,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:40:31,470 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-03-08 00:40:31,604 INFO L349 Elim1Store]: treesize reduction 16, result has 55.6 percent of original size [2025-03-08 00:40:31,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 33 [2025-03-08 00:40:31,731 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 17 treesize of output 9 [2025-03-08 00:40:31,763 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:40:31,763 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:40:31,894 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 33 treesize of output 31 [2025-03-08 00:40:31,901 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 49 [2025-03-08 00:40:32,179 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 35 treesize of output 33 [2025-03-08 00:40:32,185 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 49 [2025-03-08 00:40:32,248 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 00:40:32,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:32,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982444501] [2025-03-08 00:40:32,250 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:40:32,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744082266] [2025-03-08 00:40:32,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744082266] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:40:32,250 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 00:40:32,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13] total 29 [2025-03-08 00:40:32,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308798408] [2025-03-08 00:40:32,250 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 00:40:32,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-08 00:40:32,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:32,251 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-08 00:40:32,252 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=686, Unknown=0, NotChecked=0, Total=812 [2025-03-08 00:40:32,253 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 29 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:40:32,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:32,814 INFO L93 Difference]: Finished difference Result 67 states and 78 transitions. [2025-03-08 00:40:32,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-08 00:40:32,814 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 25 [2025-03-08 00:40:32,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:32,815 INFO L225 Difference]: With dead ends: 67 [2025-03-08 00:40:32,815 INFO L226 Difference]: Without dead ends: 50 [2025-03-08 00:40:32,816 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 1 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 493 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=339, Invalid=1553, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 00:40:32,817 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 57 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:40:32,817 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 192 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:40:32,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2025-03-08 00:40:32,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 39. [2025-03-08 00:40:32,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.1875) internal successors, (38), 32 states have internal predecessors, (38), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:40:32,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2025-03-08 00:40:32,823 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 25 [2025-03-08 00:40:32,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:32,823 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2025-03-08 00:40:32,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.3448275862068966) internal successors, (39), 25 states have internal predecessors, (39), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-08 00:40:32,823 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2025-03-08 00:40:32,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:40:32,824 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:32,824 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:32,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:40:33,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:33,028 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:33,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:33,029 INFO L85 PathProgramCache]: Analyzing trace with hash 1320908184, now seen corresponding path program 2 times [2025-03-08 00:40:33,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:33,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010639839] [2025-03-08 00:40:33,029 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:40:33,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:33,035 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 00:40:33,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:40:33,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:40:33,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:33,113 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:40:33,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010639839] [2025-03-08 00:40:33,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010639839] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:40:33,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864784557] [2025-03-08 00:40:33,114 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:40:33,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:33,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:33,116 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:33,118 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 00:40:33,148 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 26 statements into 2 equivalence classes. [2025-03-08 00:40:33,162 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:40:33,162 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:40:33,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:33,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:40:33,164 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:33,203 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:40:33,204 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:40:33,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:40:33,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864784557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:40:33,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:40:33,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:40:33,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239803243] [2025-03-08 00:40:33,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:40:33,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:40:33,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:33,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:40:33,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:40:33,243 INFO L87 Difference]: Start difference. First operand 39 states and 44 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:40:33,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:33,293 INFO L93 Difference]: Finished difference Result 48 states and 53 transitions. [2025-03-08 00:40:33,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 00:40:33,294 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-08 00:40:33,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:33,294 INFO L225 Difference]: With dead ends: 48 [2025-03-08 00:40:33,294 INFO L226 Difference]: Without dead ends: 31 [2025-03-08 00:40:33,294 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 45 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:40:33,295 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:40:33,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 74 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:40:33,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-08 00:40:33,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 27. [2025-03-08 00:40:33,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:33,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 30 transitions. [2025-03-08 00:40:33,301 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 30 transitions. Word has length 26 [2025-03-08 00:40:33,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:33,301 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 30 transitions. [2025-03-08 00:40:33,302 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:40:33,302 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 30 transitions. [2025-03-08 00:40:33,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-08 00:40:33,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:33,302 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:33,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 00:40:33,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:33,507 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:33,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:33,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1083466990, now seen corresponding path program 3 times [2025-03-08 00:40:33,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:33,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162462782] [2025-03-08 00:40:33,507 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:40:33,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:33,513 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-08 00:40:33,526 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:40:33,526 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:40:33,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:33,584 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:40:33,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:33,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [162462782] [2025-03-08 00:40:33,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [162462782] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:40:33,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [618249618] [2025-03-08 00:40:33,584 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:40:33,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:33,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:33,587 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:33,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 00:40:33,625 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 26 statements into 3 equivalence classes. [2025-03-08 00:40:33,639 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 26 of 26 statements. [2025-03-08 00:40:33,639 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-08 00:40:33,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:33,640 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 00:40:33,641 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:33,683 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:40:33,683 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:40:33,723 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:40:33,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [618249618] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:40:33,723 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:40:33,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-08 00:40:33,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919179366] [2025-03-08 00:40:33,723 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:40:33,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-08 00:40:33,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:33,724 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-08 00:40:33,724 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-08 00:40:33,724 INFO L87 Difference]: Start difference. First operand 27 states and 30 transitions. Second operand has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:40:33,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:33,771 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2025-03-08 00:40:33,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 00:40:33,771 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-08 00:40:33,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:33,772 INFO L225 Difference]: With dead ends: 31 [2025-03-08 00:40:33,772 INFO L226 Difference]: Without dead ends: 28 [2025-03-08 00:40:33,772 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 44 SyntacticMatches, 4 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-08 00:40:33,773 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:40:33,773 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 79 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:40:33,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-08 00:40:33,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-08 00:40:33,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:33,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-03-08 00:40:33,776 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 26 [2025-03-08 00:40:33,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:33,777 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-03-08 00:40:33,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 11 states have internal predecessors, (29), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:40:33,777 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-03-08 00:40:33,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:40:33,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:33,777 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:33,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 00:40:33,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:33,978 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:33,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:33,978 INFO L85 PathProgramCache]: Analyzing trace with hash -772229925, now seen corresponding path program 4 times [2025-03-08 00:40:33,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:33,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900409720] [2025-03-08 00:40:33,978 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:40:33,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:33,983 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-08 00:40:34,004 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:40:34,004 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:40:34,004 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:40:34,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2044936715] [2025-03-08 00:40:34,005 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-08 00:40:34,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:34,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:34,009 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:34,012 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 00:40:34,043 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 27 statements into 2 equivalence classes. [2025-03-08 00:40:34,060 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:40:34,060 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-08 00:40:34,060 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:34,061 INFO L256 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 56 conjuncts are in the unsatisfiable core [2025-03-08 00:40:34,064 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:34,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:40:34,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:40:34,168 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 23 treesize of output 11 [2025-03-08 00:40:34,176 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 23 treesize of output 11 [2025-03-08 00:40:34,386 INFO L349 Elim1Store]: treesize reduction 24, result has 48.9 percent of original size [2025-03-08 00:40:34,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 38 [2025-03-08 00:40:34,544 INFO L349 Elim1Store]: treesize reduction 48, result has 23.8 percent of original size [2025-03-08 00:40:34,544 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 34 treesize of output 30 [2025-03-08 00:40:34,800 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:40:34,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 22 [2025-03-08 00:40:34,812 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:40:34,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 45 [2025-03-08 00:40:34,853 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:40:34,853 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:40:35,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:35,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900409720] [2025-03-08 00:40:35,055 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:40:35,055 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2044936715] [2025-03-08 00:40:35,055 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2044936715] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:40:35,055 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:40:35,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17] total 17 [2025-03-08 00:40:35,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575074994] [2025-03-08 00:40:35,055 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:40:35,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:40:35,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:35,055 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:40:35,056 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=453, Unknown=0, NotChecked=0, Total=552 [2025-03-08 00:40:35,056 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:35,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:35,432 INFO L93 Difference]: Finished difference Result 58 states and 68 transitions. [2025-03-08 00:40:35,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 00:40:35,434 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-08 00:40:35,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:35,435 INFO L225 Difference]: With dead ends: 58 [2025-03-08 00:40:35,435 INFO L226 Difference]: Without dead ends: 55 [2025-03-08 00:40:35,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=159, Invalid=833, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:40:35,436 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 46 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:40:35,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 115 Invalid, 224 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:40:35,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2025-03-08 00:40:35,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 41. [2025-03-08 00:40:35,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 00:40:35,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2025-03-08 00:40:35,445 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 27 [2025-03-08 00:40:35,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:35,446 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2025-03-08 00:40:35,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 16 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:35,446 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2025-03-08 00:40:35,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-08 00:40:35,446 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:35,446 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:35,469 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 00:40:35,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:35,647 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:35,648 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:35,648 INFO L85 PathProgramCache]: Analyzing trace with hash 1715282908, now seen corresponding path program 1 times [2025-03-08 00:40:35,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:35,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977959466] [2025-03-08 00:40:35,648 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:40:35,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:35,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:40:35,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:40:35,671 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:35,671 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:40:35,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [651929650] [2025-03-08 00:40:35,672 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:40:35,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:35,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:35,674 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:35,679 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 00:40:35,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-08 00:40:35,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-08 00:40:35,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:35,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:35,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-08 00:40:35,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:35,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:40:35,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:40:35,841 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 23 treesize of output 11 [2025-03-08 00:40:35,855 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 23 treesize of output 11 [2025-03-08 00:40:36,189 INFO L349 Elim1Store]: treesize reduction 64, result has 48.8 percent of original size [2025-03-08 00:40:36,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 10 case distinctions, treesize of input 42 treesize of output 82 [2025-03-08 00:40:36,800 INFO L349 Elim1Store]: treesize reduction 88, result has 40.9 percent of original size [2025-03-08 00:40:36,800 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 48 treesize of output 73 [2025-03-08 00:40:38,025 INFO L349 Elim1Store]: treesize reduction 288, result has 44.7 percent of original size [2025-03-08 00:40:38,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 1 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 280 treesize of output 402 [2025-03-08 00:40:38,076 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:40:38,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 184 treesize of output 214 [2025-03-08 00:40:51,319 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:40:51,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:40:51,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:51,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977959466] [2025-03-08 00:40:51,762 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:40:51,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651929650] [2025-03-08 00:40:51,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651929650] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:40:51,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:40:51,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2025-03-08 00:40:51,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514376333] [2025-03-08 00:40:51,762 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:40:51,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 00:40:51,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:51,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 00:40:51,763 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=680, Unknown=0, NotChecked=0, Total=812 [2025-03-08 00:40:51,763 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 20 states, 20 states have (on average 1.15) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:52,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:52,343 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2025-03-08 00:40:52,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:40:52,344 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2025-03-08 00:40:52,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:52,344 INFO L225 Difference]: With dead ends: 63 [2025-03-08 00:40:52,344 INFO L226 Difference]: Without dead ends: 60 [2025-03-08 00:40:52,345 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=187, Invalid=1003, Unknown=0, NotChecked=0, Total=1190 [2025-03-08 00:40:52,345 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:40:52,346 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 152 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:40:52,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-08 00:40:52,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 49. [2025-03-08 00:40:52,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 40 states have (on average 1.2) internal successors, (48), 40 states have internal predecessors, (48), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 00:40:52,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-03-08 00:40:52,357 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 27 [2025-03-08 00:40:52,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:52,359 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-03-08 00:40:52,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 1.15) internal successors, (23), 17 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:52,359 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-03-08 00:40:52,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:40:52,360 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:52,360 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:52,367 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-08 00:40:52,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:52,561 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:52,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:52,561 INFO L85 PathProgramCache]: Analyzing trace with hash 1830707854, now seen corresponding path program 5 times [2025-03-08 00:40:52,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:52,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071046473] [2025-03-08 00:40:52,561 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:40:52,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:52,570 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-08 00:40:52,577 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:40:52,577 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:40:52,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:52,657 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:40:52,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:52,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071046473] [2025-03-08 00:40:52,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071046473] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:40:52,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1691605215] [2025-03-08 00:40:52,658 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-08 00:40:52,658 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:52,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:52,660 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:52,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 00:40:52,710 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 28 statements into 3 equivalence classes. [2025-03-08 00:40:52,726 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:40:52,726 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2025-03-08 00:40:52,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:52,727 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:40:52,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:52,772 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:40:52,772 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:40:52,811 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:40:52,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1691605215] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:40:52,811 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:40:52,811 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 12 [2025-03-08 00:40:52,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243821254] [2025-03-08 00:40:52,811 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:40:52,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 00:40:52,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:52,812 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 00:40:52,812 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2025-03-08 00:40:52,812 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:40:52,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:52,881 INFO L93 Difference]: Finished difference Result 79 states and 90 transitions. [2025-03-08 00:40:52,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-08 00:40:52,882 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-03-08 00:40:52,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:52,883 INFO L225 Difference]: With dead ends: 79 [2025-03-08 00:40:52,883 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 00:40:52,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 47 SyntacticMatches, 6 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-08 00:40:52,884 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 39 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 00:40:52,884 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 82 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 00:40:52,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 00:40:52,895 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 65. [2025-03-08 00:40:52,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 54 states have (on average 1.1851851851851851) internal successors, (64), 54 states have internal predecessors, (64), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:40:52,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 74 transitions. [2025-03-08 00:40:52,897 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 74 transitions. Word has length 28 [2025-03-08 00:40:52,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:52,897 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 74 transitions. [2025-03-08 00:40:52,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 12 states have internal predecessors, (28), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:40:52,897 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 74 transitions. [2025-03-08 00:40:52,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-08 00:40:52,899 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:52,899 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:52,905 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 00:40:53,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-08 00:40:53,100 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:53,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:53,100 INFO L85 PathProgramCache]: Analyzing trace with hash -1235001864, now seen corresponding path program 6 times [2025-03-08 00:40:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:53,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457437848] [2025-03-08 00:40:53,100 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:40:53,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:53,106 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-03-08 00:40:53,127 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:40:53,127 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 00:40:53,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:53,215 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:40:53,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:53,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457437848] [2025-03-08 00:40:53,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457437848] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:40:53,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237270879] [2025-03-08 00:40:53,215 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-08 00:40:53,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:53,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:53,217 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:53,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-08 00:40:53,255 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 28 statements into 4 equivalence classes. [2025-03-08 00:40:53,278 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-08 00:40:53,278 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2025-03-08 00:40:53,278 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:53,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 00:40:53,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:53,319 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:40:53,319 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:40:53,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:40:53,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237270879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:40:53,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:40:53,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-08 00:40:53,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731659974] [2025-03-08 00:40:53,357 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:40:53,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-08 00:40:53,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:53,357 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-08 00:40:53,357 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-08 00:40:53,357 INFO L87 Difference]: Start difference. First operand 65 states and 74 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:40:53,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:53,446 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2025-03-08 00:40:53,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-08 00:40:53,447 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2025-03-08 00:40:53,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:53,447 INFO L225 Difference]: With dead ends: 74 [2025-03-08 00:40:53,447 INFO L226 Difference]: Without dead ends: 71 [2025-03-08 00:40:53,448 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=195, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:40:53,448 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 44 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:40:53,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 117 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:40:53,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-03-08 00:40:53,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 54. [2025-03-08 00:40:53,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1777777777777778) internal successors, (53), 45 states have internal predecessors, (53), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-08 00:40:53,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 61 transitions. [2025-03-08 00:40:53,458 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 61 transitions. Word has length 28 [2025-03-08 00:40:53,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:53,458 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 61 transitions. [2025-03-08 00:40:53,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 14 states have internal predecessors, (32), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:40:53,458 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 61 transitions. [2025-03-08 00:40:53,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:40:53,458 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:53,458 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:53,464 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-08 00:40:53,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 00:40:53,659 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:53,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:53,659 INFO L85 PathProgramCache]: Analyzing trace with hash 369679633, now seen corresponding path program 7 times [2025-03-08 00:40:53,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:53,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012812269] [2025-03-08 00:40:53,660 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:40:53,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:53,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:40:53,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:40:53,691 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:53,691 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:40:53,692 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1497627985] [2025-03-08 00:40:53,692 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-08 00:40:53,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:53,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:53,700 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:53,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-08 00:40:53,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-08 00:40:53,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:40:53,752 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:40:53,752 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:53,753 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 60 conjuncts are in the unsatisfiable core [2025-03-08 00:40:53,756 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:53,801 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:40:53,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:40:53,834 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 23 treesize of output 11 [2025-03-08 00:40:53,847 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 23 treesize of output 11 [2025-03-08 00:40:53,882 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 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:40:53,891 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 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:40:54,108 INFO L349 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2025-03-08 00:40:54,109 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 52 [2025-03-08 00:40:54,276 INFO L349 Elim1Store]: treesize reduction 54, result has 51.8 percent of original size [2025-03-08 00:40:54,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 9 case distinctions, treesize of input 56 treesize of output 76 [2025-03-08 00:40:54,969 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:40:54,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 224 treesize of output 182 [2025-03-08 00:40:54,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:40:54,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 158 treesize of output 150 [2025-03-08 00:40:55,300 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 1 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:40:55,301 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:40:55,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:40:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012812269] [2025-03-08 00:40:55,546 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:40:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497627985] [2025-03-08 00:40:55,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497627985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:40:55,547 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:40:55,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2025-03-08 00:40:55,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510219224] [2025-03-08 00:40:55,547 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:40:55,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-03-08 00:40:55,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:40:55,547 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-03-08 00:40:55,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=589, Unknown=0, NotChecked=0, Total=702 [2025-03-08 00:40:55,548 INFO L87 Difference]: Start difference. First operand 54 states and 61 transitions. Second operand has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:55,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:40:55,970 INFO L93 Difference]: Finished difference Result 76 states and 86 transitions. [2025-03-08 00:40:55,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-03-08 00:40:55,970 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-08 00:40:55,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:40:55,971 INFO L225 Difference]: With dead ends: 76 [2025-03-08 00:40:55,971 INFO L226 Difference]: Without dead ends: 73 [2025-03-08 00:40:55,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 13 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2025-03-08 00:40:55,972 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 34 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 418 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:40:55,972 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 214 Invalid, 418 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:40:55,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2025-03-08 00:40:55,983 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2025-03-08 00:40:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:40:55,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-03-08 00:40:55,984 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 29 [2025-03-08 00:40:55,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:40:55,984 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-03-08 00:40:55,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 18 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:40:55,985 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-03-08 00:40:55,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-08 00:40:55,985 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:40:55,986 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:40:55,993 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-08 00:40:56,186 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-08 00:40:56,186 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:40:56,186 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:40:56,187 INFO L85 PathProgramCache]: Analyzing trace with hash 173166128, now seen corresponding path program 2 times [2025-03-08 00:40:56,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:40:56,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110527531] [2025-03-08 00:40:56,187 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:40:56,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:40:56,191 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 00:40:56,211 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:40:56,211 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:40:56,211 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:40:56,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [578157190] [2025-03-08 00:40:56,212 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:40:56,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:40:56,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:40:56,216 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:40:56,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-08 00:40:56,254 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-08 00:40:56,267 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-08 00:40:56,267 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:40:56,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:40:56,268 INFO L256 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-08 00:40:56,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:40:56,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:40:56,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:40:56,316 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 23 treesize of output 11 [2025-03-08 00:40:56,320 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 23 treesize of output 11 [2025-03-08 00:40:56,350 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 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:40:56,359 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 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:40:56,549 INFO L349 Elim1Store]: treesize reduction 36, result has 48.6 percent of original size [2025-03-08 00:40:56,550 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 52 [2025-03-08 00:40:56,699 INFO L349 Elim1Store]: treesize reduction 54, result has 38.6 percent of original size [2025-03-08 00:40:56,699 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 41 treesize of output 43 [2025-03-08 00:40:57,226 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:40:57,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 202 treesize of output 168 [2025-03-08 00:40:57,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:40:57,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 141 treesize of output 111 [2025-03-08 00:40:57,644 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:40:57,645 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:02,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:02,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110527531] [2025-03-08 00:41:02,965 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:41:02,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [578157190] [2025-03-08 00:41:02,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [578157190] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:02,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:41:02,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2025-03-08 00:41:02,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104895249] [2025-03-08 00:41:02,965 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:02,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-08 00:41:02,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:02,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-08 00:41:02,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=455, Unknown=1, NotChecked=0, Total=552 [2025-03-08 00:41:02,966 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 16 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:41:03,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:03,360 INFO L93 Difference]: Finished difference Result 80 states and 91 transitions. [2025-03-08 00:41:03,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-08 00:41:03,362 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 29 [2025-03-08 00:41:03,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:03,362 INFO L225 Difference]: With dead ends: 80 [2025-03-08 00:41:03,362 INFO L226 Difference]: Without dead ends: 77 [2025-03-08 00:41:03,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 5.7s TimeCoverageRelationStatistics Valid=133, Invalid=568, Unknown=1, NotChecked=0, Total=702 [2025-03-08 00:41:03,363 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 315 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:03,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 224 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 315 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:41:03,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-08 00:41:03,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 66. [2025-03-08 00:41:03,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 55 states have (on average 1.1818181818181819) internal successors, (65), 55 states have internal predecessors, (65), 5 states have call successors, (5), 5 states have call predecessors, (5), 5 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-08 00:41:03,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-03-08 00:41:03,375 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 29 [2025-03-08 00:41:03,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:03,375 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-03-08 00:41:03,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.5625) internal successors, (25), 16 states have internal predecessors, (25), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:41:03,375 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-03-08 00:41:03,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-08 00:41:03,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:03,375 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:03,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-03-08 00:41:03,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:41:03,576 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:03,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:03,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1424801512, now seen corresponding path program 8 times [2025-03-08 00:41:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:03,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327019102] [2025-03-08 00:41:03,576 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:03,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:03,581 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-08 00:41:03,589 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:41:03,589 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:03,589 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:41:03,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:03,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327019102] [2025-03-08 00:41:03,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327019102] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:03,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4296161] [2025-03-08 00:41:03,708 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 00:41:03,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:03,708 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:03,710 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:41:03,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-08 00:41:03,751 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 30 statements into 2 equivalence classes. [2025-03-08 00:41:03,768 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 30 of 30 statements. [2025-03-08 00:41:03,769 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 00:41:03,769 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:03,770 INFO L256 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-08 00:41:03,771 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:03,829 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:03,829 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:03,878 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-08 00:41:03,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4296161] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 00:41:03,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 00:41:03,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 17 [2025-03-08 00:41:03,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [348234806] [2025-03-08 00:41:03,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:03,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-08 00:41:03,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:03,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-08 00:41:03,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=197, Unknown=0, NotChecked=0, Total=272 [2025-03-08 00:41:03,879 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:41:03,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:03,995 INFO L93 Difference]: Finished difference Result 108 states and 123 transitions. [2025-03-08 00:41:03,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 00:41:03,995 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2025-03-08 00:41:03,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:03,996 INFO L225 Difference]: With dead ends: 108 [2025-03-08 00:41:03,996 INFO L226 Difference]: Without dead ends: 99 [2025-03-08 00:41:03,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 47 SyntacticMatches, 7 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=145, Invalid=361, Unknown=0, NotChecked=0, Total=506 [2025-03-08 00:41:03,996 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 44 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:03,996 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [45 Valid, 177 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 00:41:03,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-03-08 00:41:04,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 89. [2025-03-08 00:41:04,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 74 states have (on average 1.1891891891891893) internal successors, (88), 74 states have internal predecessors, (88), 7 states have call successors, (7), 7 states have call predecessors, (7), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2025-03-08 00:41:04,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 102 transitions. [2025-03-08 00:41:04,013 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 102 transitions. Word has length 30 [2025-03-08 00:41:04,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:04,013 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 102 transitions. [2025-03-08 00:41:04,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 17 states have internal predecessors, (35), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-08 00:41:04,013 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 102 transitions. [2025-03-08 00:41:04,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:41:04,014 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:04,014 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:04,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-08 00:41:04,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-08 00:41:04,214 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:04,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:04,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1018616101, now seen corresponding path program 9 times [2025-03-08 00:41:04,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:04,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006436689] [2025-03-08 00:41:04,215 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:41:04,215 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:04,220 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-03-08 00:41:04,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:41:04,244 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:41:04,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:41:04,245 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472776049] [2025-03-08 00:41:04,245 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:41:04,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:04,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:04,247 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:41:04,248 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-08 00:41:04,291 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-03-08 00:41:04,326 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:41:04,326 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:41:04,327 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:04,332 WARN L254 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 90 conjuncts are in the unsatisfiable core [2025-03-08 00:41:04,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:04,349 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 18 treesize of output 16 [2025-03-08 00:41:04,371 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-03-08 00:41:04,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:41:04,400 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-03-08 00:41:04,407 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 23 treesize of output 11 [2025-03-08 00:41:04,443 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 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:41:04,453 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 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:41:04,494 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:41:04,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-08 00:41:04,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-08 00:41:04,947 INFO L349 Elim1Store]: treesize reduction 128, result has 48.6 percent of original size [2025-03-08 00:41:04,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 70 treesize of output 154 [2025-03-08 00:41:05,410 INFO L349 Elim1Store]: treesize reduction 272, result has 17.3 percent of original size [2025-03-08 00:41:05,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 76 treesize of output 90 [2025-03-08 00:41:06,154 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:41:06,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 129 treesize of output 61 [2025-03-08 00:41:06,166 INFO L349 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2025-03-08 00:41:06,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 69 treesize of output 41 [2025-03-08 00:41:06,212 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:41:06,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 00:41:06,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:41:06,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006436689] [2025-03-08 00:41:06,637 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-08 00:41:06,637 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472776049] [2025-03-08 00:41:06,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472776049] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:41:06,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:41:06,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24] total 24 [2025-03-08 00:41:06,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173540034] [2025-03-08 00:41:06,638 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-08 00:41:06,638 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-08 00:41:06,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:41:06,638 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-08 00:41:06,638 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2025-03-08 00:41:06,639 INFO L87 Difference]: Start difference. First operand 89 states and 102 transitions. Second operand has 24 states, 24 states have (on average 1.125) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:41:07,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:41:07,196 INFO L93 Difference]: Finished difference Result 115 states and 133 transitions. [2025-03-08 00:41:07,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-08 00:41:07,197 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2025-03-08 00:41:07,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:41:07,197 INFO L225 Difference]: With dead ends: 115 [2025-03-08 00:41:07,197 INFO L226 Difference]: Without dead ends: 104 [2025-03-08 00:41:07,198 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 10 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 381 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=186, Invalid=1146, Unknown=0, NotChecked=0, Total=1332 [2025-03-08 00:41:07,198 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 26 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:41:07,198 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 260 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:41:07,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-08 00:41:07,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 100. [2025-03-08 00:41:07,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 83 states have (on average 1.1927710843373494) internal successors, (99), 83 states have internal predecessors, (99), 8 states have call successors, (8), 8 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-08 00:41:07,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 115 transitions. [2025-03-08 00:41:07,216 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 115 transitions. Word has length 31 [2025-03-08 00:41:07,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:41:07,217 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 115 transitions. [2025-03-08 00:41:07,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.125) internal successors, (27), 21 states have internal predecessors, (27), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-08 00:41:07,217 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 115 transitions. [2025-03-08 00:41:07,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 00:41:07,217 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:41:07,217 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:41:07,224 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-08 00:41:07,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-08 00:41:07,420 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:41:07,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:41:07,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1479399836, now seen corresponding path program 3 times [2025-03-08 00:41:07,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:41:07,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [286771434] [2025-03-08 00:41:07,421 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:41:07,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:41:07,430 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-03-08 00:41:07,492 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:41:07,492 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:41:07,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-08 00:41:07,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2022832071] [2025-03-08 00:41:07,493 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-08 00:41:07,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:41:07,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:41:07,495 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:41:07,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-08 00:41:07,549 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 4 equivalence classes. [2025-03-08 00:41:07,575 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 00:41:07,575 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-08 00:41:07,575 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:41:07,576 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 82 conjuncts are in the unsatisfiable core [2025-03-08 00:41:07,579 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:41:07,616 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:41:07,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-08 00:41:07,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 23 treesize of output 11 [2025-03-08 00:41:07,650 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 23 treesize of output 11 [2025-03-08 00:41:07,688 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 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:41:07,696 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 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-08 00:41:07,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:07,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:07,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:07,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2025-03-08 00:41:07,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:07,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:07,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:07,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 31 [2025-03-08 00:41:08,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:08,141 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:08,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:08,233 INFO L349 Elim1Store]: treesize reduction 142, result has 48.0 percent of original size [2025-03-08 00:41:08,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 36 case distinctions, treesize of input 78 treesize of output 164 [2025-03-08 00:41:08,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:08,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:08,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:08,571 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:08,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:08,623 INFO L349 Elim1Store]: treesize reduction 118, result has 37.6 percent of original size [2025-03-08 00:41:08,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 8 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 26 case distinctions, treesize of input 84 treesize of output 123 [2025-03-08 00:41:10,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:10,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:10,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:11,047 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 00:41:11,048 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 9 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 477 treesize of output 721 [2025-03-08 00:41:11,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:11,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:11,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 00:41:11,833 INFO L349 Elim1Store]: treesize reduction 544, result has 45.0 percent of original size [2025-03-08 00:41:11,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 17 select indices, 17 select index equivalence classes, 9 disjoint index pairs (out of 136 index pairs), introduced 17 new quantified variables, introduced 136 case distinctions, treesize of input 392 treesize of output 688