./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array7_pattern.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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/array7_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 85b55cdd1f26353e63ecc189ba28ba899672edc569fe3ef3f04470f2b5e667fa --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 13:49:46,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 13:49:46,238 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 13:49:46,244 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 13:49:46,244 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 13:49:46,257 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 13:49:46,257 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 13:49:46,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 13:49:46,258 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 13:49:46,258 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 13:49:46,258 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 13:49:46,258 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 13:49:46,259 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 13:49:46,259 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 13:49:46,260 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 13:49:46,260 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 13:49:46,260 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 13:49:46,260 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 13:49:46,260 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 13:49:46,260 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 13:49:46,260 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 13:49:46,260 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 13:49:46,260 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 13:49:46,260 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 13:49:46,260 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 13:49:46,261 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 13:49:46,261 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 13:49:46,261 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 13:49:46,261 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 13:49:46,261 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 13:49:46,261 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 13:49:46,261 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 13:49:46,261 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:49:46,262 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 13:49:46,262 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 13:49:46,262 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 13:49:46,262 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 13:49:46,262 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 13:49:46,262 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 13:49:46,262 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 13:49:46,262 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 13:49:46,262 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 13:49:46,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 13:49:46,263 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 -> 85b55cdd1f26353e63ecc189ba28ba899672edc569fe3ef3f04470f2b5e667fa [2025-03-16 13:49:46,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 13:49:46,467 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 13:49:46,470 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 13:49:46,470 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 13:49:46,471 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 13:49:46,472 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array7_pattern.c [2025-03-16 13:49:47,580 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d251714a0/5c51bc052d2443de8ba5c6c6a26d5e12/FLAGb5d7626f4 [2025-03-16 13:49:47,816 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 13:49:47,817 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array7_pattern.c [2025-03-16 13:49:47,826 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d251714a0/5c51bc052d2443de8ba5c6c6a26d5e12/FLAGb5d7626f4 [2025-03-16 13:49:47,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d251714a0/5c51bc052d2443de8ba5c6c6a26d5e12 [2025-03-16 13:49:47,840 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 13:49:47,841 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 13:49:47,842 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 13:49:47,842 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 13:49:47,845 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 13:49:47,845 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:49:47" (1/1) ... [2025-03-16 13:49:47,846 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da4d1fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:47, skipping insertion in model container [2025-03-16 13:49:47,846 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 01:49:47" (1/1) ... [2025-03-16 13:49:47,858 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 13:49:47,958 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/array7_pattern.c[1375,1388] [2025-03-16 13:49:47,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:49:47,980 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 13:49:47,986 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/array7_pattern.c[1375,1388] [2025-03-16 13:49:47,993 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 13:49:48,002 INFO L204 MainTranslator]: Completed translation [2025-03-16 13:49:48,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48 WrapperNode [2025-03-16 13:49:48,004 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 13:49:48,005 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 13:49:48,005 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 13:49:48,005 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 13:49:48,010 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (1/1) ... [2025-03-16 13:49:48,015 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (1/1) ... [2025-03-16 13:49:48,028 INFO L138 Inliner]: procedures = 16, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 83 [2025-03-16 13:49:48,029 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 13:49:48,029 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 13:49:48,030 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 13:49:48,030 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 13:49:48,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (1/1) ... [2025-03-16 13:49:48,035 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (1/1) ... [2025-03-16 13:49:48,036 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (1/1) ... [2025-03-16 13:49:48,045 INFO L175 MemorySlicer]: Split 12 memory accesses to 3 slices as follows [2, 5, 5]. 42 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-16 13:49:48,045 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (1/1) ... [2025-03-16 13:49:48,045 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (1/1) ... [2025-03-16 13:49:48,050 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (1/1) ... [2025-03-16 13:49:48,050 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (1/1) ... [2025-03-16 13:49:48,051 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (1/1) ... [2025-03-16 13:49:48,051 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (1/1) ... [2025-03-16 13:49:48,052 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 13:49:48,056 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 13:49:48,056 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 13:49:48,057 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 13:49:48,057 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (1/1) ... [2025-03-16 13:49:48,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 13:49:48,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:48,079 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-16 13:49:48,081 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-16 13:49:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 13:49:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-16 13:49:48,094 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-16 13:49:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 13:49:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-16 13:49:48,094 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-16 13:49:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-16 13:49:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-16 13:49:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-16 13:49:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-16 13:49:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 13:49:48,095 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 13:49:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-16 13:49:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-16 13:49:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-16 13:49:48,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-16 13:49:48,147 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 13:49:48,149 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 13:49:48,277 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L45: 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-16 13:49:48,283 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-16 13:49:48,283 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 13:49:48,288 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 13:49:48,288 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 13:49:48,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:49:48 BoogieIcfgContainer [2025-03-16 13:49:48,289 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 13:49:48,291 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 13:49:48,291 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 13:49:48,294 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 13:49:48,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 01:49:47" (1/3) ... [2025-03-16 13:49:48,294 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ed984a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:49:48, skipping insertion in model container [2025-03-16 13:49:48,294 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 01:49:48" (2/3) ... [2025-03-16 13:49:48,295 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64ed984a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 01:49:48, skipping insertion in model container [2025-03-16 13:49:48,295 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 01:49:48" (3/3) ... [2025-03-16 13:49:48,295 INFO L128 eAbstractionObserver]: Analyzing ICFG array7_pattern.c [2025-03-16 13:49:48,304 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 13:49:48,305 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array7_pattern.c that has 2 procedures, 22 locations, 1 initial locations, 3 loop locations, and 1 error locations. [2025-03-16 13:49:48,340 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 13:49:48,346 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;@5df44c66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 13:49:48,347 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 13:49:48,349 INFO L276 IsEmpty]: Start isEmpty. Operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:49:48,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-16 13:49:48,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:48,353 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:48,353 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:48,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2046957392, now seen corresponding path program 1 times [2025-03-16 13:49:48,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:48,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004627274] [2025-03-16 13:49:48,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:48,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:48,410 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-16 13:49:48,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-16 13:49:48,423 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:48,424 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:48,457 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-16 13:49:48,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:48,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004627274] [2025-03-16 13:49:48,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004627274] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:49:48,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:49:48,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 13:49:48,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1640933285] [2025-03-16 13:49:48,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:49:48,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 13:49:48,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:48,476 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 13:49:48,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 13:49:48,478 INFO L87 Difference]: Start difference. First operand has 22 states, 16 states have (on average 1.4375) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-16 13:49:48,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:48,489 INFO L93 Difference]: Finished difference Result 42 states and 58 transitions. [2025-03-16 13:49:48,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 13:49:48,491 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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 13 [2025-03-16 13:49:48,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:48,495 INFO L225 Difference]: With dead ends: 42 [2025-03-16 13:49:48,495 INFO L226 Difference]: Without dead ends: 18 [2025-03-16 13:49:48,497 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-16 13:49:48,500 INFO L435 NwaCegarLoop]: 26 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, 26 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-16 13:49:48,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:49:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-16 13:49:48,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-16 13:49:48,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 13 states have (on average 1.2307692307692308) internal successors, (16), 13 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:49:48,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-16 13:49:48,520 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 13 [2025-03-16 13:49:48,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:48,520 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-16 13:49:48,520 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 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-16 13:49:48,520 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-16 13:49:48,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2025-03-16 13:49:48,521 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:48,521 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:48,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 13:49:48,521 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:48,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:48,522 INFO L85 PathProgramCache]: Analyzing trace with hash 570779176, now seen corresponding path program 1 times [2025-03-16 13:49:48,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:48,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40651884] [2025-03-16 13:49:48,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:48,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:48,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-03-16 13:49:48,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-03-16 13:49:48,556 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:48,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:48,709 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 13:49:48,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:48,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40651884] [2025-03-16 13:49:48,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40651884] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:49:48,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:49:48,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 13:49:48,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185371697] [2025-03-16 13:49:48,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:49:48,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 13:49:48,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:48,711 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 13:49:48,711 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:49:48,711 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:49:48,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:48,728 INFO L93 Difference]: Finished difference Result 22 states and 26 transitions. [2025-03-16 13:49:48,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 13:49:48,729 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 25 [2025-03-16 13:49:48,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:48,729 INFO L225 Difference]: With dead ends: 22 [2025-03-16 13:49:48,729 INFO L226 Difference]: Without dead ends: 19 [2025-03-16 13:49:48,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 13:49:48,731 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 2 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:48,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 48 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:49:48,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2025-03-16 13:49:48,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2025-03-16 13:49:48,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 14 states have (on average 1.2142857142857142) internal successors, (17), 14 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:49:48,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2025-03-16 13:49:48,735 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 25 [2025-03-16 13:49:48,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:48,736 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2025-03-16 13:49:48,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:49:48,737 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2025-03-16 13:49:48,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-03-16 13:49:48,738 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:48,738 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:48,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 13:49:48,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:48,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:48,739 INFO L85 PathProgramCache]: Analyzing trace with hash 514317025, now seen corresponding path program 1 times [2025-03-16 13:49:48,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:48,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073540271] [2025-03-16 13:49:48,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:48,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:48,756 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-03-16 13:49:48,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-03-16 13:49:48,775 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:48,775 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:48,878 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 13:49:48,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:48,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073540271] [2025-03-16 13:49:48,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073540271] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 13:49:48,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 13:49:48,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 13:49:48,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945841201] [2025-03-16 13:49:48,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 13:49:48,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 13:49:48,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:48,880 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 13:49:48,880 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:49:48,880 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:49:48,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:48,920 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2025-03-16 13:49:48,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 13:49:48,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 26 [2025-03-16 13:49:48,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:48,921 INFO L225 Difference]: With dead ends: 35 [2025-03-16 13:49:48,921 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 13:49:48,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 13:49:48,922 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 6 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:48,922 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 51 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:49:48,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 13:49:48,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-16 13:49:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:49:48,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-16 13:49:48,927 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 26 [2025-03-16 13:49:48,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:48,927 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-16 13:49:48,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-16 13:49:48,927 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-16 13:49:48,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-16 13:49:48,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:48,928 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:48,928 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 13:49:48,928 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:48,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:48,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1362863539, now seen corresponding path program 1 times [2025-03-16 13:49:48,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:48,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313624311] [2025-03-16 13:49:48,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:48,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:48,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 13:49:49,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 13:49:49,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:49,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:49,188 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-16 13:49:49,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:49,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313624311] [2025-03-16 13:49:49,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313624311] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:49:49,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1604092980] [2025-03-16 13:49:49,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 13:49:49,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:49,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:49,191 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-16 13:49:49,193 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-16 13:49:49,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-16 13:49:49,256 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-16 13:49:49,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 13:49:49,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:49,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 13:49:49,261 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:49,348 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 13:49:49,348 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:49,524 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 13:49:49,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1604092980] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:49,525 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:49:49,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 10] total 18 [2025-03-16 13:49:49,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491404839] [2025-03-16 13:49:49,525 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:49,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 13:49:49,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:49,526 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 13:49:49,526 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=243, Unknown=0, NotChecked=0, Total=306 [2025-03-16 13:49:49,526 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 18 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-16 13:49:49,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:49,664 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2025-03-16 13:49:49,664 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-16 13:49:49,664 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 27 [2025-03-16 13:49:49,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:49,664 INFO L225 Difference]: With dead ends: 59 [2025-03-16 13:49:49,664 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 13:49:49,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-16 13:49:49,665 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 8 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:49,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 95 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 13:49:49,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 13:49:49,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 22. [2025-03-16 13:49:49,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:49:49,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-03-16 13:49:49,670 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 27 [2025-03-16 13:49:49,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:49,671 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-03-16 13:49:49,671 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 15 states have internal predecessors, (32), 6 states have call successors, (7), 2 states have call predecessors, (7), 4 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2025-03-16 13:49:49,671 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-03-16 13:49:49,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-16 13:49:49,672 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:49,672 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:49,679 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-16 13:49:49,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:49,873 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:49,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:49,874 INFO L85 PathProgramCache]: Analyzing trace with hash 1307415411, now seen corresponding path program 2 times [2025-03-16 13:49:49,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:49,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44059721] [2025-03-16 13:49:49,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:49:49,875 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:49,884 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-16 13:49:49,897 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 13:49:49,899 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:49:49,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:49,996 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 13:49:49,996 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 13:49:49,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44059721] [2025-03-16 13:49:49,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44059721] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 13:49:49,997 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006666821] [2025-03-16 13:49:49,997 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 13:49:49,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:49,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:49,999 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-16 13:49:50,001 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-16 13:49:50,040 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 29 statements into 2 equivalence classes. [2025-03-16 13:49:50,063 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 29 of 29 statements. [2025-03-16 13:49:50,063 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 13:49:50,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:50,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-16 13:49:50,065 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:50,114 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 13:49:50,114 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 13:49:50,175 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 13:49:50,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006666821] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 13:49:50,176 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 13:49:50,176 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 14 [2025-03-16 13:49:50,176 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281027725] [2025-03-16 13:49:50,176 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 13:49:50,176 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-16 13:49:50,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 13:49:50,177 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-16 13:49:50,177 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-03-16 13:49:50,177 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 13:49:50,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 13:49:50,255 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2025-03-16 13:49:50,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-16 13:49:50,256 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) Word has length 29 [2025-03-16 13:49:50,256 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 13:49:50,257 INFO L225 Difference]: With dead ends: 31 [2025-03-16 13:49:50,257 INFO L226 Difference]: Without dead ends: 28 [2025-03-16 13:49:50,257 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 49 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-16 13:49:50,257 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 14 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 13:49:50,258 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 114 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 13:49:50,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-16 13:49:50,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2025-03-16 13:49:50,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 13:49:50,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2025-03-16 13:49:50,262 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 29 [2025-03-16 13:49:50,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 13:49:50,262 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2025-03-16 13:49:50,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.5) internal successors, (35), 14 states have internal predecessors, (35), 3 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 3 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 13:49:50,262 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2025-03-16 13:49:50,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-16 13:49:50,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 13:49:50,263 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 13:49:50,269 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-16 13:49:50,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:50,467 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 13:49:50,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 13:49:50,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1998191661, now seen corresponding path program 3 times [2025-03-16 13:49:50,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 13:49:50,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300404599] [2025-03-16 13:49:50,467 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:49:50,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 13:49:50,479 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 5 equivalence classes. [2025-03-16 13:49:50,579 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 13:49:50,579 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-16 13:49:50,579 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-16 13:49:50,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1388368502] [2025-03-16 13:49:50,581 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 13:49:50,581 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 13:49:50,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 13:49:50,583 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-16 13:49:50,585 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-16 13:49:50,623 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 31 statements into 5 equivalence classes. [2025-03-16 13:49:50,727 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) and asserted 31 of 31 statements. [2025-03-16 13:49:50,727 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2025-03-16 13:49:50,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 13:49:50,732 INFO L256 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 68 conjuncts are in the unsatisfiable core [2025-03-16 13:49:50,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 13:49:50,787 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-16 13:49:50,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 11 treesize of output 7 [2025-03-16 13:49:50,829 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 20 [2025-03-16 13:49:50,851 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-16 13:49:50,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:49:50,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-16 13:49:50,910 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:49:50,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 32 [2025-03-16 13:49:52,207 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-03-16 13:49:52,207 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 269 treesize of output 246 [2025-03-16 13:49:52,511 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2025-03-16 13:49:52,512 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 518 treesize of output 467 [2025-03-16 13:49:52,632 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:52,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:52,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:52,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:52,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:52,644 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:52,913 INFO L349 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2025-03-16 13:49:52,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 78 [2025-03-16 13:49:53,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,431 INFO L349 Elim1Store]: treesize reduction 80, result has 22.3 percent of original size [2025-03-16 13:49:53,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 9 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 78 [2025-03-16 13:49:53,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,585 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,589 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,590 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:49:53,658 INFO L349 Elim1Store]: treesize reduction 254, result has 0.4 percent of original size [2025-03-16 13:49:53,658 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 7 select indices, 7 select index equivalence classes, 30 disjoint index pairs (out of 21 index pairs), introduced 15 new quantified variables, introduced 12 case distinctions, treesize of input 431 treesize of output 1521 [2025-03-16 13:50:21,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,797 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,809 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 13:50:21,818 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,820 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,830 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,833 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,839 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-16 13:50:21,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,860 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,872 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,876 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,880 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,892 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:21,893 INFO L224 Elim1Store]: Index analysis took 101 ms [2025-03-16 13:50:21,921 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-16 13:50:21,922 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 4 stores, 10 select indices, 10 select index equivalence classes, 35 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 2 case distinctions, treesize of input 953 treesize of output 1089 [2025-03-16 13:50:23,361 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:23,362 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:23,363 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:23,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:23,366 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:23,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:23,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:23,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:23,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:23,376 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-16 13:50:23,395 INFO L349 Elim1Store]: treesize reduction 45, result has 26.2 percent of original size [2025-03-16 13:50:23,395 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 14 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 130 [2025-03-16 13:50:49,250 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 792 treesize of output 716 [2025-03-16 13:50:59,496 WARN L286 SmtUtils]: Spent 10.23s on a formula simplification that was a NOOP. DAG size: 399 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-16 13:50:59,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-16 13:50:59,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 13 select indices, 13 select index equivalence classes, 3 disjoint index pairs (out of 78 index pairs), introduced 13 new quantified variables, introduced 78 case distinctions, treesize of input 723 treesize of output 1802 [2025-03-16 13:51:00,756 INFO L224 Elim1Store]: Index analysis took 1132 ms