./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/loops/insertion_sort-1-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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/loops/insertion_sort-1-2.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 36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 13:27:19,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 13:27:20,011 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 13:27:20,017 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 13:27:20,018 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 13:27:20,039 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 13:27:20,039 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 13:27:20,040 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 13:27:20,040 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 13:27:20,040 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 13:27:20,041 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 13:27:20,041 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 13:27:20,041 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 13:27:20,041 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 13:27:20,042 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 13:27:20,042 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 13:27:20,042 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 13:27:20,042 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 13:27:20,042 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 13:27:20,042 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 13:27:20,042 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 13:27:20,042 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 13:27:20,042 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 13:27:20,043 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 13:27:20,043 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 13:27:20,043 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 13:27:20,043 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 13:27:20,043 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 13:27:20,043 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 13:27:20,043 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 13:27:20,043 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 13:27:20,043 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 13:27:20,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:27:20,044 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 13:27:20,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 13:27:20,044 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 13:27:20,044 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 13:27:20,044 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 13:27:20,044 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 13:27:20,044 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 13:27:20,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 13:27:20,044 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 13:27:20,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 13:27:20,045 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 -> 36d1103e69366c6d9110aa7e24b0c4765120510facc121d7623fcf9373a67e96 [2025-03-03 13:27:20,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 13:27:20,272 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 13:27:20,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 13:27:20,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 13:27:20,275 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 13:27:20,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/loops/insertion_sort-1-2.c [2025-03-03 13:27:21,432 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c8d2c53e/258998f51ab24c7db36a939f6bd6891f/FLAG68fec8861 [2025-03-03 13:27:21,637 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 13:27:21,638 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/loops/insertion_sort-1-2.c [2025-03-03 13:27:21,647 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c8d2c53e/258998f51ab24c7db36a939f6bd6891f/FLAG68fec8861 [2025-03-03 13:27:21,659 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7c8d2c53e/258998f51ab24c7db36a939f6bd6891f [2025-03-03 13:27:21,661 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 13:27:21,662 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 13:27:21,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 13:27:21,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 13:27:21,665 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 13:27:21,666 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,666 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e614eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21, skipping insertion in model container [2025-03-03 13:27:21,667 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,679 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 13:27:21,764 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/loops/insertion_sort-1-2.c[330,343] [2025-03-03 13:27:21,780 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:27:21,787 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 13:27:21,793 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/loops/insertion_sort-1-2.c[330,343] [2025-03-03 13:27:21,803 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 13:27:21,815 INFO L204 MainTranslator]: Completed translation [2025-03-03 13:27:21,816 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21 WrapperNode [2025-03-03 13:27:21,817 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 13:27:21,817 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 13:27:21,818 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 13:27:21,818 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 13:27:21,822 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,826 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,839 INFO L138 Inliner]: procedures = 15, calls = 19, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 73 [2025-03-03 13:27:21,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 13:27:21,841 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 13:27:21,841 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 13:27:21,841 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 13:27:21,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,851 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,861 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 3 writes are split as follows [0, 3]. [2025-03-03 13:27:21,861 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,861 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,865 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,867 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,867 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,871 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,872 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 13:27:21,872 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 13:27:21,872 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 13:27:21,872 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 13:27:21,873 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (1/1) ... [2025-03-03 13:27:21,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 13:27:21,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:21,898 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-03 13:27:21,901 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-03 13:27:21,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 13:27:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 13:27:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 13:27:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 13:27:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 13:27:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 13:27:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 13:27:21,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 13:27:21,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 13:27:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 13:27:21,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 13:27:21,966 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 13:27:21,968 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 13:27:22,074 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L19: call ULTIMATE.dealloc(main_~#v~0#1.base, main_~#v~0#1.offset);havoc main_~#v~0#1.base, main_~#v~0#1.offset; [2025-03-03 13:27:22,083 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2025-03-03 13:27:22,083 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 13:27:22,090 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 13:27:22,090 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 13:27:22,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:27:22 BoogieIcfgContainer [2025-03-03 13:27:22,091 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 13:27:22,093 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 13:27:22,093 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 13:27:22,096 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 13:27:22,097 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 01:27:21" (1/3) ... [2025-03-03 13:27:22,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57075d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:27:22, skipping insertion in model container [2025-03-03 13:27:22,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 01:27:21" (2/3) ... [2025-03-03 13:27:22,098 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@57075d6c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 01:27:22, skipping insertion in model container [2025-03-03 13:27:22,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 01:27:22" (3/3) ... [2025-03-03 13:27:22,099 INFO L128 eAbstractionObserver]: Analyzing ICFG insertion_sort-1-2.c [2025-03-03 13:27:22,112 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 13:27:22,114 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG insertion_sort-1-2.c that has 1 procedures, 19 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-03 13:27:22,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 13:27:22,159 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;@783bd6e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 13:27:22,159 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 13:27:22,162 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:22,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-03 13:27:22,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:22,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:22,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:22,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:22,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1907778344, now seen corresponding path program 1 times [2025-03-03 13:27:22,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:22,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638710501] [2025-03-03 13:27:22,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:22,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:22,222 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-03 13:27:22,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-03 13:27:22,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:22,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:22,413 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-03 13:27:22,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:22,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638710501] [2025-03-03 13:27:22,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638710501] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:27:22,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:27:22,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:27:22,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630485268] [2025-03-03 13:27:22,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:27:22,420 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:27:22,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:22,434 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:27:22,435 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:27:22,437 INFO L87 Difference]: Start difference. First operand has 19 states, 17 states have (on average 1.588235294117647) internal successors, (27), 18 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:22,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:22,480 INFO L93 Difference]: Finished difference Result 42 states and 62 transitions. [2025-03-03 13:27:22,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:27:22,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2025-03-03 13:27:22,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:22,487 INFO L225 Difference]: With dead ends: 42 [2025-03-03 13:27:22,487 INFO L226 Difference]: Without dead ends: 23 [2025-03-03 13:27:22,490 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-03 13:27:22,492 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:22,493 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 50 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:22,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-03-03 13:27:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 17. [2025-03-03 13:27:22,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:22,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 22 transitions. [2025-03-03 13:27:22,519 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 22 transitions. Word has length 8 [2025-03-03 13:27:22,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:22,519 INFO L471 AbstractCegarLoop]: Abstraction has 17 states and 22 transitions. [2025-03-03 13:27:22,519 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:22,519 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 22 transitions. [2025-03-03 13:27:22,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-03-03 13:27:22,520 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:22,520 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:22,520 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 13:27:22,520 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:22,520 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:22,522 INFO L85 PathProgramCache]: Analyzing trace with hash 745027411, now seen corresponding path program 1 times [2025-03-03 13:27:22,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:22,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918770718] [2025-03-03 13:27:22,523 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:22,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:22,536 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-03-03 13:27:22,562 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-03-03 13:27:22,565 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:22,565 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:22,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:27:22,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:22,719 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918770718] [2025-03-03 13:27:22,719 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918770718] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 13:27:22,719 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 13:27:22,719 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 13:27:22,719 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89660896] [2025-03-03 13:27:22,719 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 13:27:22,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 13:27:22,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:22,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 13:27:22,722 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 13:27:22,722 INFO L87 Difference]: Start difference. First operand 17 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:22,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:22,751 INFO L93 Difference]: Finished difference Result 31 states and 41 transitions. [2025-03-03 13:27:22,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 13:27:22,753 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2025-03-03 13:27:22,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:22,753 INFO L225 Difference]: With dead ends: 31 [2025-03-03 13:27:22,753 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 13:27:22,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-03 13:27:22,754 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:22,755 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:22,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 13:27:22,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-03 13:27:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:22,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 23 transitions. [2025-03-03 13:27:22,759 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 23 transitions. Word has length 13 [2025-03-03 13:27:22,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:22,759 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 23 transitions. [2025-03-03 13:27:22,759 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), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 23 transitions. [2025-03-03 13:27:22,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 13:27:22,760 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:22,760 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:22,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 13:27:22,762 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:22,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:22,762 INFO L85 PathProgramCache]: Analyzing trace with hash 529864849, now seen corresponding path program 1 times [2025-03-03 13:27:22,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:22,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284698714] [2025-03-03 13:27:22,763 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:22,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:22,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:27:22,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:27:22,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:22,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:22,939 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:27:22,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:22,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284698714] [2025-03-03 13:27:22,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284698714] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:22,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1268432167] [2025-03-03 13:27:22,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:22,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:22,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:22,945 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-03 13:27:22,947 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-03 13:27:22,988 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 13:27:23,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 13:27:23,006 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:23,006 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:23,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 13:27:23,012 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:23,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:27:23,046 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:23,104 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:27:23,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1268432167] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:23,104 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:23,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-03 13:27:23,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2039468672] [2025-03-03 13:27:23,105 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:23,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 13:27:23,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:23,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 13:27:23,105 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:27:23,106 INFO L87 Difference]: Start difference. First operand 18 states and 23 transitions. Second operand has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:23,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:23,145 INFO L93 Difference]: Finished difference Result 38 states and 51 transitions. [2025-03-03 13:27:23,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 13:27:23,147 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2025-03-03 13:27:23,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:23,148 INFO L225 Difference]: With dead ends: 38 [2025-03-03 13:27:23,148 INFO L226 Difference]: Without dead ends: 25 [2025-03-03 13:27:23,148 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2025-03-03 13:27:23,149 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 27 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:23,149 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 66 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 13:27:23,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-03 13:27:23,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 19. [2025-03-03 13:27:23,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:23,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2025-03-03 13:27:23,154 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 14 [2025-03-03 13:27:23,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:23,154 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2025-03-03 13:27:23,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:23,154 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2025-03-03 13:27:23,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-03 13:27:23,155 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:23,155 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:23,161 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-03 13:27:23,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:23,359 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:23,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:23,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1845207277, now seen corresponding path program 2 times [2025-03-03 13:27:23,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:23,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704227057] [2025-03-03 13:27:23,360 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:27:23,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:23,369 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-03 13:27:23,380 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:27:23,381 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:27:23,381 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:24,143 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:27:24,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704227057] [2025-03-03 13:27:24,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704227057] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:24,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429985993] [2025-03-03 13:27:24,143 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:27:24,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:24,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:24,147 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-03 13:27:24,148 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-03 13:27:24,180 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 15 statements into 2 equivalence classes. [2025-03-03 13:27:24,196 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 15 of 15 statements. [2025-03-03 13:27:24,196 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:27:24,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:24,198 INFO L256 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 13:27:24,202 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:24,353 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 27 treesize of output 15 [2025-03-03 13:27:24,392 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:27:24,393 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 26 treesize of output 10 [2025-03-03 13:27:24,408 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:27:24,408 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:24,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 37 [2025-03-03 13:27:24,578 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-03 13:27:24,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 66 [2025-03-03 13:27:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:27:24,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429985993] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:24,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:24,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 10] total 24 [2025-03-03 13:27:24,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275275771] [2025-03-03 13:27:24,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:24,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 13:27:24,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:24,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 13:27:24,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=441, Unknown=0, NotChecked=0, Total=552 [2025-03-03 13:27:24,654 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:25,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:25,150 INFO L93 Difference]: Finished difference Result 70 states and 98 transitions. [2025-03-03 13:27:25,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-03 13:27:25,150 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-03 13:27:25,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:25,152 INFO L225 Difference]: With dead ends: 70 [2025-03-03 13:27:25,152 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 13:27:25,153 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=338, Invalid=1222, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 13:27:25,153 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 111 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:25,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 77 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 13:27:25,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 13:27:25,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 31. [2025-03-03 13:27:25,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 30 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:25,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 40 transitions. [2025-03-03 13:27:25,161 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 40 transitions. Word has length 15 [2025-03-03 13:27:25,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:25,161 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 40 transitions. [2025-03-03 13:27:25,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.4166666666666667) internal successors, (34), 24 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:25,161 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 40 transitions. [2025-03-03 13:27:25,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2025-03-03 13:27:25,162 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:25,162 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:25,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 13:27:25,362 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,SelfDestructingSolverStorable3 [2025-03-03 13:27:25,363 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:25,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:25,363 INFO L85 PathProgramCache]: Analyzing trace with hash 717276410, now seen corresponding path program 1 times [2025-03-03 13:27:25,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:25,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823142964] [2025-03-03 13:27:25,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:25,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:25,370 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:27:25,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:27:25,379 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:25,379 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:25,482 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:27:25,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:25,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823142964] [2025-03-03 13:27:25,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823142964] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:25,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980819129] [2025-03-03 13:27:25,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:25,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:25,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:25,488 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-03 13:27:25,490 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-03 13:27:25,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 18 statements into 1 equivalence classes. [2025-03-03 13:27:25,537 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 18 of 18 statements. [2025-03-03 13:27:25,537 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:25,537 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:25,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-03-03 13:27:25,539 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:25,601 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:27:25,601 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:25,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:27:25,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980819129] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:25,749 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:25,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 13 [2025-03-03 13:27:25,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247318228] [2025-03-03 13:27:25,749 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:25,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 13:27:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:25,750 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 13:27:25,750 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2025-03-03 13:27:25,750 INFO L87 Difference]: Start difference. First operand 31 states and 40 transitions. Second operand has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:25,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:27:25,852 INFO L93 Difference]: Finished difference Result 98 states and 132 transitions. [2025-03-03 13:27:25,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 13:27:25,852 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2025-03-03 13:27:25,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:27:25,854 INFO L225 Difference]: With dead ends: 98 [2025-03-03 13:27:25,854 INFO L226 Difference]: Without dead ends: 70 [2025-03-03 13:27:25,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2025-03-03 13:27:25,855 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 33 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 13:27:25,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 153 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 13:27:25,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-03 13:27:25,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2025-03-03 13:27:25,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.3148148148148149) internal successors, (71), 54 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:25,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 71 transitions. [2025-03-03 13:27:25,876 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 71 transitions. Word has length 18 [2025-03-03 13:27:25,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:27:25,876 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 71 transitions. [2025-03-03 13:27:25,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:25,876 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 71 transitions. [2025-03-03 13:27:25,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2025-03-03 13:27:25,876 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:27:25,876 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:27:25,884 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 13:27:26,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:26,077 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:27:26,078 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:27:26,078 INFO L85 PathProgramCache]: Analyzing trace with hash 804332973, now seen corresponding path program 1 times [2025-03-03 13:27:26,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:27:26,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308798408] [2025-03-03 13:27:26,078 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:26,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:27:26,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:27:26,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:27:26,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:26,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:26,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:27:26,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:27:26,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308798408] [2025-03-03 13:27:26,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308798408] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:27:26,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1304656463] [2025-03-03 13:27:26,660 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 13:27:26,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:27:26,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:27:26,663 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-03 13:27:26,663 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-03 13:27:26,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 20 statements into 1 equivalence classes. [2025-03-03 13:27:26,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 20 of 20 statements. [2025-03-03 13:27:26,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 13:27:26,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:27:26,711 INFO L256 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 13:27:26,715 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:27:26,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 22 [2025-03-03 13:27:26,944 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:27:26,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2025-03-03 13:27:26,997 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:27:26,998 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 12 [2025-03-03 13:27:27,017 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:27:27,018 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:27:31,471 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 64 treesize of output 56 [2025-03-03 13:27:31,482 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2025-03-03 13:27:31,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 168 treesize of output 136 [2025-03-03 13:27:31,533 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 13:27:31,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1304656463] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:27:31,534 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:27:31,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 12] total 37 [2025-03-03 13:27:31,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958849674] [2025-03-03 13:27:31,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:27:31,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-03 13:27:31,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:27:31,535 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-03 13:27:31,535 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=175, Invalid=1157, Unknown=0, NotChecked=0, Total=1332 [2025-03-03 13:27:31,535 INFO L87 Difference]: Start difference. First operand 55 states and 71 transitions. Second operand has 37 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:27:34,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:27:38,519 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:27:54,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:27:58,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:28:07,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:28:23,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:28:27,474 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:28:31,484 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:28:35,491 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:28:39,565 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:28:43,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:28:48,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:28:52,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2025-03-03 13:28:56,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:56,523 INFO L93 Difference]: Finished difference Result 141 states and 187 transitions. [2025-03-03 13:28:56,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 13:28:56,523 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2025-03-03 13:28:56,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:56,524 INFO L225 Difference]: With dead ends: 141 [2025-03-03 13:28:56,524 INFO L226 Difference]: Without dead ends: 86 [2025-03-03 13:28:56,526 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 22 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1768 ImplicationChecksByTransitivity, 38.8s TimeCoverageRelationStatistics Valid=842, Invalid=5003, Unknown=7, NotChecked=0, Total=5852 [2025-03-03 13:28:56,526 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 106 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 714 mSolverCounterSat, 42 mSolverCounterUnsat, 12 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 50.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 714 IncrementalHoareTripleChecker+Invalid, 12 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 50.8s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:56,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 177 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 714 Invalid, 12 Unknown, 0 Unchecked, 50.8s Time] [2025-03-03 13:28:56,527 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-03 13:28:56,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 52. [2025-03-03 13:28:56,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:28:56,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2025-03-03 13:28:56,532 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 20 [2025-03-03 13:28:56,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:56,532 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2025-03-03 13:28:56,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:28:56,532 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2025-03-03 13:28:56,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-03-03 13:28:56,532 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:56,532 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:28:56,538 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-03 13:28:56,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:56,737 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:56,737 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:56,737 INFO L85 PathProgramCache]: Analyzing trace with hash 1376878330, now seen corresponding path program 3 times [2025-03-03 13:28:56,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:56,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718138388] [2025-03-03 13:28:56,738 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:28:56,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:56,748 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-03 13:28:56,766 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:28:56,766 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:28:56,766 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:57,388 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 13:28:57,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718138388] [2025-03-03 13:28:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718138388] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:28:57,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [840619879] [2025-03-03 13:28:57,389 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 13:28:57,389 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:57,389 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:28:57,391 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-03 13:28:57,392 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-03 13:28:57,426 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 21 statements into 3 equivalence classes. [2025-03-03 13:28:57,442 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 21 of 21 statements. [2025-03-03 13:28:57,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 13:28:57,442 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:57,443 INFO L256 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 13:28:57,448 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:28:57,569 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 27 treesize of output 15 [2025-03-03 13:28:57,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:28:57,648 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 27 treesize of output 18 [2025-03-03 13:28:57,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:28:57,666 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 26 treesize of output 10 [2025-03-03 13:28:57,681 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:28:57,681 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:28:57,948 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 51 treesize of output 45 [2025-03-03 13:28:57,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:28:57,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 291 treesize of output 269 [2025-03-03 13:28:58,073 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:28:58,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [840619879] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:28:58,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:28:58,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 13, 13] total 35 [2025-03-03 13:28:58,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120437893] [2025-03-03 13:28:58,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:28:58,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 13:28:58,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:58,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 13:28:58,076 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=193, Invalid=997, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 13:28:58,077 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 35 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:28:58,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 13:28:58,903 INFO L93 Difference]: Finished difference Result 152 states and 203 transitions. [2025-03-03 13:28:58,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-03-03 13:28:58,904 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2025-03-03 13:28:58,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 13:28:58,904 INFO L225 Difference]: With dead ends: 152 [2025-03-03 13:28:58,904 INFO L226 Difference]: Without dead ends: 120 [2025-03-03 13:28:58,905 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 922 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=543, Invalid=2537, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 13:28:58,906 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 145 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 13:28:58,906 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 112 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 13:28:58,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-03 13:28:58,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 75. [2025-03-03 13:28:58,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 74 states have (on average 1.337837837837838) internal successors, (99), 74 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:28:58,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 99 transitions. [2025-03-03 13:28:58,912 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 99 transitions. Word has length 21 [2025-03-03 13:28:58,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 13:28:58,912 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 99 transitions. [2025-03-03 13:28:58,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 1.4285714285714286) internal successors, (50), 35 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 13:28:58,913 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 99 transitions. [2025-03-03 13:28:58,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-03 13:28:58,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 13:28:58,913 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 13:28:58,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 13:28:59,118 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:59,118 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 13:28:59,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 13:28:59,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1645496243, now seen corresponding path program 2 times [2025-03-03 13:28:59,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 13:28:59,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073407749] [2025-03-03 13:28:59,118 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:28:59,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 13:28:59,124 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:28:59,134 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:28:59,135 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:28:59,135 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:59,402 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:28:59,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 13:28:59,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073407749] [2025-03-03 13:28:59,403 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073407749] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 13:28:59,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120032283] [2025-03-03 13:28:59,403 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 13:28:59,403 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 13:28:59,403 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 13:28:59,405 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-03 13:28:59,407 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-03 13:28:59,438 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 24 statements into 2 equivalence classes. [2025-03-03 13:28:59,452 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 24 of 24 statements. [2025-03-03 13:28:59,452 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 13:28:59,452 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 13:28:59,454 INFO L256 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 13:28:59,456 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 13:28:59,578 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 27 treesize of output 15 [2025-03-03 13:28:59,648 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 13:28:59,649 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 26 treesize of output 10 [2025-03-03 13:28:59,661 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 13:28:59,661 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 13:28:59,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2025-03-03 13:28:59,802 INFO L349 Elim1Store]: treesize reduction 5, result has 70.6 percent of original size [2025-03-03 13:28:59,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 69 treesize of output 58 [2025-03-03 13:28:59,824 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 13:28:59,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120032283] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 13:28:59,825 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 13:28:59,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 13, 11] total 25 [2025-03-03 13:28:59,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530060026] [2025-03-03 13:28:59,826 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 13:28:59,826 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-03-03 13:28:59,826 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 13:28:59,826 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-03-03 13:28:59,827 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=512, Unknown=0, NotChecked=0, Total=600 [2025-03-03 13:28:59,827 INFO L87 Difference]: Start difference. First operand 75 states and 99 transitions. Second operand has 25 states, 25 states have (on average 2.0) internal successors, (50), 25 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)