./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array13_pattern.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/array-patterns/array13_pattern.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 78699f7813351c3df7f7fcab3bf98fffd7a92c5cc679034a9d139e9169232d7e --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 09:27:36,731 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 09:27:36,772 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 09:27:36,775 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 09:27:36,775 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 09:27:36,797 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 09:27:36,798 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 09:27:36,798 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 09:27:36,798 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 09:27:36,798 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 09:27:36,799 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 09:27:36,799 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 09:27:36,799 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 09:27:36,799 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 09:27:36,799 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 09:27:36,800 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 09:27:36,800 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 09:27:36,800 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 09:27:36,800 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 09:27:36,800 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 09:27:36,800 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 09:27:36,800 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 09:27:36,800 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 09:27:36,801 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 09:27:36,801 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 09:27:36,801 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 09:27:36,801 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 09:27:36,801 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 09:27:36,801 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 09:27:36,801 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 09:27:36,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 09:27:36,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 09:27:36,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:27:36,802 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 09:27:36,802 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 09:27:36,802 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 09:27:36,802 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 09:27:36,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 09:27:36,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 09:27:36,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 09:27:36,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 09:27:36,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 09:27:36,802 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 09:27:36,802 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 -> 78699f7813351c3df7f7fcab3bf98fffd7a92c5cc679034a9d139e9169232d7e [2025-03-03 09:27:37,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 09:27:37,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 09:27:37,018 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 09:27:37,019 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 09:27:37,020 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 09:27:37,020 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array13_pattern.c [2025-03-03 09:27:38,102 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77776d756/f56300f253364e44b70c3ec14c019e85/FLAGeb01b57b6 [2025-03-03 09:27:38,301 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 09:27:38,304 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array13_pattern.c [2025-03-03 09:27:38,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77776d756/f56300f253364e44b70c3ec14c019e85/FLAGeb01b57b6 [2025-03-03 09:27:38,656 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77776d756/f56300f253364e44b70c3ec14c019e85 [2025-03-03 09:27:38,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 09:27:38,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 09:27:38,659 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 09:27:38,660 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 09:27:38,662 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 09:27:38,663 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,664 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@77bb3c60 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38, skipping insertion in model container [2025-03-03 09:27:38,664 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,678 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 09:27:38,771 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array13_pattern.c[1342,1355] [2025-03-03 09:27:38,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:27:38,795 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 09:27:38,802 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array13_pattern.c[1342,1355] [2025-03-03 09:27:38,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 09:27:38,823 INFO L204 MainTranslator]: Completed translation [2025-03-03 09:27:38,823 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38 WrapperNode [2025-03-03 09:27:38,823 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 09:27:38,824 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 09:27:38,824 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 09:27:38,824 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 09:27:38,828 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,834 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,843 INFO L138 Inliner]: procedures = 16, calls = 18, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 82 [2025-03-03 09:27:38,843 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 09:27:38,844 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 09:27:38,844 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 09:27:38,844 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 09:27:38,848 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,850 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,857 INFO L175 MemorySlicer]: Split 6 memory accesses to 2 slices as follows [2, 4]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2025-03-03 09:27:38,858 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,858 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,864 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,866 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,870 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,870 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,871 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 09:27:38,872 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 09:27:38,872 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 09:27:38,872 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 09:27:38,873 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (1/1) ... [2025-03-03 09:27:38,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 09:27:38,887 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:27:38,897 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 09:27:38,900 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 09:27:38,918 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 09:27:38,918 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 09:27:38,919 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 09:27:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 09:27:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-03 09:27:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-03 09:27:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-03 09:27:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-03 09:27:38,919 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 09:27:38,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 09:27:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-03 09:27:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-03 09:27:38,920 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-03 09:27:38,970 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 09:27:38,972 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 09:27:39,101 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L44: call ULTIMATE.dealloc(main_~#array~0#1.base, main_~#array~0#1.offset);havoc main_~#array~0#1.base, main_~#array~0#1.offset; [2025-03-03 09:27:39,121 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-03-03 09:27:39,124 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 09:27:39,129 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 09:27:39,131 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 09:27:39,131 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:27:39 BoogieIcfgContainer [2025-03-03 09:27:39,131 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 09:27:39,133 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 09:27:39,134 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 09:27:39,137 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 09:27:39,137 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 09:27:38" (1/3) ... [2025-03-03 09:27:39,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f7acc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:27:39, skipping insertion in model container [2025-03-03 09:27:39,138 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 09:27:38" (2/3) ... [2025-03-03 09:27:39,138 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26f7acc5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 09:27:39, skipping insertion in model container [2025-03-03 09:27:39,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 09:27:39" (3/3) ... [2025-03-03 09:27:39,139 INFO L128 eAbstractionObserver]: Analyzing ICFG array13_pattern.c [2025-03-03 09:27:39,150 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 09:27:39,151 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG array13_pattern.c that has 2 procedures, 26 locations, 1 initial locations, 5 loop locations, and 1 error locations. [2025-03-03 09:27:39,190 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 09:27:39,200 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;@7e4364cf, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 09:27:39,200 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 09:27:39,204 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:27:39,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-03-03 09:27:39,208 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:27:39,209 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:27:39,209 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:27:39,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:27:39,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1686619525, now seen corresponding path program 1 times [2025-03-03 09:27:39,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:27:39,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436491319] [2025-03-03 09:27:39,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:27:39,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:27:39,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-03-03 09:27:39,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-03-03 09:27:39,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:27:39,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:39,315 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 09:27:39,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:27:39,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436491319] [2025-03-03 09:27:39,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436491319] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:27:39,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:27:39,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 09:27:39,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638927250] [2025-03-03 09:27:39,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:27:39,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 09:27:39,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:27:39,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 09:27:39,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:27:39,334 INFO L87 Difference]: Start difference. First operand has 26 states, 20 states have (on average 1.5) internal successors, (30), 21 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 09:27:39,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:27:39,343 INFO L93 Difference]: Finished difference Result 49 states and 71 transitions. [2025-03-03 09:27:39,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 09:27:39,344 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2025-03-03 09:27:39,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:27:39,348 INFO L225 Difference]: With dead ends: 49 [2025-03-03 09:27:39,348 INFO L226 Difference]: Without dead ends: 22 [2025-03-03 09:27:39,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 09:27:39,351 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:27:39,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:27:39,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-03-03 09:27:39,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-03-03 09:27:39,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 17 states have internal predecessors, (23), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:27:39,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 29 transitions. [2025-03-03 09:27:39,372 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 29 transitions. Word has length 14 [2025-03-03 09:27:39,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:27:39,373 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 29 transitions. [2025-03-03 09:27:39,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-03-03 09:27:39,373 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 29 transitions. [2025-03-03 09:27:39,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2025-03-03 09:27:39,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:27:39,374 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:27:39,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 09:27:39,374 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:27:39,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:27:39,375 INFO L85 PathProgramCache]: Analyzing trace with hash 835071108, now seen corresponding path program 1 times [2025-03-03 09:27:39,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:27:39,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756146800] [2025-03-03 09:27:39,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:27:39,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:27:39,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:27:39,408 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:27:39,409 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:27:39,409 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:39,602 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:27:39,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:27:39,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756146800] [2025-03-03 09:27:39,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756146800] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:27:39,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [998669865] [2025-03-03 09:27:39,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:27:39,603 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:39,603 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:27:39,605 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 09:27:39,606 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 09:27:39,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 27 statements into 1 equivalence classes. [2025-03-03 09:27:39,664 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 27 of 27 statements. [2025-03-03 09:27:39,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:27:39,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:39,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-03 09:27:39,671 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:27:39,769 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:27:39,770 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 09:27:39,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [998669865] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:27:39,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:27:39,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2025-03-03 09:27:39,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723413814] [2025-03-03 09:27:39,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:27:39,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-03 09:27:39,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:27:39,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-03 09:27:39,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:27:39,771 INFO L87 Difference]: Start difference. First operand 22 states and 29 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:27:39,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:27:39,848 INFO L93 Difference]: Finished difference Result 51 states and 65 transitions. [2025-03-03 09:27:39,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 09:27:39,849 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2025-03-03 09:27:39,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:27:39,849 INFO L225 Difference]: With dead ends: 51 [2025-03-03 09:27:39,849 INFO L226 Difference]: Without dead ends: 29 [2025-03-03 09:27:39,849 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:27:39,850 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:27:39,850 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 79 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:27:39,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-03 09:27:39,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 23. [2025-03-03 09:27:39,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:27:39,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 30 transitions. [2025-03-03 09:27:39,855 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 30 transitions. Word has length 27 [2025-03-03 09:27:39,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:27:39,855 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 30 transitions. [2025-03-03 09:27:39,855 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:27:39,855 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 30 transitions. [2025-03-03 09:27:39,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2025-03-03 09:27:39,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:27:39,858 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:27:39,864 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 09:27:40,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:40,062 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:27:40,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:27:40,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1595113402, now seen corresponding path program 1 times [2025-03-03 09:27:40,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:27:40,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052465258] [2025-03-03 09:27:40,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:27:40,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:27:40,073 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 29 statements into 1 equivalence classes. [2025-03-03 09:27:40,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 29 of 29 statements. [2025-03-03 09:27:40,088 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:27:40,088 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:40,174 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:27:40,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:27:40,174 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052465258] [2025-03-03 09:27:40,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052465258] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 09:27:40,174 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 09:27:40,174 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 09:27:40,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931016271] [2025-03-03 09:27:40,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 09:27:40,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 09:27:40,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:27:40,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 09:27:40,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:27:40,175 INFO L87 Difference]: Start difference. First operand 23 states and 30 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:27:40,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:27:40,221 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2025-03-03 09:27:40,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 09:27:40,222 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2025-03-03 09:27:40,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:27:40,222 INFO L225 Difference]: With dead ends: 46 [2025-03-03 09:27:40,222 INFO L226 Difference]: Without dead ends: 28 [2025-03-03 09:27:40,222 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 09:27:40,223 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:27:40,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 52 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:27:40,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2025-03-03 09:27:40,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2025-03-03 09:27:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:27:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2025-03-03 09:27:40,227 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 29 [2025-03-03 09:27:40,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:27:40,227 INFO L471 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2025-03-03 09:27:40,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 09:27:40,227 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2025-03-03 09:27:40,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-03-03 09:27:40,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:27:40,229 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:27:40,229 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 09:27:40,229 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:27:40,230 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:27:40,230 INFO L85 PathProgramCache]: Analyzing trace with hash 1723001289, now seen corresponding path program 1 times [2025-03-03 09:27:40,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:27:40,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147867730] [2025-03-03 09:27:40,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:27:40,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:27:40,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 09:27:40,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:27:40,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:27:40,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:40,313 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:27:40,313 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:27:40,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147867730] [2025-03-03 09:27:40,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1147867730] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:27:40,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1121463183] [2025-03-03 09:27:40,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:27:40,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:40,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:27:40,317 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 09:27:40,318 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 09:27:40,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-03-03 09:27:40,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-03-03 09:27:40,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:27:40,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:40,365 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 09:27:40,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:27:40,413 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:27:40,413 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:27:40,453 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-03 09:27:40,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1121463183] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:27:40,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:27:40,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 09:27:40,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464680206] [2025-03-03 09:27:40,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:27:40,453 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 09:27:40,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:27:40,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 09:27:40,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-03-03 09:27:40,454 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:27:40,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:27:40,523 INFO L93 Difference]: Finished difference Result 35 states and 43 transitions. [2025-03-03 09:27:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:27:40,524 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2025-03-03 09:27:40,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:27:40,524 INFO L225 Difference]: With dead ends: 35 [2025-03-03 09:27:40,524 INFO L226 Difference]: Without dead ends: 32 [2025-03-03 09:27:40,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 56 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 09:27:40,525 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 23 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:27:40,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 61 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:27:40,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-03 09:27:40,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2025-03-03 09:27:40,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:27:40,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-03-03 09:27:40,529 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 30 [2025-03-03 09:27:40,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:27:40,529 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-03-03 09:27:40,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 8 states have internal predecessors, (29), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:27:40,529 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-03-03 09:27:40,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 09:27:40,534 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:27:40,534 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:27:40,539 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 09:27:40,738 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 09:27:40,738 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:27:40,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:27:40,738 INFO L85 PathProgramCache]: Analyzing trace with hash 866954683, now seen corresponding path program 1 times [2025-03-03 09:27:40,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:27:40,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129858460] [2025-03-03 09:27:40,738 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:27:40,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:27:40,744 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 09:27:40,751 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:27:40,751 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:27:40,751 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:40,886 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 09:27:40,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:27:40,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129858460] [2025-03-03 09:27:40,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129858460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:27:40,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103104972] [2025-03-03 09:27:40,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:27:40,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:40,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:27:40,890 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 09:27:40,890 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 09:27:40,926 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 09:27:40,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:27:40,940 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:27:40,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:40,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:27:40,944 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:27:41,059 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 09:27:41,060 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:27:41,242 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-03 09:27:41,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103104972] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:27:41,242 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:27:41,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 21 [2025-03-03 09:27:41,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666249188] [2025-03-03 09:27:41,242 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:27:41,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-03 09:27:41,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:27:41,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-03 09:27:41,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=340, Unknown=0, NotChecked=0, Total=420 [2025-03-03 09:27:41,244 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 09:27:41,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:27:41,733 INFO L93 Difference]: Finished difference Result 124 states and 166 transitions. [2025-03-03 09:27:41,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-03-03 09:27:41,733 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 33 [2025-03-03 09:27:41,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:27:41,735 INFO L225 Difference]: With dead ends: 124 [2025-03-03 09:27:41,735 INFO L226 Difference]: Without dead ends: 104 [2025-03-03 09:27:41,736 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 282 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=265, Invalid=995, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 09:27:41,736 INFO L435 NwaCegarLoop]: 33 mSDtfsCounter, 164 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 454 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:27:41,737 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 198 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 454 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:27:41,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-03-03 09:27:41,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 62. [2025-03-03 09:27:41,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 52 states have internal predecessors, (70), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:27:41,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 82 transitions. [2025-03-03 09:27:41,753 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 82 transitions. Word has length 33 [2025-03-03 09:27:41,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:27:41,754 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 82 transitions. [2025-03-03 09:27:41,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 2.111111111111111) internal successors, (38), 15 states have internal predecessors, (38), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2025-03-03 09:27:41,754 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 82 transitions. [2025-03-03 09:27:41,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-03-03 09:27:41,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:27:41,755 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:27:41,761 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 09:27:41,960 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 09:27:41,960 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:27:41,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:27:41,960 INFO L85 PathProgramCache]: Analyzing trace with hash 670441178, now seen corresponding path program 1 times [2025-03-03 09:27:41,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:27:41,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098093403] [2025-03-03 09:27:41,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:27:41,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:27:41,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 09:27:41,986 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:27:41,986 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:27:41,986 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:27:41,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [490528469] [2025-03-03 09:27:41,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:27:41,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:41,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:27:41,991 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 09:27:41,992 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 09:27:42,021 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-03-03 09:27:42,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-03-03 09:27:42,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:27:42,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:42,034 INFO L256 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-03 09:27:42,037 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:27:42,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:27:42,324 INFO L349 Elim1Store]: treesize reduction 31, result has 18.4 percent of original size [2025-03-03 09:27:42,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 35 treesize of output 24 [2025-03-03 09:27:42,385 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 15 treesize of output 7 [2025-03-03 09:27:42,408 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 2 proven. 10 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:27:42,409 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:27:42,653 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 30 treesize of output 28 [2025-03-03 09:27:42,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2025-03-03 09:27:42,736 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:27:42,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:27:42,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098093403] [2025-03-03 09:27:42,737 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:27:42,737 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [490528469] [2025-03-03 09:27:42,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [490528469] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:27:42,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:27:42,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 11] total 24 [2025-03-03 09:27:42,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513413139] [2025-03-03 09:27:42,737 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:27:42,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 09:27:42,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:27:42,738 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 09:27:42,738 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=450, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:27:42,738 INFO L87 Difference]: Start difference. First operand 62 states and 82 transitions. Second operand has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 09:27:43,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:27:43,602 INFO L93 Difference]: Finished difference Result 151 states and 204 transitions. [2025-03-03 09:27:43,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2025-03-03 09:27:43,602 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 33 [2025-03-03 09:27:43,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:27:43,603 INFO L225 Difference]: With dead ends: 151 [2025-03-03 09:27:43,603 INFO L226 Difference]: Without dead ends: 120 [2025-03-03 09:27:43,604 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 565 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=388, Invalid=1774, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 09:27:43,605 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 105 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 432 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 493 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 09:27:43,605 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 178 Invalid, 493 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 432 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 09:27:43,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2025-03-03 09:27:43,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 102. [2025-03-03 09:27:43,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 84 states have (on average 1.3571428571428572) internal successors, (114), 86 states have internal predecessors, (114), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 09:27:43,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 136 transitions. [2025-03-03 09:27:43,628 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 136 transitions. Word has length 33 [2025-03-03 09:27:43,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:27:43,628 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 136 transitions. [2025-03-03 09:27:43,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 1.75) internal successors, (42), 23 states have internal predecessors, (42), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-03 09:27:43,629 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 136 transitions. [2025-03-03 09:27:43,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 09:27:43,629 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:27:43,629 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:27:43,635 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 09:27:43,830 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 09:27:43,830 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:27:43,830 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:27:43,831 INFO L85 PathProgramCache]: Analyzing trace with hash -690204692, now seen corresponding path program 2 times [2025-03-03 09:27:43,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:27:43,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238423541] [2025-03-03 09:27:43,831 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:27:43,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:27:43,837 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-03 09:27:43,844 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:27:43,844 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:27:43,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:43,913 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:27:43,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:27:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238423541] [2025-03-03 09:27:43,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238423541] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:27:43,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1778161543] [2025-03-03 09:27:43,913 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:27:43,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:43,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:27:43,915 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 09:27:43,917 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 09:27:43,945 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-03 09:27:43,958 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:27:43,958 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:27:43,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:43,959 INFO L256 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:27:43,960 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:27:43,999 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:27:43,999 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:27:44,033 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:27:44,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1778161543] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:27:44,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:27:44,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2025-03-03 09:27:44,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190845365] [2025-03-03 09:27:44,033 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:27:44,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 09:27:44,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:27:44,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 09:27:44,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-03 09:27:44,034 INFO L87 Difference]: Start difference. First operand 102 states and 136 transitions. Second operand has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:27:44,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:27:44,114 INFO L93 Difference]: Finished difference Result 146 states and 190 transitions. [2025-03-03 09:27:44,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:27:44,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2025-03-03 09:27:44,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:27:44,115 INFO L225 Difference]: With dead ends: 146 [2025-03-03 09:27:44,115 INFO L226 Difference]: Without dead ends: 81 [2025-03-03 09:27:44,115 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 61 SyntacticMatches, 3 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=43, Invalid=89, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:27:44,116 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 7 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:27:44,116 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 82 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:27:44,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-03 09:27:44,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 78. [2025-03-03 09:27:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 65 states have (on average 1.323076923076923) internal successors, (86), 66 states have internal predecessors, (86), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 09:27:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 102 transitions. [2025-03-03 09:27:44,137 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 102 transitions. Word has length 34 [2025-03-03 09:27:44,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:27:44,137 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 102 transitions. [2025-03-03 09:27:44,138 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.909090909090909) internal successors, (32), 11 states have internal predecessors, (32), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:27:44,138 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 102 transitions. [2025-03-03 09:27:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-03 09:27:44,138 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:27:44,138 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:27:44,145 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-03 09:27:44,338 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 09:27:44,339 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:27:44,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:27:44,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1967955390, now seen corresponding path program 2 times [2025-03-03 09:27:44,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:27:44,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814147454] [2025-03-03 09:27:44,341 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:27:44,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:27:44,347 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-03 09:27:44,354 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:27:44,354 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:27:44,354 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:44,422 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:27:44,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:27:44,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814147454] [2025-03-03 09:27:44,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814147454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:27:44,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834403787] [2025-03-03 09:27:44,422 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:27:44,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:44,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:27:44,425 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 09:27:44,426 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 09:27:44,454 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 34 statements into 2 equivalence classes. [2025-03-03 09:27:44,468 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 34 of 34 statements. [2025-03-03 09:27:44,468 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:27:44,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:44,469 INFO L256 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:27:44,469 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:27:44,509 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:27:44,510 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:27:44,550 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:27:44,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834403787] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:27:44,550 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:27:44,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 15 [2025-03-03 09:27:44,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938768433] [2025-03-03 09:27:44,551 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:27:44,551 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-03 09:27:44,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:27:44,551 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-03 09:27:44,551 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:27:44,552 INFO L87 Difference]: Start difference. First operand 78 states and 102 transitions. Second operand has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:27:44,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:27:44,656 INFO L93 Difference]: Finished difference Result 126 states and 176 transitions. [2025-03-03 09:27:44,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 09:27:44,656 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 34 [2025-03-03 09:27:44,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:27:44,658 INFO L225 Difference]: With dead ends: 126 [2025-03-03 09:27:44,658 INFO L226 Difference]: Without dead ends: 89 [2025-03-03 09:27:44,658 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:27:44,659 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:27:44,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 119 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:27:44,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2025-03-03 09:27:44,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 83. [2025-03-03 09:27:44,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 70 states have (on average 1.3428571428571427) internal successors, (94), 71 states have internal predecessors, (94), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 09:27:44,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 110 transitions. [2025-03-03 09:27:44,673 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 110 transitions. Word has length 34 [2025-03-03 09:27:44,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:27:44,673 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 110 transitions. [2025-03-03 09:27:44,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.3333333333333335) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:27:44,674 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 110 transitions. [2025-03-03 09:27:44,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-03 09:27:44,676 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:27:44,676 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:27:44,691 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-03 09:27:44,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:44,876 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:27:44,876 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:27:44,877 INFO L85 PathProgramCache]: Analyzing trace with hash -318468260, now seen corresponding path program 3 times [2025-03-03 09:27:44,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:27:44,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459205240] [2025-03-03 09:27:44,877 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:27:44,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:27:44,883 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 7 equivalence classes. [2025-03-03 09:27:44,893 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 38 statements. [2025-03-03 09:27:44,893 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:27:44,893 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:27:45,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:27:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459205240] [2025-03-03 09:27:45,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459205240] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:27:45,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [719700985] [2025-03-03 09:27:45,003 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:27:45,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:45,003 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:27:45,005 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:27:45,006 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-03 09:27:45,036 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 7 equivalence classes. [2025-03-03 09:27:45,052 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 38 statements. [2025-03-03 09:27:45,052 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-03 09:27:45,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:45,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-03 09:27:45,053 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:27:45,149 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 09:27:45,149 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:27:45,308 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:27:45,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [719700985] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:27:45,308 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:27:45,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 12, 11] total 23 [2025-03-03 09:27:45,309 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846718225] [2025-03-03 09:27:45,309 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:27:45,309 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-03-03 09:27:45,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:27:45,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-03-03 09:27:45,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=115, Invalid=391, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:27:45,310 INFO L87 Difference]: Start difference. First operand 83 states and 110 transitions. Second operand has 23 states, 20 states have (on average 2.2) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 09:27:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:27:45,559 INFO L93 Difference]: Finished difference Result 110 states and 147 transitions. [2025-03-03 09:27:45,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 09:27:45,560 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 20 states have (on average 2.2) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) Word has length 38 [2025-03-03 09:27:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:27:45,560 INFO L225 Difference]: With dead ends: 110 [2025-03-03 09:27:45,560 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 09:27:45,561 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 63 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 223 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=721, Unknown=0, NotChecked=0, Total=930 [2025-03-03 09:27:45,561 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 97 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 09:27:45,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 149 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 09:27:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 09:27:45,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 88. [2025-03-03 09:27:45,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 74 states have (on average 1.3243243243243243) internal successors, (98), 75 states have internal predecessors, (98), 8 states have call successors, (8), 5 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2025-03-03 09:27:45,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 114 transitions. [2025-03-03 09:27:45,587 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 114 transitions. Word has length 38 [2025-03-03 09:27:45,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:27:45,587 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 114 transitions. [2025-03-03 09:27:45,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 20 states have (on average 2.2) internal successors, (44), 16 states have internal predecessors, (44), 4 states have call successors, (5), 2 states have call predecessors, (5), 5 states have return successors, (7), 7 states have call predecessors, (7), 4 states have call successors, (7) [2025-03-03 09:27:45,587 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 114 transitions. [2025-03-03 09:27:45,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-03 09:27:45,588 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:27:45,588 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:27:45,595 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-03 09:27:45,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:45,793 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:27:45,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:27:45,793 INFO L85 PathProgramCache]: Analyzing trace with hash -2054465047, now seen corresponding path program 3 times [2025-03-03 09:27:45,793 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:27:45,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484778562] [2025-03-03 09:27:45,794 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:27:45,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:27:45,799 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 6 equivalence classes. [2025-03-03 09:27:45,808 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 39 statements. [2025-03-03 09:27:45,809 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:27:45,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:45,854 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:27:45,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:27:45,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484778562] [2025-03-03 09:27:45,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484778562] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:27:45,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168504521] [2025-03-03 09:27:45,855 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:27:45,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:45,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:27:45,857 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:27:45,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-03 09:27:45,890 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 39 statements into 6 equivalence classes. [2025-03-03 09:27:45,916 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 35 of 39 statements. [2025-03-03 09:27:45,916 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 09:27:45,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:45,917 INFO L256 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 09:27:45,918 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:27:45,944 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:27:45,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:27:45,977 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 5 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-03-03 09:27:45,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168504521] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:27:45,977 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:27:45,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2025-03-03 09:27:45,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112401967] [2025-03-03 09:27:45,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:27:45,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 09:27:45,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:27:45,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 09:27:45,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 09:27:45,978 INFO L87 Difference]: Start difference. First operand 88 states and 114 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:27:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:27:46,045 INFO L93 Difference]: Finished difference Result 95 states and 122 transitions. [2025-03-03 09:27:46,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 09:27:46,045 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 39 [2025-03-03 09:27:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:27:46,046 INFO L225 Difference]: With dead ends: 95 [2025-03-03 09:27:46,046 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 09:27:46,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 74 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:27:46,047 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 11 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:27:46,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 88 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 09:27:46,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 09:27:46,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 40. [2025-03-03 09:27:46,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:27:46,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2025-03-03 09:27:46,055 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 39 [2025-03-03 09:27:46,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:27:46,055 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2025-03-03 09:27:46,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:27:46,056 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2025-03-03 09:27:46,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:27:46,056 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:27:46,056 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:27:46,063 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 09:27:46,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 09:27:46,257 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:27:46,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:27:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1161349772, now seen corresponding path program 4 times [2025-03-03 09:27:46,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:27:46,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111917212] [2025-03-03 09:27:46,258 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:27:46,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:27:46,267 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-03 09:27:46,285 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:27:46,286 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:27:46,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:27:46,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1677280002] [2025-03-03 09:27:46,287 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:27:46,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:46,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:27:46,292 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:27:46,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 09:27:46,342 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-03 09:27:46,497 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:27:46,497 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:27:46,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:46,499 WARN L254 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 95 conjuncts are in the unsatisfiable core [2025-03-03 09:27:46,502 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:27:46,562 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:27:46,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:27:46,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:27:46,707 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 30 treesize of output 21 [2025-03-03 09:27:46,748 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:27:46,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:27:47,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:47,205 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:47,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:47,212 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-03 09:27:47,212 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 61 [2025-03-03 09:27:47,788 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:47,789 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:47,790 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:27:47,791 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:27:47,797 INFO L349 Elim1Store]: treesize reduction 25, result has 10.7 percent of original size [2025-03-03 09:27:47,797 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 63 treesize of output 28 [2025-03-03 09:27:47,837 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 36 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:27:47,837 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:27:48,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:27:48,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111917212] [2025-03-03 09:27:48,738 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:27:48,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1677280002] [2025-03-03 09:27:48,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1677280002] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:27:48,738 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:27:48,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30] total 30 [2025-03-03 09:27:48,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006745591] [2025-03-03 09:27:48,738 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:27:48,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 09:27:48,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:27:48,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 09:27:48,740 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1593, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 09:27:48,740 INFO L87 Difference]: Start difference. First operand 40 states and 48 transitions. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:27:49,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:27:49,765 INFO L93 Difference]: Finished difference Result 118 states and 150 transitions. [2025-03-03 09:27:49,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-03 09:27:49,765 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 43 [2025-03-03 09:27:49,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:27:49,766 INFO L225 Difference]: With dead ends: 118 [2025-03-03 09:27:49,766 INFO L226 Difference]: Without dead ends: 90 [2025-03-03 09:27:49,767 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 951 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=444, Invalid=2862, Unknown=0, NotChecked=0, Total=3306 [2025-03-03 09:27:49,767 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 71 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 721 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:27:49,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 217 Invalid, 721 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:27:49,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-03-03 09:27:49,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 65. [2025-03-03 09:27:49,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 56 states have (on average 1.2321428571428572) internal successors, (69), 56 states have internal predecessors, (69), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-03 09:27:49,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 79 transitions. [2025-03-03 09:27:49,778 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 79 transitions. Word has length 43 [2025-03-03 09:27:49,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:27:49,778 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 79 transitions. [2025-03-03 09:27:49,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 26 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:27:49,779 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 79 transitions. [2025-03-03 09:27:49,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-03 09:27:49,779 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:27:49,779 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:27:49,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-03 09:27:49,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:49,980 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:27:49,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:27:49,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1626065715, now seen corresponding path program 4 times [2025-03-03 09:27:49,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:27:49,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021851520] [2025-03-03 09:27:49,980 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:27:49,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:27:49,989 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-03 09:27:49,999 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:27:49,999 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:27:49,999 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:27:49,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [601712085] [2025-03-03 09:27:49,999 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:27:49,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:27:50,000 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:27:50,002 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:27:50,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 09:27:50,037 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 43 statements into 2 equivalence classes. [2025-03-03 09:27:50,175 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-03-03 09:27:50,175 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:27:50,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:27:50,177 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 71 conjuncts are in the unsatisfiable core [2025-03-03 09:27:50,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:27:50,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:27:50,233 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:27:50,300 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:27:50,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:27:50,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 31 [2025-03-03 09:27:50,717 INFO L349 Elim1Store]: treesize reduction 368, result has 13.4 percent of original size [2025-03-03 09:27:50,718 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 9 select indices, 9 select index equivalence classes, 6 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 44 case distinctions, treesize of input 84 treesize of output 94 [2025-03-03 09:27:51,019 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:27:51,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 42 treesize of output 18 [2025-03-03 09:27:51,040 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 8 proven. 39 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 09:27:51,040 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:27:52,167 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 242 treesize of output 234 [2025-03-03 09:27:52,301 INFO L349 Elim1Store]: treesize reduction 27, result has 22.9 percent of original size [2025-03-03 09:27:52,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 144491796 treesize of output 139511068 [2025-03-03 09:28:02,155 WARN L286 SmtUtils]: Spent 9.84s on a formula simplification. DAG size of input: 2570 DAG size of output: 619 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-03-03 09:28:25,074 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 3 proven. 39 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-03 09:28:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021851520] [2025-03-03 09:28:25,074 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:28:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [601712085] [2025-03-03 09:28:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [601712085] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:28:25,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-03 09:28:25,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23] total 45 [2025-03-03 09:28:25,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817797260] [2025-03-03 09:28:25,074 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:25,075 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-03-03 09:28:25,075 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:25,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-03-03 09:28:25,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=350, Invalid=1630, Unknown=0, NotChecked=0, Total=1980 [2025-03-03 09:28:25,076 INFO L87 Difference]: Start difference. First operand 65 states and 79 transitions. Second operand has 45 states, 45 states have (on average 1.511111111111111) internal successors, (68), 44 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:28:29,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:29,539 INFO L93 Difference]: Finished difference Result 157 states and 201 transitions. [2025-03-03 09:28:29,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 58 states. [2025-03-03 09:28:29,540 INFO L78 Accepts]: Start accepts. Automaton has has 45 states, 45 states have (on average 1.511111111111111) internal successors, (68), 44 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) Word has length 43 [2025-03-03 09:28:29,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:29,541 INFO L225 Difference]: With dead ends: 157 [2025-03-03 09:28:29,541 INFO L226 Difference]: Without dead ends: 146 [2025-03-03 09:28:29,542 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 38 SyntacticMatches, 4 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2209 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=1172, Invalid=5634, Unknown=0, NotChecked=0, Total=6806 [2025-03-03 09:28:29,543 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 159 mSDsluCounter, 449 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 1465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:29,543 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 476 Invalid, 1465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-03 09:28:29,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2025-03-03 09:28:29,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 101. [2025-03-03 09:28:29,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 84 states have (on average 1.2738095238095237) internal successors, (107), 84 states have internal predecessors, (107), 11 states have call successors, (11), 5 states have call predecessors, (11), 5 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 09:28:29,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 129 transitions. [2025-03-03 09:28:29,570 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 129 transitions. Word has length 43 [2025-03-03 09:28:29,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:29,570 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 129 transitions. [2025-03-03 09:28:29,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 45 states have (on average 1.511111111111111) internal successors, (68), 44 states have internal predecessors, (68), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 4 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-03 09:28:29,570 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 129 transitions. [2025-03-03 09:28:29,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:28:29,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:29,571 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:29,577 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 09:28:29,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 09:28:29,771 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:29,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:29,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1643059834, now seen corresponding path program 5 times [2025-03-03 09:28:29,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:29,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271541716] [2025-03-03 09:28:29,774 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:28:29,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:29,783 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 7 equivalence classes. [2025-03-03 09:28:29,796 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 23 of 44 statements. [2025-03-03 09:28:29,796 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:28:29,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:29,869 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 14 proven. 20 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 09:28:29,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:29,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271541716] [2025-03-03 09:28:29,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271541716] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:29,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1129342813] [2025-03-03 09:28:29,869 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:28:29,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:29,869 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:29,871 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:28:29,873 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 09:28:29,907 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 44 statements into 7 equivalence classes. [2025-03-03 09:28:29,922 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) and asserted 23 of 44 statements. [2025-03-03 09:28:29,922 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2025-03-03 09:28:29,922 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:29,923 INFO L256 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:28:29,924 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:29,972 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 30 proven. 12 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-03 09:28:29,973 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:30,016 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-03-03 09:28:30,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1129342813] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:28:30,016 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:28:30,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-03 09:28:30,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792861890] [2025-03-03 09:28:30,016 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:30,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:28:30,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:30,017 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:28:30,017 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:28:30,017 INFO L87 Difference]: Start difference. First operand 101 states and 129 transitions. Second operand has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:28:30,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:30,116 INFO L93 Difference]: Finished difference Result 197 states and 252 transitions. [2025-03-03 09:28:30,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 09:28:30,117 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-03 09:28:30,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:30,118 INFO L225 Difference]: With dead ends: 197 [2025-03-03 09:28:30,118 INFO L226 Difference]: Without dead ends: 131 [2025-03-03 09:28:30,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 79 SyntacticMatches, 5 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2025-03-03 09:28:30,119 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:30,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 124 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:28:30,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2025-03-03 09:28:30,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 119. [2025-03-03 09:28:30,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 99 states have (on average 1.2727272727272727) internal successors, (126), 99 states have internal predecessors, (126), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 09:28:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 152 transitions. [2025-03-03 09:28:30,145 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 152 transitions. Word has length 44 [2025-03-03 09:28:30,145 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:30,145 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 152 transitions. [2025-03-03 09:28:30,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.0) internal successors, (39), 13 states have internal predecessors, (39), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:28:30,145 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 152 transitions. [2025-03-03 09:28:30,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-03-03 09:28:30,146 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:30,146 INFO L218 NwaCegarLoop]: trace histogram [5, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:30,152 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 09:28:30,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 09:28:30,347 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:30,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:30,347 INFO L85 PathProgramCache]: Analyzing trace with hash 1918554831, now seen corresponding path program 6 times [2025-03-03 09:28:30,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:30,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [668214146] [2025-03-03 09:28:30,347 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:28:30,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:30,353 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 7 equivalence classes. [2025-03-03 09:28:30,370 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:28:30,370 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:28:30,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:30,441 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:28:30,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:30,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [668214146] [2025-03-03 09:28:30,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [668214146] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:30,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223930966] [2025-03-03 09:28:30,441 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 09:28:30,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:30,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:30,443 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:28:30,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-03-03 09:28:30,479 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 44 statements into 7 equivalence classes. [2025-03-03 09:28:30,771 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) and asserted 44 of 44 statements. [2025-03-03 09:28:30,771 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2025-03-03 09:28:30,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:30,772 INFO L256 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:28:30,773 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:30,828 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:28:30,828 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:30,878 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 5 proven. 24 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:28:30,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223930966] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:28:30,878 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:28:30,878 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 13 [2025-03-03 09:28:30,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316900272] [2025-03-03 09:28:30,878 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:30,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-03 09:28:30,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:30,879 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-03 09:28:30,879 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-03-03 09:28:30,879 INFO L87 Difference]: Start difference. First operand 119 states and 152 transitions. Second operand has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:28:31,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:31,088 INFO L93 Difference]: Finished difference Result 171 states and 212 transitions. [2025-03-03 09:28:31,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 09:28:31,088 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 44 [2025-03-03 09:28:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:31,089 INFO L225 Difference]: With dead ends: 171 [2025-03-03 09:28:31,089 INFO L226 Difference]: Without dead ends: 168 [2025-03-03 09:28:31,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 78 SyntacticMatches, 6 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=240, Invalid=516, Unknown=0, NotChecked=0, Total=756 [2025-03-03 09:28:31,090 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 18 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:31,090 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 76 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:28:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-03-03 09:28:31,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 121. [2025-03-03 09:28:31,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 100 states have (on average 1.25) internal successors, (125), 100 states have internal predecessors, (125), 13 states have call successors, (13), 7 states have call predecessors, (13), 7 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-03 09:28:31,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 151 transitions. [2025-03-03 09:28:31,123 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 151 transitions. Word has length 44 [2025-03-03 09:28:31,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:31,123 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 151 transitions. [2025-03-03 09:28:31,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 13 states have internal predecessors, (43), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:28:31,123 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 151 transitions. [2025-03-03 09:28:31,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2025-03-03 09:28:31,124 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:31,124 INFO L218 NwaCegarLoop]: trace histogram [6, 4, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:31,129 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-03-03 09:28:31,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 09:28:31,324 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:31,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:31,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1253481362, now seen corresponding path program 7 times [2025-03-03 09:28:31,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:31,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012022056] [2025-03-03 09:28:31,325 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:28:31,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:31,332 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:28:31,341 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:28:31,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:28:31,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:31,424 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 24 proven. 23 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:28:31,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:31,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012022056] [2025-03-03 09:28:31,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012022056] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:31,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1495780625] [2025-03-03 09:28:31,424 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 09:28:31,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:31,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:31,427 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:28:31,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-03-03 09:28:31,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-03-03 09:28:31,486 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-03-03 09:28:31,486 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:28:31,486 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:31,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:28:31,488 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 43 proven. 12 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-03-03 09:28:31,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:31,609 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 35 proven. 12 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2025-03-03 09:28:31,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1495780625] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:28:31,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:28:31,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 14 [2025-03-03 09:28:31,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180920378] [2025-03-03 09:28:31,610 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:31,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-03-03 09:28:31,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:31,611 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-03-03 09:28:31,611 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=133, Unknown=0, NotChecked=0, Total=182 [2025-03-03 09:28:31,611 INFO L87 Difference]: Start difference. First operand 121 states and 151 transitions. Second operand has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:28:31,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:31,810 INFO L93 Difference]: Finished difference Result 145 states and 175 transitions. [2025-03-03 09:28:31,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 09:28:31,810 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 47 [2025-03-03 09:28:31,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:31,812 INFO L225 Difference]: With dead ends: 145 [2025-03-03 09:28:31,812 INFO L226 Difference]: Without dead ends: 114 [2025-03-03 09:28:31,814 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 84 SyntacticMatches, 5 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2025-03-03 09:28:31,814 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 8 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:31,814 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 107 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:28:31,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2025-03-03 09:28:31,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 111. [2025-03-03 09:28:31,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 93 states have (on average 1.2043010752688172) internal successors, (112), 93 states have internal predecessors, (112), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 09:28:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 134 transitions. [2025-03-03 09:28:31,844 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 134 transitions. Word has length 47 [2025-03-03 09:28:31,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:31,844 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 134 transitions. [2025-03-03 09:28:31,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 3.4285714285714284) internal successors, (48), 14 states have internal predecessors, (48), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:28:31,845 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 134 transitions. [2025-03-03 09:28:31,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-03 09:28:31,845 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:31,845 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:31,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-03-03 09:28:32,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-03 09:28:32,046 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:32,046 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:32,046 INFO L85 PathProgramCache]: Analyzing trace with hash 890051146, now seen corresponding path program 8 times [2025-03-03 09:28:32,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:32,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [567234557] [2025-03-03 09:28:32,046 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:28:32,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:32,051 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-03 09:28:32,057 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:28:32,057 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:28:32,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:32,140 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 1 proven. 24 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 09:28:32,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:32,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [567234557] [2025-03-03 09:28:32,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [567234557] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:32,140 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752457302] [2025-03-03 09:28:32,140 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:28:32,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:32,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:32,143 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:28:32,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-03-03 09:28:32,183 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 49 statements into 2 equivalence classes. [2025-03-03 09:28:32,201 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 49 of 49 statements. [2025-03-03 09:28:32,202 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:28:32,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:32,203 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:28:32,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:32,279 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 11 proven. 22 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2025-03-03 09:28:32,279 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 85 backedges. 3 proven. 22 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2025-03-03 09:28:32,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752457302] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:28:32,341 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:28:32,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-03 09:28:32,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057767753] [2025-03-03 09:28:32,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:32,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-03 09:28:32,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:32,342 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-03 09:28:32,342 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2025-03-03 09:28:32,342 INFO L87 Difference]: Start difference. First operand 111 states and 134 transitions. Second operand has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:28:32,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:32,536 INFO L93 Difference]: Finished difference Result 167 states and 205 transitions. [2025-03-03 09:28:32,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-03 09:28:32,537 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 49 [2025-03-03 09:28:32,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:32,538 INFO L225 Difference]: With dead ends: 167 [2025-03-03 09:28:32,538 INFO L226 Difference]: Without dead ends: 128 [2025-03-03 09:28:32,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 213 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=405, Unknown=0, NotChecked=0, Total=552 [2025-03-03 09:28:32,538 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 13 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:32,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 173 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 228 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:28:32,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2025-03-03 09:28:32,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 116. [2025-03-03 09:28:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 98 states have (on average 1.2040816326530612) internal successors, (118), 98 states have internal predecessors, (118), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 09:28:32,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 140 transitions. [2025-03-03 09:28:32,569 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 140 transitions. Word has length 49 [2025-03-03 09:28:32,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:32,569 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 140 transitions. [2025-03-03 09:28:32,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.2) internal successors, (44), 20 states have internal predecessors, (44), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 09:28:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 140 transitions. [2025-03-03 09:28:32,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-03 09:28:32,570 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:32,570 INFO L218 NwaCegarLoop]: trace histogram [9, 6, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:32,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-03-03 09:28:32,770 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:32,771 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:32,771 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:32,771 INFO L85 PathProgramCache]: Analyzing trace with hash -898709137, now seen corresponding path program 9 times [2025-03-03 09:28:32,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:32,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087978850] [2025-03-03 09:28:32,771 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:28:32,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:32,778 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 11 equivalence classes. [2025-03-03 09:28:32,793 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 54 statements. [2025-03-03 09:28:32,793 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 09:28:32,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:32,874 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 4 proven. 32 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 09:28:32,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087978850] [2025-03-03 09:28:32,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087978850] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [662088377] [2025-03-03 09:28:32,875 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 09:28:32,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:32,875 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:32,876 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:28:32,878 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-03-03 09:28:32,919 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 54 statements into 11 equivalence classes. [2025-03-03 09:28:33,263 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) and asserted 43 of 54 statements. [2025-03-03 09:28:33,263 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2025-03-03 09:28:33,263 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:33,264 INFO L256 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 09:28:33,265 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:33,297 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 09:28:33,298 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:33,331 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 15 proven. 21 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2025-03-03 09:28:33,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [662088377] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 09:28:33,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 09:28:33,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 12 [2025-03-03 09:28:33,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906234911] [2025-03-03 09:28:33,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:33,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-03 09:28:33,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:33,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-03 09:28:33,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2025-03-03 09:28:33,333 INFO L87 Difference]: Start difference. First operand 116 states and 140 transitions. Second operand has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:28:33,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:33,454 INFO L93 Difference]: Finished difference Result 122 states and 145 transitions. [2025-03-03 09:28:33,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-03 09:28:33,454 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-03-03 09:28:33,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:33,455 INFO L225 Difference]: With dead ends: 122 [2025-03-03 09:28:33,455 INFO L226 Difference]: Without dead ends: 107 [2025-03-03 09:28:33,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 104 SyntacticMatches, 6 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2025-03-03 09:28:33,455 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 20 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:33,455 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 83 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 09:28:33,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2025-03-03 09:28:33,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2025-03-03 09:28:33,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 89 states have (on average 1.1797752808988764) internal successors, (105), 89 states have internal predecessors, (105), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 09:28:33,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 127 transitions. [2025-03-03 09:28:33,480 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 127 transitions. Word has length 54 [2025-03-03 09:28:33,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:33,480 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 127 transitions. [2025-03-03 09:28:33,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.0) internal successors, (36), 12 states have internal predecessors, (36), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-03 09:28:33,480 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 127 transitions. [2025-03-03 09:28:33,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:28:33,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:33,481 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:33,485 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-03-03 09:28:33,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-03 09:28:33,681 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:33,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:33,682 INFO L85 PathProgramCache]: Analyzing trace with hash 1095474348, now seen corresponding path program 1 times [2025-03-03 09:28:33,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:33,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314506553] [2025-03-03 09:28:33,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:28:33,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:33,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:28:33,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:28:33,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:28:33,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:28:33,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1197675808] [2025-03-03 09:28:33,702 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 09:28:33,702 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:33,703 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:33,704 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:28:33,706 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-03-03 09:28:33,747 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-03 09:28:34,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:28:34,064 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 09:28:34,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:34,065 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 89 conjuncts are in the unsatisfiable core [2025-03-03 09:28:34,068 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:34,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:28:34,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:28:34,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:34,234 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 30 treesize of output 21 [2025-03-03 09:28:34,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2025-03-03 09:28:34,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:34,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:34,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:34,594 INFO L349 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2025-03-03 09:28:34,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 70 treesize of output 61 [2025-03-03 09:28:35,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:35,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:35,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:35,166 INFO L349 Elim1Store]: treesize reduction 330, result has 14.5 percent of original size [2025-03-03 09:28:35,166 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 35 case distinctions, treesize of input 83 treesize of output 90 [2025-03-03 09:28:35,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:35,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:35,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:35,743 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-03 09:28:35,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:35,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 6 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 79 treesize of output 56 [2025-03-03 09:28:35,831 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 14 proven. 59 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2025-03-03 09:28:35,831 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:37,027 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314506553] [2025-03-03 09:28:37,027 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:28:37,027 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197675808] [2025-03-03 09:28:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197675808] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:37,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:28:37,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33] total 33 [2025-03-03 09:28:37,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [262981888] [2025-03-03 09:28:37,028 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:37,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-03 09:28:37,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:37,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-03 09:28:37,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=300, Invalid=1862, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 09:28:37,029 INFO L87 Difference]: Start difference. First operand 107 states and 127 transitions. Second operand has 33 states, 32 states have (on average 1.28125) internal successors, (41), 29 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 09:28:38,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:38,346 INFO L93 Difference]: Finished difference Result 133 states and 155 transitions. [2025-03-03 09:28:38,347 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-03 09:28:38,347 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.28125) internal successors, (41), 29 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 57 [2025-03-03 09:28:38,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:38,347 INFO L225 Difference]: With dead ends: 133 [2025-03-03 09:28:38,348 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 09:28:38,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1418 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=641, Invalid=3781, Unknown=0, NotChecked=0, Total=4422 [2025-03-03 09:28:38,349 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 52 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:38,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 145 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 09:28:38,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 09:28:38,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 97. [2025-03-03 09:28:38,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 82 states have (on average 1.170731707317073) internal successors, (96), 82 states have internal predecessors, (96), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:28:38,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 114 transitions. [2025-03-03 09:28:38,373 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 114 transitions. Word has length 57 [2025-03-03 09:28:38,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:38,374 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 114 transitions. [2025-03-03 09:28:38,374 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.28125) internal successors, (41), 29 states have internal predecessors, (41), 4 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2025-03-03 09:28:38,374 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 114 transitions. [2025-03-03 09:28:38,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:28:38,374 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:38,374 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:38,381 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2025-03-03 09:28:38,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-03 09:28:38,575 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:38,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:38,575 INFO L85 PathProgramCache]: Analyzing trace with hash 281024236, now seen corresponding path program 2 times [2025-03-03 09:28:38,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:38,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029992708] [2025-03-03 09:28:38,575 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:28:38,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:38,580 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-03 09:28:38,594 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:28:38,594 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:28:38,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:28:38,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629085985] [2025-03-03 09:28:38,595 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 09:28:38,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:38,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:38,597 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:28:38,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-03-03 09:28:38,642 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 57 statements into 2 equivalence classes. [2025-03-03 09:28:39,129 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:28:39,129 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 09:28:39,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:39,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 92 conjuncts are in the unsatisfiable core [2025-03-03 09:28:39,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:39,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:28:39,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:28:39,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,291 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,293 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:39,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2025-03-03 09:28:39,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,334 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:39,335 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 44 [2025-03-03 09:28:39,586 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,625 INFO L349 Elim1Store]: treesize reduction 156, result has 18.3 percent of original size [2025-03-03 09:28:39,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 14 case distinctions, treesize of input 66 treesize of output 62 [2025-03-03 09:28:39,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,978 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,980 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:39,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:40,014 INFO L349 Elim1Store]: treesize reduction 80, result has 27.9 percent of original size [2025-03-03 09:28:40,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 9 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 30 case distinctions, treesize of input 88 treesize of output 120 [2025-03-03 09:28:40,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:40,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:40,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:40,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:40,970 INFO L349 Elim1Store]: treesize reduction 28, result has 65.9 percent of original size [2025-03-03 09:28:40,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 116 treesize of output 107 [2025-03-03 09:28:41,262 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 24 proven. 44 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-03 09:28:41,262 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:42,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:42,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029992708] [2025-03-03 09:28:42,351 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:28:42,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629085985] [2025-03-03 09:28:42,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629085985] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:42,351 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:28:42,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31] total 31 [2025-03-03 09:28:42,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687963097] [2025-03-03 09:28:42,351 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:42,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 09:28:42,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:42,352 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 09:28:42,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1649, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 09:28:42,353 INFO L87 Difference]: Start difference. First operand 97 states and 114 transitions. Second operand has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 09:28:43,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:43,821 INFO L93 Difference]: Finished difference Result 163 states and 194 transitions. [2025-03-03 09:28:43,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2025-03-03 09:28:43,822 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2025-03-03 09:28:43,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:43,823 INFO L225 Difference]: With dead ends: 163 [2025-03-03 09:28:43,823 INFO L226 Difference]: Without dead ends: 150 [2025-03-03 09:28:43,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 6 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 985 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=368, Invalid=2494, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 09:28:43,824 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 68 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 297 SdHoareTripleChecker+Invalid, 1029 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:43,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 297 Invalid, 1029 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-03 09:28:43,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2025-03-03 09:28:43,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 99. [2025-03-03 09:28:43,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 84 states have (on average 1.1666666666666667) internal successors, (98), 84 states have internal predecessors, (98), 9 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2025-03-03 09:28:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 116 transitions. [2025-03-03 09:28:43,853 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 116 transitions. Word has length 57 [2025-03-03 09:28:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:43,853 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 116 transitions. [2025-03-03 09:28:43,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 28 states have internal predecessors, (40), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-03 09:28:43,853 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 116 transitions. [2025-03-03 09:28:43,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:28:43,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:43,853 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:43,861 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2025-03-03 09:28:44,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:44,054 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:44,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:44,055 INFO L85 PathProgramCache]: Analyzing trace with hash -2084035589, now seen corresponding path program 10 times [2025-03-03 09:28:44,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:44,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592195896] [2025-03-03 09:28:44,055 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:28:44,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:44,061 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-03-03 09:28:44,080 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:28:44,080 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:28:44,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:28:44,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [651011271] [2025-03-03 09:28:44,084 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 09:28:44,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:44,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:44,089 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:28:44,089 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2025-03-03 09:28:44,138 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 57 statements into 2 equivalence classes. [2025-03-03 09:28:45,936 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:28:45,936 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 09:28:45,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:45,939 WARN L254 TraceCheckSpWp]: Trace formula consists of 260 conjuncts, 142 conjuncts are in the unsatisfiable core [2025-03-03 09:28:45,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:46,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-03 09:28:46,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-03 09:28:46,094 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:46,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:28:46,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:46,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 38 [2025-03-03 09:28:46,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:46,258 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 40 treesize of output 48 [2025-03-03 09:28:46,312 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:46,312 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47 treesize of output 58 [2025-03-03 09:28:46,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:46,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 68 [2025-03-03 09:28:46,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:46,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 78 [2025-03-03 09:28:46,586 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:46,586 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 88 [2025-03-03 09:28:47,304 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:47,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:47,308 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:47,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:47,311 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:47,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:47,391 INFO L349 Elim1Store]: treesize reduction 204, result has 27.9 percent of original size [2025-03-03 09:28:47,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 18 select indices, 18 select index equivalence classes, 42 disjoint index pairs (out of 153 index pairs), introduced 18 new quantified variables, introduced 159 case distinctions, treesize of input 144 treesize of output 230 [2025-03-03 09:28:48,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:48,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 133 treesize of output 57 [2025-03-03 09:28:49,026 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 8 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:28:49,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:28:51,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 09:28:51,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592195896] [2025-03-03 09:28:51,798 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-03 09:28:51,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651011271] [2025-03-03 09:28:51,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651011271] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 09:28:51,798 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-03 09:28:51,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [44] total 44 [2025-03-03 09:28:51,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1594497917] [2025-03-03 09:28:51,798 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-03 09:28:51,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-03 09:28:51,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 09:28:51,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-03 09:28:51,800 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=428, Invalid=3604, Unknown=0, NotChecked=0, Total=4032 [2025-03-03 09:28:51,800 INFO L87 Difference]: Start difference. First operand 99 states and 116 transitions. Second operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 40 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:28:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 09:28:53,253 INFO L93 Difference]: Finished difference Result 161 states and 196 transitions. [2025-03-03 09:28:53,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-03 09:28:53,253 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 40 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 57 [2025-03-03 09:28:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 09:28:53,254 INFO L225 Difference]: With dead ends: 161 [2025-03-03 09:28:53,254 INFO L226 Difference]: Without dead ends: 158 [2025-03-03 09:28:53,255 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1769 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=474, Invalid=4218, Unknown=0, NotChecked=0, Total=4692 [2025-03-03 09:28:53,255 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 75 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 1731 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 09:28:53,256 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 407 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1731 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 09:28:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2025-03-03 09:28:53,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 137. [2025-03-03 09:28:53,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 119 states have (on average 1.1932773109243697) internal successors, (142), 119 states have internal predecessors, (142), 11 states have call successors, (11), 6 states have call predecessors, (11), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-03 09:28:53,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 164 transitions. [2025-03-03 09:28:53,307 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 164 transitions. Word has length 57 [2025-03-03 09:28:53,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 09:28:53,307 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 164 transitions. [2025-03-03 09:28:53,308 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 40 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-03 09:28:53,308 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 164 transitions. [2025-03-03 09:28:53,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-03 09:28:53,308 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 09:28:53,308 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 09:28:53,316 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2025-03-03 09:28:53,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:53,509 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 09:28:53,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 09:28:53,509 INFO L85 PathProgramCache]: Analyzing trace with hash 172875418, now seen corresponding path program 5 times [2025-03-03 09:28:53,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 09:28:53,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861771226] [2025-03-03 09:28:53,509 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:28:53,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 09:28:53,515 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 11 equivalence classes. [2025-03-03 09:28:53,538 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:28:53,538 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 09:28:53,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-03 09:28:53,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [642192901] [2025-03-03 09:28:53,539 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 09:28:53,539 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 09:28:53,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 09:28:53,544 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 09:28:53,545 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2025-03-03 09:28:53,603 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 57 statements into 11 equivalence classes. [2025-03-03 09:28:54,825 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 57 of 57 statements. [2025-03-03 09:28:54,826 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 09:28:54,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 09:28:54,828 WARN L254 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 132 conjuncts are in the unsatisfiable core [2025-03-03 09:28:54,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 09:28:54,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-03 09:28:54,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2025-03-03 09:28:54,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:54,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2025-03-03 09:28:54,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:54,987 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2025-03-03 09:28:54,987 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 35 treesize of output 40 [2025-03-03 09:28:55,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,019 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,023 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-03 09:28:55,023 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 46 treesize of output 54 [2025-03-03 09:28:55,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-03 09:28:55,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:55,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 57 treesize of output 68 [2025-03-03 09:28:55,185 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:55,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 21 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 54 treesize of output 68 [2025-03-03 09:28:55,243 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:55,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 28 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 61 treesize of output 78 [2025-03-03 09:28:55,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:28:55,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 36 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 68 treesize of output 88 [2025-03-03 09:28:55,843 INFO L349 Elim1Store]: treesize reduction 324, result has 16.5 percent of original size [2025-03-03 09:28:55,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 10 select indices, 10 select index equivalence classes, 36 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 54 case distinctions, treesize of input 91 treesize of output 104 [2025-03-03 09:28:56,621 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 2 proven. 150 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-03 09:28:56,621 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 09:29:05,796 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 785 treesize of output 767 [2025-03-03 09:29:06,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-03 09:29:06,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 713444443260871 treesize of output 676061047916487