./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann03.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/recursive/Ackermann03.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 c244f72db2906c596b7f122d769fc1464836d7d05d9227ee4269773d59ed10bd --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:32:12,781 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:32:12,831 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:32:12,836 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:32:12,840 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:32:12,862 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:32:12,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:32:12,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:32:12,863 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:32:12,863 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:32:12,863 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:32:12,863 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:32:12,863 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:32:12,863 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:32:12,863 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:32:12,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:32:12,863 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:32:12,863 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:32:12,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:32:12,863 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:32:12,867 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:32:12,868 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:32:12,868 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:32:12,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:32:12,869 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:32:12,869 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 -> c244f72db2906c596b7f122d769fc1464836d7d05d9227ee4269773d59ed10bd [2025-03-03 14:32:13,223 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:32:13,232 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:32:13,236 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:32:13,237 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:32:13,238 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:32:13,238 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann03.c [2025-03-03 14:32:14,390 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af719b62a/8858d99af1704aedbd8a1a2cd2feb3fe/FLAGaa06d08c7 [2025-03-03 14:32:14,571 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:32:14,571 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c [2025-03-03 14:32:14,581 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af719b62a/8858d99af1704aedbd8a1a2cd2feb3fe/FLAGaa06d08c7 [2025-03-03 14:32:14,959 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/af719b62a/8858d99af1704aedbd8a1a2cd2feb3fe [2025-03-03 14:32:14,963 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:32:14,964 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:32:14,965 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:32:14,965 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:32:14,968 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:32:14,969 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:32:14" (1/1) ... [2025-03-03 14:32:14,970 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f69b757 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:14, skipping insertion in model container [2025-03-03 14:32:14,970 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:32:14" (1/1) ... [2025-03-03 14:32:14,983 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:32:15,094 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann03.c[1168,1181] [2025-03-03 14:32:15,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:32:15,105 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:32:15,117 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/recursive/Ackermann03.c[1168,1181] [2025-03-03 14:32:15,117 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:32:15,128 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:32:15,128 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15 WrapperNode [2025-03-03 14:32:15,128 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:32:15,129 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:32:15,129 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:32:15,129 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:32:15,134 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (1/1) ... [2025-03-03 14:32:15,138 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (1/1) ... [2025-03-03 14:32:15,148 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2025-03-03 14:32:15,148 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:32:15,149 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:32:15,149 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:32:15,149 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:32:15,154 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (1/1) ... [2025-03-03 14:32:15,154 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (1/1) ... [2025-03-03 14:32:15,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (1/1) ... [2025-03-03 14:32:15,162 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-03 14:32:15,163 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (1/1) ... [2025-03-03 14:32:15,163 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (1/1) ... [2025-03-03 14:32:15,165 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (1/1) ... [2025-03-03 14:32:15,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (1/1) ... [2025-03-03 14:32:15,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (1/1) ... [2025-03-03 14:32:15,166 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (1/1) ... [2025-03-03 14:32:15,167 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:32:15,168 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:32:15,168 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:32:15,168 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:32:15,169 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (1/1) ... [2025-03-03 14:32:15,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:32:15,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:15,198 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 14:32:15,200 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 14:32:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:32:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:32:15,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:32:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2025-03-03 14:32:15,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2025-03-03 14:32:15,217 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:32:15,257 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:32:15,259 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:32:15,355 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L23: havoc #t~ret5;havoc #t~ret6; [2025-03-03 14:32:15,358 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L21: havoc #t~ret4; [2025-03-03 14:32:15,366 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2025-03-03 14:32:15,366 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:32:15,377 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:32:15,377 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:32:15,378 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:32:15 BoogieIcfgContainer [2025-03-03 14:32:15,378 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:32:15,380 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:32:15,380 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:32:15,383 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:32:15,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:32:14" (1/3) ... [2025-03-03 14:32:15,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f33309b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:32:15, skipping insertion in model container [2025-03-03 14:32:15,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:32:15" (2/3) ... [2025-03-03 14:32:15,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f33309b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:32:15, skipping insertion in model container [2025-03-03 14:32:15,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:32:15" (3/3) ... [2025-03-03 14:32:15,386 INFO L128 eAbstractionObserver]: Analyzing ICFG Ackermann03.c [2025-03-03 14:32:15,397 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:32:15,399 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Ackermann03.c that has 2 procedures, 23 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:32:15,440 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:32:15,450 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;@758ebfe2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:32:15,450 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:32:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:32:15,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-03 14:32:15,459 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:15,459 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:15,460 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:15,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:15,464 INFO L85 PathProgramCache]: Analyzing trace with hash -640999361, now seen corresponding path program 1 times [2025-03-03 14:32:15,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:15,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938958356] [2025-03-03 14:32:15,470 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:15,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:15,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-03 14:32:15,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-03 14:32:15,538 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:15,538 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:15,639 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 14:32:15,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:15,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938958356] [2025-03-03 14:32:15,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938958356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:32:15,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:32:15,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:32:15,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422121754] [2025-03-03 14:32:15,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:32:15,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:32:15,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:15,657 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:32:15,658 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:32:15,659 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 14:32:15,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:15,781 INFO L93 Difference]: Finished difference Result 37 states and 53 transitions. [2025-03-03 14:32:15,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:32:15,783 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 12 [2025-03-03 14:32:15,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:15,787 INFO L225 Difference]: With dead ends: 37 [2025-03-03 14:32:15,788 INFO L226 Difference]: Without dead ends: 27 [2025-03-03 14:32:15,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 14:32:15,792 INFO L435 NwaCegarLoop]: 25 mSDtfsCounter, 10 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:15,796 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 71 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:15,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-03 14:32:15,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-03 14:32:15,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 17 states have internal predecessors, (19), 5 states have call successors, (5), 1 states have call predecessors, (5), 2 states have return successors, (9), 6 states have call predecessors, (9), 5 states have call successors, (9) [2025-03-03 14:32:15,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 33 transitions. [2025-03-03 14:32:15,827 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 33 transitions. Word has length 12 [2025-03-03 14:32:15,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:15,827 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 33 transitions. [2025-03-03 14:32:15,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 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 14:32:15,828 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 33 transitions. [2025-03-03 14:32:15,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2025-03-03 14:32:15,830 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:15,830 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:15,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:32:15,831 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:15,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:15,831 INFO L85 PathProgramCache]: Analyzing trace with hash -1861650847, now seen corresponding path program 1 times [2025-03-03 14:32:15,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:15,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69743544] [2025-03-03 14:32:15,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:15,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:15,839 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 14:32:15,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 14:32:15,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:15,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:15,925 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:32:15,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:15,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69743544] [2025-03-03 14:32:15,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69743544] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:15,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1392862653] [2025-03-03 14:32:15,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:15,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:15,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:15,928 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 14:32:15,929 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 14:32:15,960 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 19 statements into 1 equivalence classes. [2025-03-03 14:32:15,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 19 of 19 statements. [2025-03-03 14:32:15,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:15,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:15,973 INFO L256 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 14:32:15,977 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:16,025 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:32:16,025 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:16,098 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:32:16,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1392862653] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:16,098 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:16,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-03-03 14:32:16,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927269845] [2025-03-03 14:32:16,099 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:16,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:32:16,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:16,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:32:16,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:32:16,101 INFO L87 Difference]: Start difference. First operand 25 states and 33 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 14:32:16,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:16,203 INFO L93 Difference]: Finished difference Result 69 states and 124 transitions. [2025-03-03 14:32:16,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-03 14:32:16,204 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 19 [2025-03-03 14:32:16,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:16,205 INFO L225 Difference]: With dead ends: 69 [2025-03-03 14:32:16,205 INFO L226 Difference]: Without dead ends: 45 [2025-03-03 14:32:16,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:32:16,207 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 17 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:16,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 66 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:16,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-03 14:32:16,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 41. [2025-03-03 14:32:16,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 28 states have internal predecessors, (31), 8 states have call successors, (8), 2 states have call predecessors, (8), 5 states have return successors, (27), 10 states have call predecessors, (27), 8 states have call successors, (27) [2025-03-03 14:32:16,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 66 transitions. [2025-03-03 14:32:16,216 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 66 transitions. Word has length 19 [2025-03-03 14:32:16,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:16,216 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 66 transitions. [2025-03-03 14:32:16,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-03-03 14:32:16,217 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 66 transitions. [2025-03-03 14:32:16,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-03 14:32:16,220 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:16,220 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:16,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 14:32:16,420 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 14:32:16,421 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:16,421 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:16,421 INFO L85 PathProgramCache]: Analyzing trace with hash -1457087151, now seen corresponding path program 1 times [2025-03-03 14:32:16,421 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:16,421 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004983201] [2025-03-03 14:32:16,421 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:16,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:16,428 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 14:32:16,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 14:32:16,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:16,453 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:16,622 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:32:16,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:16,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004983201] [2025-03-03 14:32:16,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004983201] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:16,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [516342626] [2025-03-03 14:32:16,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:32:16,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:16,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:16,624 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 14:32:16,625 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 14:32:16,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-03 14:32:16,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-03 14:32:16,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:16,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:16,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:32:16,677 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:16,748 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 24 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-03 14:32:16,749 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:17,168 INFO L134 CoverageAnalysis]: Checked inductivity of 67 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 14:32:17,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [516342626] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:17,168 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:17,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 8 [2025-03-03 14:32:17,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865319474] [2025-03-03 14:32:17,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:17,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-03 14:32:17,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:17,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-03 14:32:17,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-03-03 14:32:17,170 INFO L87 Difference]: Start difference. First operand 41 states and 66 transitions. Second operand has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 14:32:17,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:17,260 INFO L93 Difference]: Finished difference Result 62 states and 124 transitions. [2025-03-03 14:32:17,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-03 14:32:17,261 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) Word has length 45 [2025-03-03 14:32:17,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:17,263 INFO L225 Difference]: With dead ends: 62 [2025-03-03 14:32:17,263 INFO L226 Difference]: Without dead ends: 58 [2025-03-03 14:32:17,263 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 5 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:32:17,264 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 22 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:17,264 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 68 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:17,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2025-03-03 14:32:17,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 54. [2025-03-03 14:32:17,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 36 states have internal predecessors, (39), 10 states have call successors, (10), 2 states have call predecessors, (10), 8 states have return successors, (60), 15 states have call predecessors, (60), 10 states have call successors, (60) [2025-03-03 14:32:17,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 109 transitions. [2025-03-03 14:32:17,286 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 109 transitions. Word has length 45 [2025-03-03 14:32:17,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:17,287 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 109 transitions. [2025-03-03 14:32:17,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.25) internal successors, (26), 8 states have internal predecessors, (26), 4 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (6), 2 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-03 14:32:17,287 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 109 transitions. [2025-03-03 14:32:17,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-03 14:32:17,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:17,292 INFO L218 NwaCegarLoop]: trace histogram [17, 17, 11, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:17,298 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 14:32:17,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-03 14:32:17,496 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:17,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:17,496 INFO L85 PathProgramCache]: Analyzing trace with hash 1906797306, now seen corresponding path program 2 times [2025-03-03 14:32:17,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:17,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802398006] [2025-03-03 14:32:17,497 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:32:17,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:17,508 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-03-03 14:32:17,529 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:32:17,529 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:32:17,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:17,770 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 157 proven. 146 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2025-03-03 14:32:17,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:17,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802398006] [2025-03-03 14:32:17,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802398006] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:17,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [404445063] [2025-03-03 14:32:17,772 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:32:17,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:17,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:17,774 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 14:32:17,775 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 14:32:17,813 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 119 statements into 2 equivalence classes. [2025-03-03 14:32:17,849 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 119 of 119 statements. [2025-03-03 14:32:17,850 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:32:17,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:17,851 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-03 14:32:17,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:17,996 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 360 proven. 86 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-03 14:32:17,997 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 669 backedges. 115 proven. 179 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-03 14:32:19,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [404445063] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:19,421 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:19,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 12, 15] total 30 [2025-03-03 14:32:19,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [658988310] [2025-03-03 14:32:19,421 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:19,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 14:32:19,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:19,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 14:32:19,423 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=100, Invalid=770, Unknown=0, NotChecked=0, Total=870 [2025-03-03 14:32:19,423 INFO L87 Difference]: Start difference. First operand 54 states and 109 transitions. Second operand has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 24 states have internal predecessors, (73), 10 states have call successors, (18), 2 states have call predecessors, (18), 14 states have return successors, (31), 18 states have call predecessors, (31), 10 states have call successors, (31) [2025-03-03 14:32:20,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:20,681 INFO L93 Difference]: Finished difference Result 348 states and 2271 transitions. [2025-03-03 14:32:20,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 14:32:20,682 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 24 states have internal predecessors, (73), 10 states have call successors, (18), 2 states have call predecessors, (18), 14 states have return successors, (31), 18 states have call predecessors, (31), 10 states have call successors, (31) Word has length 119 [2025-03-03 14:32:20,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:20,684 INFO L225 Difference]: With dead ends: 348 [2025-03-03 14:32:20,684 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 14:32:20,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 222 SyntacticMatches, 1 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1121 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1009, Invalid=4691, Unknown=0, NotChecked=0, Total=5700 [2025-03-03 14:32:20,698 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 19 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 924 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:20,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 292 Invalid, 924 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 14:32:20,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 14:32:20,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-03-03 14:32:20,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 34 states have internal predecessors, (35), 8 states have call successors, (8), 2 states have call predecessors, (8), 8 states have return successors, (18), 11 states have call predecessors, (18), 8 states have call successors, (18) [2025-03-03 14:32:20,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 61 transitions. [2025-03-03 14:32:20,711 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 61 transitions. Word has length 119 [2025-03-03 14:32:20,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:20,713 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 61 transitions. [2025-03-03 14:32:20,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.433333333333333) internal successors, (73), 24 states have internal predecessors, (73), 10 states have call successors, (18), 2 states have call predecessors, (18), 14 states have return successors, (31), 18 states have call predecessors, (31), 10 states have call successors, (31) [2025-03-03 14:32:20,714 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2025-03-03 14:32:20,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2025-03-03 14:32:20,718 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:20,718 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 9, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:20,726 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 14:32:20,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:20,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:20,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:20,920 INFO L85 PathProgramCache]: Analyzing trace with hash -2014828494, now seen corresponding path program 3 times [2025-03-03 14:32:20,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:20,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2059466509] [2025-03-03 14:32:20,920 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:32:20,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:20,933 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 13 equivalence classes. [2025-03-03 14:32:20,949 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 72 of 105 statements. [2025-03-03 14:32:20,949 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-03 14:32:20,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:21,270 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 192 proven. 78 refuted. 0 times theorem prover too weak. 238 trivial. 0 not checked. [2025-03-03 14:32:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:21,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2059466509] [2025-03-03 14:32:21,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2059466509] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:21,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1590787745] [2025-03-03 14:32:21,271 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:32:21,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:21,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:21,273 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 14:32:21,275 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 14:32:21,315 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 105 statements into 13 equivalence classes. [2025-03-03 14:32:21,337 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) and asserted 72 of 105 statements. [2025-03-03 14:32:21,338 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2025-03-03 14:32:21,338 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:21,340 INFO L256 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-03 14:32:21,342 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:21,454 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 190 proven. 71 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-03 14:32:21,454 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:22,663 INFO L134 CoverageAnalysis]: Checked inductivity of 508 backedges. 208 proven. 61 refuted. 0 times theorem prover too weak. 239 trivial. 0 not checked. [2025-03-03 14:32:22,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1590787745] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:22,663 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:22,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 12, 15] total 30 [2025-03-03 14:32:22,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905083145] [2025-03-03 14:32:22,663 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:22,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2025-03-03 14:32:22,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:22,665 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2025-03-03 14:32:22,666 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=753, Unknown=0, NotChecked=0, Total=870 [2025-03-03 14:32:22,666 INFO L87 Difference]: Start difference. First operand 48 states and 61 transitions. Second operand has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 25 states have internal predecessors, (67), 12 states have call successors, (15), 1 states have call predecessors, (15), 14 states have return successors, (27), 15 states have call predecessors, (27), 12 states have call successors, (27) [2025-03-03 14:32:23,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:23,038 INFO L93 Difference]: Finished difference Result 112 states and 160 transitions. [2025-03-03 14:32:23,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 14:32:23,039 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 25 states have internal predecessors, (67), 12 states have call successors, (15), 1 states have call predecessors, (15), 14 states have return successors, (27), 15 states have call predecessors, (27), 12 states have call successors, (27) Word has length 105 [2025-03-03 14:32:23,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:23,040 INFO L225 Difference]: With dead ends: 112 [2025-03-03 14:32:23,041 INFO L226 Difference]: Without dead ends: 61 [2025-03-03 14:32:23,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 193 SyntacticMatches, 5 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 457 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=407, Invalid=1755, Unknown=0, NotChecked=0, Total=2162 [2025-03-03 14:32:23,042 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 35 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:23,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 258 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:32:23,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-03-03 14:32:23,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 55. [2025-03-03 14:32:23,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 37 states have (on average 1.135135135135135) internal successors, (42), 39 states have internal predecessors, (42), 9 states have call successors, (9), 4 states have call predecessors, (9), 8 states have return successors, (16), 11 states have call predecessors, (16), 9 states have call successors, (16) [2025-03-03 14:32:23,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 67 transitions. [2025-03-03 14:32:23,049 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 67 transitions. Word has length 105 [2025-03-03 14:32:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:23,049 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 67 transitions. [2025-03-03 14:32:23,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.2333333333333334) internal successors, (67), 25 states have internal predecessors, (67), 12 states have call successors, (15), 1 states have call predecessors, (15), 14 states have return successors, (27), 15 states have call predecessors, (27), 12 states have call successors, (27) [2025-03-03 14:32:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 67 transitions. [2025-03-03 14:32:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:32:23,051 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:23,051 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 12, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:23,057 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 14:32:23,251 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:23,251 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:23,253 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:23,253 INFO L85 PathProgramCache]: Analyzing trace with hash -1926600805, now seen corresponding path program 4 times [2025-03-03 14:32:23,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:23,253 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731613460] [2025-03-03 14:32:23,253 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:32:23,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:23,266 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 144 statements into 2 equivalence classes. [2025-03-03 14:32:23,286 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:32:23,286 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:32:23,286 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:23,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 371 proven. 220 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2025-03-03 14:32:23,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:23,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731613460] [2025-03-03 14:32:23,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731613460] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:23,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583762797] [2025-03-03 14:32:23,880 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:32:23,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:23,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:23,882 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 14:32:23,884 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 14:32:23,941 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 144 statements into 2 equivalence classes. [2025-03-03 14:32:23,975 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 144 of 144 statements. [2025-03-03 14:32:23,976 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:32:23,976 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:23,977 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-03-03 14:32:23,980 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:24,051 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 367 proven. 209 refuted. 0 times theorem prover too weak. 454 trivial. 0 not checked. [2025-03-03 14:32:24,051 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:27,108 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 410 proven. 201 refuted. 0 times theorem prover too weak. 419 trivial. 0 not checked. [2025-03-03 14:32:27,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583762797] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:27,108 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:27,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 26] total 36 [2025-03-03 14:32:27,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987918893] [2025-03-03 14:32:27,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:27,109 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 14:32:27,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:27,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 14:32:27,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=161, Invalid=1099, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:32:27,110 INFO L87 Difference]: Start difference. First operand 55 states and 67 transitions. Second operand has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 29 states have internal predecessors, (74), 14 states have call successors, (17), 1 states have call predecessors, (17), 16 states have return successors, (30), 18 states have call predecessors, (30), 14 states have call successors, (30) [2025-03-03 14:32:27,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:27,577 INFO L93 Difference]: Finished difference Result 124 states and 159 transitions. [2025-03-03 14:32:27,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-03 14:32:27,578 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 29 states have internal predecessors, (74), 14 states have call successors, (17), 1 states have call predecessors, (17), 16 states have return successors, (30), 18 states have call predecessors, (30), 14 states have call successors, (30) Word has length 144 [2025-03-03 14:32:27,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:27,580 INFO L225 Difference]: With dead ends: 124 [2025-03-03 14:32:27,580 INFO L226 Difference]: Without dead ends: 74 [2025-03-03 14:32:27,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 272 SyntacticMatches, 10 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=650, Invalid=3010, Unknown=0, NotChecked=0, Total=3660 [2025-03-03 14:32:27,582 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 39 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:27,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 281 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-03 14:32:27,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-03 14:32:27,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 60. [2025-03-03 14:32:27,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 10 states have call successors, (10), 4 states have call predecessors, (10), 9 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2025-03-03 14:32:27,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 75 transitions. [2025-03-03 14:32:27,595 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 75 transitions. Word has length 144 [2025-03-03 14:32:27,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:27,596 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 75 transitions. [2025-03-03 14:32:27,596 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 2.0555555555555554) internal successors, (74), 29 states have internal predecessors, (74), 14 states have call successors, (17), 1 states have call predecessors, (17), 16 states have return successors, (30), 18 states have call predecessors, (30), 14 states have call successors, (30) [2025-03-03 14:32:27,596 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 75 transitions. [2025-03-03 14:32:27,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2025-03-03 14:32:27,597 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:27,597 INFO L218 NwaCegarLoop]: trace histogram [21, 21, 12, 9, 8, 8, 8, 8, 8, 8, 8, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:27,603 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 14:32:27,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:27,798 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:27,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:27,798 INFO L85 PathProgramCache]: Analyzing trace with hash -70666415, now seen corresponding path program 5 times [2025-03-03 14:32:27,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:27,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847818068] [2025-03-03 14:32:27,798 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:32:27,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:27,809 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 144 statements into 14 equivalence classes. [2025-03-03 14:32:27,824 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 79 of 144 statements. [2025-03-03 14:32:27,824 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-03 14:32:27,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:28,049 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 146 proven. 371 refuted. 0 times theorem prover too weak. 513 trivial. 0 not checked. [2025-03-03 14:32:28,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847818068] [2025-03-03 14:32:28,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [847818068] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:28,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700361809] [2025-03-03 14:32:28,050 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:32:28,050 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:28,050 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:28,052 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 14:32:28,053 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 14:32:28,140 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 144 statements into 14 equivalence classes. [2025-03-03 14:32:28,162 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) and asserted 79 of 144 statements. [2025-03-03 14:32:28,162 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2025-03-03 14:32:28,162 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:28,163 INFO L256 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 21 conjuncts are in the unsatisfiable core [2025-03-03 14:32:28,165 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:28,224 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 595 proven. 114 refuted. 0 times theorem prover too weak. 321 trivial. 0 not checked. [2025-03-03 14:32:28,226 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:29,466 INFO L134 CoverageAnalysis]: Checked inductivity of 1030 backedges. 160 proven. 360 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-03-03 14:32:29,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700361809] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:29,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:29,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 14, 17] total 22 [2025-03-03 14:32:29,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22313450] [2025-03-03 14:32:29,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:29,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-03 14:32:29,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:29,467 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-03 14:32:29,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=381, Unknown=0, NotChecked=0, Total=462 [2025-03-03 14:32:29,468 INFO L87 Difference]: Start difference. First operand 60 states and 75 transitions. Second operand has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 19 states have internal predecessors, (67), 12 states have call successors, (18), 2 states have call predecessors, (18), 11 states have return successors, (27), 11 states have call predecessors, (27), 12 states have call successors, (27) [2025-03-03 14:32:29,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:29,687 INFO L93 Difference]: Finished difference Result 120 states and 154 transitions. [2025-03-03 14:32:29,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 14:32:29,691 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 19 states have internal predecessors, (67), 12 states have call successors, (18), 2 states have call predecessors, (18), 11 states have return successors, (27), 11 states have call predecessors, (27), 12 states have call successors, (27) Word has length 144 [2025-03-03 14:32:29,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:29,693 INFO L225 Difference]: With dead ends: 120 [2025-03-03 14:32:29,693 INFO L226 Difference]: Without dead ends: 65 [2025-03-03 14:32:29,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 275 SyntacticMatches, 11 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=337, Invalid=1223, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 14:32:29,694 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 48 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:29,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 136 Invalid, 255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 194 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:29,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-03 14:32:29,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 60. [2025-03-03 14:32:29,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.125) internal successors, (45), 42 states have internal predecessors, (45), 10 states have call successors, (10), 4 states have call predecessors, (10), 9 states have return successors, (18), 13 states have call predecessors, (18), 10 states have call successors, (18) [2025-03-03 14:32:29,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2025-03-03 14:32:29,700 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 73 transitions. Word has length 144 [2025-03-03 14:32:29,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:29,700 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 73 transitions. [2025-03-03 14:32:29,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 3.0454545454545454) internal successors, (67), 19 states have internal predecessors, (67), 12 states have call successors, (18), 2 states have call predecessors, (18), 11 states have return successors, (27), 11 states have call predecessors, (27), 12 states have call successors, (27) [2025-03-03 14:32:29,701 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 73 transitions. [2025-03-03 14:32:29,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2025-03-03 14:32:29,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:29,701 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 13, 10, 9, 9, 9, 9, 9, 9, 9, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:29,709 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 14:32:29,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:29,902 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:29,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:29,902 INFO L85 PathProgramCache]: Analyzing trace with hash 1579822898, now seen corresponding path program 6 times [2025-03-03 14:32:29,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:29,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577347212] [2025-03-03 14:32:29,903 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:32:29,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:29,913 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 157 statements into 15 equivalence classes. [2025-03-03 14:32:29,947 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 14:32:29,948 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-03-03 14:32:29,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:30,791 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 291 proven. 522 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-03-03 14:32:30,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:30,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577347212] [2025-03-03 14:32:30,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577347212] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:30,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [286539204] [2025-03-03 14:32:30,791 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:32:30,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:30,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:30,794 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 14:32:30,796 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 14:32:30,906 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 157 statements into 15 equivalence classes. [2025-03-03 14:32:30,949 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) and asserted 157 of 157 statements. [2025-03-03 14:32:30,949 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 15 check-sat command(s) [2025-03-03 14:32:30,949 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:30,951 INFO L256 TraceCheckSpWp]: Trace formula consists of 478 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-03 14:32:30,953 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:31,111 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 421 proven. 286 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2025-03-03 14:32:31,111 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:34,397 INFO L134 CoverageAnalysis]: Checked inductivity of 1246 backedges. 467 proven. 286 refuted. 0 times theorem prover too weak. 493 trivial. 0 not checked. [2025-03-03 14:32:34,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [286539204] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:34,398 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:34,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 20, 27] total 48 [2025-03-03 14:32:34,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846806907] [2025-03-03 14:32:34,398 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:34,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2025-03-03 14:32:34,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:34,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2025-03-03 14:32:34,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=2014, Unknown=0, NotChecked=0, Total=2256 [2025-03-03 14:32:34,400 INFO L87 Difference]: Start difference. First operand 60 states and 73 transitions. Second operand has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 22 states have call successors, (25), 1 states have call predecessors, (25), 23 states have return successors, (43), 25 states have call predecessors, (43), 22 states have call successors, (43) [2025-03-03 14:32:35,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:35,154 INFO L93 Difference]: Finished difference Result 147 states and 196 transitions. [2025-03-03 14:32:35,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2025-03-03 14:32:35,155 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 22 states have call successors, (25), 1 states have call predecessors, (25), 23 states have return successors, (43), 25 states have call predecessors, (43), 22 states have call successors, (43) Word has length 157 [2025-03-03 14:32:35,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:35,156 INFO L225 Difference]: With dead ends: 147 [2025-03-03 14:32:35,156 INFO L226 Difference]: Without dead ends: 79 [2025-03-03 14:32:35,158 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 295 SyntacticMatches, 14 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1563 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=915, Invalid=5091, Unknown=0, NotChecked=0, Total=6006 [2025-03-03 14:32:35,158 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 121 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 1028 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 1176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:35,158 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 454 Invalid, 1176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1028 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 14:32:35,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-03 14:32:35,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 69. [2025-03-03 14:32:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.108695652173913) internal successors, (51), 48 states have internal predecessors, (51), 11 states have call successors, (11), 5 states have call predecessors, (11), 11 states have return successors, (22), 15 states have call predecessors, (22), 11 states have call successors, (22) [2025-03-03 14:32:35,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 84 transitions. [2025-03-03 14:32:35,168 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 84 transitions. Word has length 157 [2025-03-03 14:32:35,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:35,169 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 84 transitions. [2025-03-03 14:32:35,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 48 states have (on average 2.1666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 22 states have call successors, (25), 1 states have call predecessors, (25), 23 states have return successors, (43), 25 states have call predecessors, (43), 22 states have call successors, (43) [2025-03-03 14:32:35,170 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2025-03-03 14:32:35,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2025-03-03 14:32:35,172 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:35,172 INFO L218 NwaCegarLoop]: trace histogram [25, 25, 14, 11, 10, 10, 10, 10, 10, 10, 10, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:35,179 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 14:32:35,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:35,376 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:35,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:35,377 INFO L85 PathProgramCache]: Analyzing trace with hash -682904789, now seen corresponding path program 7 times [2025-03-03 14:32:35,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:35,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239125230] [2025-03-03 14:32:35,377 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:32:35,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:35,385 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 14:32:35,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 14:32:35,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:35,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:35,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 495 proven. 368 refuted. 0 times theorem prover too weak. 620 trivial. 0 not checked. [2025-03-03 14:32:35,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:35,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239125230] [2025-03-03 14:32:35,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239125230] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:35,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1995565037] [2025-03-03 14:32:35,872 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:32:35,872 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:35,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:35,874 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 14:32:35,875 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 14:32:36,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 170 statements into 1 equivalence classes. [2025-03-03 14:32:36,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 170 of 170 statements. [2025-03-03 14:32:36,052 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:32:36,052 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:36,054 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 37 conjuncts are in the unsatisfiable core [2025-03-03 14:32:36,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:36,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 477 proven. 372 refuted. 0 times theorem prover too weak. 634 trivial. 0 not checked. [2025-03-03 14:32:36,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:39,652 INFO L134 CoverageAnalysis]: Checked inductivity of 1483 backedges. 525 proven. 384 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2025-03-03 14:32:39,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1995565037] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:39,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:39,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 28] total 32 [2025-03-03 14:32:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871080108] [2025-03-03 14:32:39,653 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:39,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-03-03 14:32:39,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:39,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-03-03 14:32:39,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=854, Unknown=0, NotChecked=0, Total=992 [2025-03-03 14:32:39,654 INFO L87 Difference]: Start difference. First operand 69 states and 84 transitions. Second operand has 32 states, 32 states have (on average 2.375) internal successors, (76), 28 states have internal predecessors, (76), 15 states have call successors, (18), 1 states have call predecessors, (18), 17 states have return successors, (32), 15 states have call predecessors, (32), 15 states have call successors, (32) [2025-03-03 14:32:40,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:40,309 INFO L93 Difference]: Finished difference Result 162 states and 209 transitions. [2025-03-03 14:32:40,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-03-03 14:32:40,309 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.375) internal successors, (76), 28 states have internal predecessors, (76), 15 states have call successors, (18), 1 states have call predecessors, (18), 17 states have return successors, (32), 15 states have call predecessors, (32), 15 states have call successors, (32) Word has length 170 [2025-03-03 14:32:40,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:40,311 INFO L225 Difference]: With dead ends: 162 [2025-03-03 14:32:40,311 INFO L226 Difference]: Without dead ends: 98 [2025-03-03 14:32:40,313 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 323 SyntacticMatches, 19 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1250 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=867, Invalid=3555, Unknown=0, NotChecked=0, Total=4422 [2025-03-03 14:32:40,313 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 104 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 249 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:40,313 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 249 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:32:40,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-03-03 14:32:40,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 74. [2025-03-03 14:32:40,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 49 states have (on average 1.1020408163265305) internal successors, (54), 51 states have internal predecessors, (54), 12 states have call successors, (12), 5 states have call predecessors, (12), 12 states have return successors, (26), 17 states have call predecessors, (26), 12 states have call successors, (26) [2025-03-03 14:32:40,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 92 transitions. [2025-03-03 14:32:40,321 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 92 transitions. Word has length 170 [2025-03-03 14:32:40,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:40,321 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 92 transitions. [2025-03-03 14:32:40,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.375) internal successors, (76), 28 states have internal predecessors, (76), 15 states have call successors, (18), 1 states have call predecessors, (18), 17 states have return successors, (32), 15 states have call predecessors, (32), 15 states have call successors, (32) [2025-03-03 14:32:40,321 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 92 transitions. [2025-03-03 14:32:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2025-03-03 14:32:40,323 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:40,323 INFO L218 NwaCegarLoop]: trace histogram [27, 27, 15, 12, 11, 11, 11, 11, 11, 11, 11, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:40,330 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 14:32:40,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2025-03-03 14:32:40,527 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:40,527 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:40,528 INFO L85 PathProgramCache]: Analyzing trace with hash -841014366, now seen corresponding path program 8 times [2025-03-03 14:32:40,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:40,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869547634] [2025-03-03 14:32:40,528 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:32:40,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:40,547 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 183 statements into 2 equivalence classes. [2025-03-03 14:32:40,569 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 14:32:40,571 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:32:40,571 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:41,134 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 600 proven. 156 refuted. 0 times theorem prover too weak. 985 trivial. 0 not checked. [2025-03-03 14:32:41,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:41,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869547634] [2025-03-03 14:32:41,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869547634] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:41,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929229136] [2025-03-03 14:32:41,135 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:32:41,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:41,135 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:41,136 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 14:32:41,137 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 14:32:41,304 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 183 statements into 2 equivalence classes. [2025-03-03 14:32:41,346 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 183 of 183 statements. [2025-03-03 14:32:41,347 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:32:41,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:41,349 INFO L256 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 79 conjuncts are in the unsatisfiable core [2025-03-03 14:32:41,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:41,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 583 proven. 158 refuted. 0 times theorem prover too weak. 1000 trivial. 0 not checked. [2025-03-03 14:32:41,407 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:42,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1741 backedges. 597 proven. 189 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2025-03-03 14:32:42,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929229136] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:42,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:42,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 23, 33] total 36 [2025-03-03 14:32:42,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423734907] [2025-03-03 14:32:42,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:42,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-03 14:32:42,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:42,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-03 14:32:42,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=89, Invalid=1171, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:32:42,162 INFO L87 Difference]: Start difference. First operand 74 states and 92 transitions. Second operand has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-03 14:32:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:44,694 INFO L93 Difference]: Finished difference Result 170 states and 241 transitions. [2025-03-03 14:32:44,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2025-03-03 14:32:44,695 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) Word has length 183 [2025-03-03 14:32:44,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:44,697 INFO L225 Difference]: With dead ends: 170 [2025-03-03 14:32:44,697 INFO L226 Difference]: Without dead ends: 126 [2025-03-03 14:32:44,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 365 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1865 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1147, Invalid=8165, Unknown=0, NotChecked=0, Total=9312 [2025-03-03 14:32:44,699 INFO L435 NwaCegarLoop]: 55 mSDtfsCounter, 203 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 3307 mSolverCounterSat, 261 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 612 SdHoareTripleChecker+Invalid, 3568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 261 IncrementalHoareTripleChecker+Valid, 3307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:44,699 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 612 Invalid, 3568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [261 Valid, 3307 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 14:32:44,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2025-03-03 14:32:44,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 90. [2025-03-03 14:32:44,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.1166666666666667) internal successors, (67), 61 states have internal predecessors, (67), 15 states have call successors, (15), 7 states have call predecessors, (15), 14 states have return successors, (37), 21 states have call predecessors, (37), 15 states have call successors, (37) [2025-03-03 14:32:44,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 119 transitions. [2025-03-03 14:32:44,712 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 119 transitions. Word has length 183 [2025-03-03 14:32:44,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:44,713 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 119 transitions. [2025-03-03 14:32:44,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.5555555555555556) internal successors, (56), 29 states have internal predecessors, (56), 6 states have call successors, (9), 1 states have call predecessors, (9), 14 states have return successors, (22), 13 states have call predecessors, (22), 6 states have call successors, (22) [2025-03-03 14:32:44,713 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 119 transitions. [2025-03-03 14:32:44,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-03-03 14:32:44,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:44,717 INFO L218 NwaCegarLoop]: trace histogram [29, 29, 16, 13, 12, 12, 12, 12, 12, 12, 12, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:44,724 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 14:32:44,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 14:32:44,917 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:44,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:44,918 INFO L85 PathProgramCache]: Analyzing trace with hash -857915717, now seen corresponding path program 9 times [2025-03-03 14:32:44,918 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:44,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1428069998] [2025-03-03 14:32:44,918 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:32:44,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:44,928 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 196 statements into 21 equivalence classes. [2025-03-03 14:32:44,962 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) and asserted 184 of 196 statements. [2025-03-03 14:32:44,963 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2025-03-03 14:32:44,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:46,205 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 761 proven. 546 refuted. 0 times theorem prover too weak. 713 trivial. 0 not checked. [2025-03-03 14:32:46,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1428069998] [2025-03-03 14:32:46,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1428069998] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:46,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034741488] [2025-03-03 14:32:46,205 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:32:46,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:46,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:46,207 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 14:32:46,208 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 14:32:46,367 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 196 statements into 21 equivalence classes. [2025-03-03 14:32:46,425 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) and asserted 184 of 196 statements. [2025-03-03 14:32:46,425 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 19 check-sat command(s) [2025-03-03 14:32:46,425 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:46,427 INFO L256 TraceCheckSpWp]: Trace formula consists of 559 conjuncts, 41 conjuncts are in the unsatisfiable core [2025-03-03 14:32:46,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:46,572 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 647 proven. 519 refuted. 0 times theorem prover too weak. 854 trivial. 0 not checked. [2025-03-03 14:32:46,572 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:50,388 INFO L134 CoverageAnalysis]: Checked inductivity of 2020 backedges. 685 proven. 580 refuted. 0 times theorem prover too weak. 755 trivial. 0 not checked. [2025-03-03 14:32:50,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034741488] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:50,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:50,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [40, 23, 32] total 56 [2025-03-03 14:32:50,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773847850] [2025-03-03 14:32:50,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:50,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2025-03-03 14:32:50,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:50,390 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2025-03-03 14:32:50,390 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=431, Invalid=2649, Unknown=0, NotChecked=0, Total=3080 [2025-03-03 14:32:50,391 INFO L87 Difference]: Start difference. First operand 90 states and 119 transitions. Second operand has 56 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 47 states have internal predecessors, (113), 26 states have call successors, (29), 1 states have call predecessors, (29), 26 states have return successors, (52), 27 states have call predecessors, (52), 26 states have call successors, (52) [2025-03-03 14:32:51,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:51,483 INFO L93 Difference]: Finished difference Result 267 states and 466 transitions. [2025-03-03 14:32:51,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-03-03 14:32:51,484 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 47 states have internal predecessors, (113), 26 states have call successors, (29), 1 states have call predecessors, (29), 26 states have return successors, (52), 27 states have call predecessors, (52), 26 states have call successors, (52) Word has length 196 [2025-03-03 14:32:51,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:51,486 INFO L225 Difference]: With dead ends: 267 [2025-03-03 14:32:51,486 INFO L226 Difference]: Without dead ends: 145 [2025-03-03 14:32:51,490 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 374 SyntacticMatches, 21 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2907 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=1410, Invalid=6780, Unknown=0, NotChecked=0, Total=8190 [2025-03-03 14:32:51,491 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 61 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 1692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:51,491 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 520 Invalid, 1692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-03 14:32:51,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2025-03-03 14:32:51,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 107. [2025-03-03 14:32:51,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 73 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 18 states have return successors, (39), 23 states have call predecessors, (39), 16 states have call successors, (39) [2025-03-03 14:32:51,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 131 transitions. [2025-03-03 14:32:51,503 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 131 transitions. Word has length 196 [2025-03-03 14:32:51,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:51,503 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 131 transitions. [2025-03-03 14:32:51,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 2.0545454545454547) internal successors, (113), 47 states have internal predecessors, (113), 26 states have call successors, (29), 1 states have call predecessors, (29), 26 states have return successors, (52), 27 states have call predecessors, (52), 26 states have call successors, (52) [2025-03-03 14:32:51,504 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 131 transitions. [2025-03-03 14:32:51,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 14:32:51,505 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:51,505 INFO L218 NwaCegarLoop]: trace histogram [31, 31, 17, 14, 13, 13, 13, 13, 13, 13, 13, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:51,514 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-03-03 14:32:51,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:32:51,706 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:51,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:51,706 INFO L85 PathProgramCache]: Analyzing trace with hash -2009742772, now seen corresponding path program 10 times [2025-03-03 14:32:51,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:51,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467036179] [2025-03-03 14:32:51,707 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:32:51,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:51,716 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 209 statements into 2 equivalence classes. [2025-03-03 14:32:51,729 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:32:51,729 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:32:51,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:52,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 260 proven. 800 refuted. 0 times theorem prover too weak. 1260 trivial. 0 not checked. [2025-03-03 14:32:52,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:52,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467036179] [2025-03-03 14:32:52,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467036179] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:52,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1325774366] [2025-03-03 14:32:52,033 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:32:52,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:52,033 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:52,035 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 14:32:52,037 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 14:32:52,314 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 209 statements into 2 equivalence classes. [2025-03-03 14:32:52,368 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 14:32:52,369 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:32:52,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:52,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 630 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-03 14:32:52,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:52,451 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 1340 proven. 196 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2025-03-03 14:32:52,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:32:54,232 INFO L134 CoverageAnalysis]: Checked inductivity of 2320 backedges. 274 proven. 806 refuted. 0 times theorem prover too weak. 1240 trivial. 0 not checked. [2025-03-03 14:32:54,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1325774366] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:32:54,232 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:32:54,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 16, 21] total 24 [2025-03-03 14:32:54,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668509742] [2025-03-03 14:32:54,233 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:32:54,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2025-03-03 14:32:54,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:32:54,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2025-03-03 14:32:54,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=458, Unknown=0, NotChecked=0, Total=552 [2025-03-03 14:32:54,235 INFO L87 Difference]: Start difference. First operand 107 states and 131 transitions. Second operand has 24 states, 24 states have (on average 3.125) internal successors, (75), 21 states have internal predecessors, (75), 15 states have call successors, (21), 2 states have call predecessors, (21), 12 states have return successors, (31), 12 states have call predecessors, (31), 15 states have call successors, (31) [2025-03-03 14:32:54,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:32:54,488 INFO L93 Difference]: Finished difference Result 215 states and 267 transitions. [2025-03-03 14:32:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-03 14:32:54,489 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 21 states have internal predecessors, (75), 15 states have call successors, (21), 2 states have call predecessors, (21), 12 states have return successors, (31), 12 states have call predecessors, (31), 15 states have call successors, (31) Word has length 209 [2025-03-03 14:32:54,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:32:54,490 INFO L225 Difference]: With dead ends: 215 [2025-03-03 14:32:54,490 INFO L226 Difference]: Without dead ends: 113 [2025-03-03 14:32:54,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 455 GetRequests, 405 SyntacticMatches, 13 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 340 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=287, Invalid=1195, Unknown=0, NotChecked=0, Total=1482 [2025-03-03 14:32:54,492 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 46 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:32:54,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 226 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:32:54,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-03-03 14:32:54,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 102. [2025-03-03 14:32:54,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 69 states have (on average 1.0579710144927537) internal successors, (73), 70 states have internal predecessors, (73), 15 states have call successors, (15), 10 states have call predecessors, (15), 17 states have return successors, (30), 21 states have call predecessors, (30), 15 states have call successors, (30) [2025-03-03 14:32:54,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 118 transitions. [2025-03-03 14:32:54,504 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 118 transitions. Word has length 209 [2025-03-03 14:32:54,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:32:54,505 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 118 transitions. [2025-03-03 14:32:54,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 3.125) internal successors, (75), 21 states have internal predecessors, (75), 15 states have call successors, (21), 2 states have call predecessors, (21), 12 states have return successors, (31), 12 states have call predecessors, (31), 15 states have call successors, (31) [2025-03-03 14:32:54,505 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 118 transitions. [2025-03-03 14:32:54,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 282 [2025-03-03 14:32:54,507 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:32:54,507 INFO L218 NwaCegarLoop]: trace histogram [42, 42, 23, 19, 18, 18, 18, 18, 18, 18, 18, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:32:54,517 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 14:32:54,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:32:54,711 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:32:54,711 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:32:54,711 INFO L85 PathProgramCache]: Analyzing trace with hash -1133567937, now seen corresponding path program 11 times [2025-03-03 14:32:54,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:32:54,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721594160] [2025-03-03 14:32:54,711 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:32:54,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:32:54,721 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 281 statements into 25 equivalence classes. [2025-03-03 14:32:54,757 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) and asserted 260 of 281 statements. [2025-03-03 14:32:54,757 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2025-03-03 14:32:54,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:55,545 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1493 proven. 814 refuted. 0 times theorem prover too weak. 2022 trivial. 0 not checked. [2025-03-03 14:32:55,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:32:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721594160] [2025-03-03 14:32:55,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721594160] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:32:55,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828502197] [2025-03-03 14:32:55,546 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:32:55,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:32:55,547 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:32:55,549 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 14:32:55,550 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 14:32:55,804 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 281 statements into 25 equivalence classes. [2025-03-03 14:32:55,869 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) and asserted 260 of 281 statements. [2025-03-03 14:32:55,869 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 23 check-sat command(s) [2025-03-03 14:32:55,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:32:55,872 INFO L256 TraceCheckSpWp]: Trace formula consists of 760 conjuncts, 53 conjuncts are in the unsatisfiable core [2025-03-03 14:32:55,875 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:32:55,966 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1483 proven. 777 refuted. 0 times theorem prover too weak. 2069 trivial. 0 not checked. [2025-03-03 14:32:55,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 4329 backedges. 1579 proven. 819 refuted. 0 times theorem prover too weak. 1931 trivial. 0 not checked. [2025-03-03 14:33:03,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828502197] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:03,839 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:03,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 29, 40] total 43 [2025-03-03 14:33:03,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1736322790] [2025-03-03 14:33:03,839 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:03,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2025-03-03 14:33:03,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:03,841 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2025-03-03 14:33:03,841 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=1571, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 14:33:03,842 INFO L87 Difference]: Start difference. First operand 102 states and 118 transitions. Second operand has 43 states, 43 states have (on average 2.302325581395349) internal successors, (99), 37 states have internal predecessors, (99), 22 states have call successors, (25), 1 states have call predecessors, (25), 22 states have return successors, (44), 21 states have call predecessors, (44), 22 states have call successors, (44) [2025-03-03 14:33:04,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:04,478 INFO L93 Difference]: Finished difference Result 224 states and 277 transitions. [2025-03-03 14:33:04,478 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-03-03 14:33:04,479 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 43 states have (on average 2.302325581395349) internal successors, (99), 37 states have internal predecessors, (99), 22 states have call successors, (25), 1 states have call predecessors, (25), 22 states have return successors, (44), 21 states have call predecessors, (44), 22 states have call successors, (44) Word has length 281 [2025-03-03 14:33:04,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:04,480 INFO L225 Difference]: With dead ends: 224 [2025-03-03 14:33:04,480 INFO L226 Difference]: Without dead ends: 127 [2025-03-03 14:33:04,483 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 647 GetRequests, 540 SyntacticMatches, 27 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2119 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=1273, Invalid=5369, Unknown=0, NotChecked=0, Total=6642 [2025-03-03 14:33:04,483 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 145 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 731 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 898 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 731 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:04,484 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 306 Invalid, 898 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 731 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 14:33:04,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2025-03-03 14:33:04,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 107. [2025-03-03 14:33:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 72 states have (on average 1.0555555555555556) internal successors, (76), 73 states have internal predecessors, (76), 16 states have call successors, (16), 10 states have call predecessors, (16), 18 states have return successors, (30), 23 states have call predecessors, (30), 16 states have call successors, (30) [2025-03-03 14:33:04,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 122 transitions. [2025-03-03 14:33:04,496 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 122 transitions. Word has length 281 [2025-03-03 14:33:04,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:04,497 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 122 transitions. [2025-03-03 14:33:04,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 2.302325581395349) internal successors, (99), 37 states have internal predecessors, (99), 22 states have call successors, (25), 1 states have call predecessors, (25), 22 states have return successors, (44), 21 states have call predecessors, (44), 22 states have call successors, (44) [2025-03-03 14:33:04,497 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 122 transitions. [2025-03-03 14:33:04,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 295 [2025-03-03 14:33:04,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:33:04,498 INFO L218 NwaCegarLoop]: trace histogram [44, 44, 24, 20, 19, 19, 19, 19, 19, 19, 19, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:33:04,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2025-03-03 14:33:04,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2025-03-03 14:33:04,699 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:33:04,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:33:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash 144313614, now seen corresponding path program 12 times [2025-03-03 14:33:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:33:04,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499666775] [2025-03-03 14:33:04,699 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:33:04,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:33:04,710 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 294 statements into 25 equivalence classes. [2025-03-03 14:33:04,740 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) and asserted 284 of 294 statements. [2025-03-03 14:33:04,740 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2025-03-03 14:33:04,740 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:04,858 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 215 proven. 430 refuted. 0 times theorem prover too weak. 4119 trivial. 0 not checked. [2025-03-03 14:33:04,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:33:04,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499666775] [2025-03-03 14:33:04,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499666775] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:33:04,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090434115] [2025-03-03 14:33:04,858 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:33:04,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:33:04,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:33:04,860 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 14:33:04,862 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 14:33:05,194 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 294 statements into 25 equivalence classes. [2025-03-03 14:33:05,263 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) and asserted 284 of 294 statements. [2025-03-03 14:33:05,263 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 23 check-sat command(s) [2025-03-03 14:33:05,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:33:05,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 847 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-03 14:33:05,269 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:33:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 215 proven. 426 refuted. 0 times theorem prover too weak. 4123 trivial. 0 not checked. [2025-03-03 14:33:05,293 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:33:05,835 INFO L134 CoverageAnalysis]: Checked inductivity of 4764 backedges. 215 proven. 433 refuted. 0 times theorem prover too weak. 4116 trivial. 0 not checked. [2025-03-03 14:33:05,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090434115] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:33:05,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:33:05,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 9] total 11 [2025-03-03 14:33:05,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094456876] [2025-03-03 14:33:05,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:33:05,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-03-03 14:33:05,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:33:05,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-03-03 14:33:05,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2025-03-03 14:33:05,836 INFO L87 Difference]: Start difference. First operand 107 states and 122 transitions. Second operand has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-03 14:33:05,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:33:05,936 INFO L93 Difference]: Finished difference Result 107 states and 122 transitions. [2025-03-03 14:33:05,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-03 14:33:05,937 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) Word has length 294 [2025-03-03 14:33:05,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:33:05,937 INFO L225 Difference]: With dead ends: 107 [2025-03-03 14:33:05,937 INFO L226 Difference]: Without dead ends: 0 [2025-03-03 14:33:05,938 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 602 GetRequests, 586 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:33:05,938 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:33:05,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 104 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:33:05,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-03 14:33:05,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-03 14:33:05,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 14:33:05,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-03 14:33:05,939 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 294 [2025-03-03 14:33:05,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:33:05,939 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-03 14:33:05,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 7 states have call successors, (11), 1 states have call predecessors, (11), 4 states have return successors, (12), 5 states have call predecessors, (12), 7 states have call successors, (12) [2025-03-03 14:33:05,939 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-03 14:33:05,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-03 14:33:05,942 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:33:05,951 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 14:33:06,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-03-03 14:33:06,145 INFO L422 BasicCegarLoop]: Path program histogram: [12, 1, 1] [2025-03-03 14:33:06,147 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-03 14:33:36,487 WARN L286 SmtUtils]: Spent 5.91s on a formula simplification. DAG size of input: 205 DAG size of output: 229 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or)