./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label24.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem03_label24.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 c49e8ae23817aa2c6b4293aba2a0dafa15622f84ed9ad9570ae0d323ad70f2e2 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:55:50,839 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:55:50,918 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:55:50,925 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:55:50,927 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:55:50,959 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:55:50,960 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:55:50,960 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:55:50,960 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:55:50,960 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:55:50,960 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:55:50,960 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:55:50,962 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:55:50,962 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:55:50,963 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:55:50,963 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:55:50,963 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:55:50,963 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:55:50,964 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:55:50,964 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:55:50,964 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:55:50,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:55:50,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:55:50,964 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:55:50,964 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:55:50,965 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:55:50,965 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:55:50,965 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:55:50,965 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:55:50,965 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:55:50,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:55:50,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:55:50,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:55:50,966 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:55:50,966 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:55:50,966 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:55:50,966 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:55:50,966 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:55:50,967 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:55:50,967 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:55:50,967 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:55:50,967 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:55:50,967 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:55:50,967 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:55:50,967 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:55:50,967 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:55:50,968 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:55:50,968 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:55:50,968 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-jdk21/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 -> c49e8ae23817aa2c6b4293aba2a0dafa15622f84ed9ad9570ae0d323ad70f2e2 [2025-01-08 22:55:51,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:55:51,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:55:51,274 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:55:51,275 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:55:51,275 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:55:51,276 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label24.c [2025-01-08 22:55:52,560 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a21abd11/f896f83a9a5e497e9daa2ed399c6f533/FLAGe7a7d6430 [2025-01-08 22:55:52,988 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:55:52,989 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label24.c [2025-01-08 22:55:53,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a21abd11/f896f83a9a5e497e9daa2ed399c6f533/FLAGe7a7d6430 [2025-01-08 22:55:53,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0a21abd11/f896f83a9a5e497e9daa2ed399c6f533 [2025-01-08 22:55:53,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:55:53,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:55:53,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:55:53,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:55:53,038 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:55:53,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:53,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c5746c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53, skipping insertion in model container [2025-01-08 22:55:53,041 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:53,099 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:55:53,471 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label24.c[60015,60028] [2025-01-08 22:55:53,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:55:53,518 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:55:53,675 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label24.c[60015,60028] [2025-01-08 22:55:53,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:55:53,707 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:55:53,707 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53 WrapperNode [2025-01-08 22:55:53,707 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:55:53,708 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:55:53,708 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:55:53,708 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:55:53,714 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:53,747 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:53,853 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-01-08 22:55:53,853 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:55:53,854 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:55:53,855 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:55:53,855 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:55:53,864 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:53,865 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:53,876 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:53,925 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-01-08 22:55:53,926 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:53,926 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:53,980 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:53,989 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:54,005 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:54,027 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:54,037 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:54,053 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:55:54,055 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:55:54,055 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:55:54,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:55:54,056 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (1/1) ... [2025-01-08 22:55:54,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:55:54,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:55:54,093 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:55:54,096 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:55:54,118 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:55:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:55:54,119 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:55:54,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:55:54,204 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:55:54,206 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:55:56,230 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-08 22:55:56,230 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:55:56,252 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:55:56,254 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:55:56,255 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:55:56 BoogieIcfgContainer [2025-01-08 22:55:56,255 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:55:56,257 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:55:56,257 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:55:56,262 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:55:56,262 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:55:53" (1/3) ... [2025-01-08 22:55:56,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba2c14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:55:56, skipping insertion in model container [2025-01-08 22:55:56,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:55:53" (2/3) ... [2025-01-08 22:55:56,263 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba2c14c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:55:56, skipping insertion in model container [2025-01-08 22:55:56,263 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:55:56" (3/3) ... [2025-01-08 22:55:56,264 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label24.c [2025-01-08 22:55:56,278 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:55:56,281 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label24.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:55:56,350 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:55:56,364 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;@297e0199, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:55:56,365 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:55:56,371 INFO L276 IsEmpty]: Start isEmpty. Operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 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-01-08 22:55:56,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-01-08 22:55:56,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:56,394 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:56,394 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:56,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:56,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1926764082, now seen corresponding path program 1 times [2025-01-08 22:55:56,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:56,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149859627] [2025-01-08 22:55:56,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:56,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:56,542 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-01-08 22:55:56,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-01-08 22:55:56,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:56,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:57,482 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:57,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:57,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149859627] [2025-01-08 22:55:57,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149859627] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:57,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:57,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:57,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827381290] [2025-01-08 22:55:57,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:57,492 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:57,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:57,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:57,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:57,518 INFO L87 Difference]: Start difference. First operand has 302 states, 300 states have (on average 1.7266666666666666) internal successors, (518), 301 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 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-01-08 22:55:58,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:58,662 INFO L93 Difference]: Finished difference Result 860 states and 1504 transitions. [2025-01-08 22:55:58,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:58,665 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 191 [2025-01-08 22:55:58,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:58,679 INFO L225 Difference]: With dead ends: 860 [2025-01-08 22:55:58,680 INFO L226 Difference]: Without dead ends: 465 [2025-01-08 22:55:58,687 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:58,690 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 113 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:58,691 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 169 Invalid, 833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 702 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 22:55:58,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2025-01-08 22:55:58,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 459. [2025-01-08 22:55:58,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 458 states have (on average 1.556768558951965) internal successors, (713), 458 states have internal predecessors, (713), 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-01-08 22:55:58,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 713 transitions. [2025-01-08 22:55:58,754 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 713 transitions. Word has length 191 [2025-01-08 22:55:58,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:58,754 INFO L471 AbstractCegarLoop]: Abstraction has 459 states and 713 transitions. [2025-01-08 22:55:58,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 2 states have internal predecessors, (191), 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-01-08 22:55:58,755 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 713 transitions. [2025-01-08 22:55:58,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-01-08 22:55:58,770 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:58,771 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:58,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:55:58,771 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:58,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:58,772 INFO L85 PathProgramCache]: Analyzing trace with hash -782967089, now seen corresponding path program 1 times [2025-01-08 22:55:58,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:58,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628108603] [2025-01-08 22:55:58,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:58,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:58,831 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-01-08 22:55:58,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-01-08 22:55:58,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:58,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:55:59,015 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:55:59,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:55:59,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628108603] [2025-01-08 22:55:59,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628108603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:55:59,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:55:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:55:59,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1613212876] [2025-01-08 22:55:59,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:55:59,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:55:59,019 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:55:59,020 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:55:59,020 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:59,021 INFO L87 Difference]: Start difference. First operand 459 states and 713 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 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-01-08 22:55:59,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:55:59,873 INFO L93 Difference]: Finished difference Result 1343 states and 2102 transitions. [2025-01-08 22:55:59,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:55:59,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-01-08 22:55:59,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:55:59,882 INFO L225 Difference]: With dead ends: 1343 [2025-01-08 22:55:59,882 INFO L226 Difference]: Without dead ends: 886 [2025-01-08 22:55:59,884 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:55:59,885 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 249 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 584 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 584 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:55:59,885 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 91 Invalid, 779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 584 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:55:59,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 886 states. [2025-01-08 22:55:59,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 886 to 868. [2025-01-08 22:55:59,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 868 states, 867 states have (on average 1.5340253748558246) internal successors, (1330), 867 states have internal predecessors, (1330), 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-01-08 22:55:59,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 868 states to 868 states and 1330 transitions. [2025-01-08 22:55:59,915 INFO L78 Accepts]: Start accepts. Automaton has 868 states and 1330 transitions. Word has length 199 [2025-01-08 22:55:59,915 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:55:59,915 INFO L471 AbstractCegarLoop]: Abstraction has 868 states and 1330 transitions. [2025-01-08 22:55:59,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 2 states have internal predecessors, (199), 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-01-08 22:55:59,916 INFO L276 IsEmpty]: Start isEmpty. Operand 868 states and 1330 transitions. [2025-01-08 22:55:59,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-01-08 22:55:59,919 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:55:59,919 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:55:59,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:55:59,919 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:55:59,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:55:59,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1708929043, now seen corresponding path program 1 times [2025-01-08 22:55:59,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:55:59,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607006890] [2025-01-08 22:55:59,921 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:55:59,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:55:59,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-01-08 22:55:59,983 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-01-08 22:55:59,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:55:59,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:00,279 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:00,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:00,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607006890] [2025-01-08 22:56:00,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607006890] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:00,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:00,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:00,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742376836] [2025-01-08 22:56:00,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:00,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:00,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:00,281 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:00,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:00,281 INFO L87 Difference]: Start difference. First operand 868 states and 1330 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 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-01-08 22:56:01,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:01,099 INFO L93 Difference]: Finished difference Result 2546 states and 3911 transitions. [2025-01-08 22:56:01,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:01,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2025-01-08 22:56:01,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:01,107 INFO L225 Difference]: With dead ends: 2546 [2025-01-08 22:56:01,108 INFO L226 Difference]: Without dead ends: 1680 [2025-01-08 22:56:01,109 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:01,110 INFO L435 NwaCegarLoop]: 160 mSDtfsCounter, 211 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 568 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 568 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:01,110 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 194 Invalid, 694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 568 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:56:01,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1680 states. [2025-01-08 22:56:01,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1680 to 1680. [2025-01-08 22:56:01,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1680 states, 1679 states have (on average 1.343061346039309) internal successors, (2255), 1679 states have internal predecessors, (2255), 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-01-08 22:56:01,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1680 states to 1680 states and 2255 transitions. [2025-01-08 22:56:01,155 INFO L78 Accepts]: Start accepts. Automaton has 1680 states and 2255 transitions. Word has length 200 [2025-01-08 22:56:01,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:01,155 INFO L471 AbstractCegarLoop]: Abstraction has 1680 states and 2255 transitions. [2025-01-08 22:56:01,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 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-01-08 22:56:01,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1680 states and 2255 transitions. [2025-01-08 22:56:01,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-08 22:56:01,163 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:01,164 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:01,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:56:01,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:01,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:01,166 INFO L85 PathProgramCache]: Analyzing trace with hash 558056649, now seen corresponding path program 1 times [2025-01-08 22:56:01,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:01,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289423016] [2025-01-08 22:56:01,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:01,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:01,207 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-08 22:56:01,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-08 22:56:01,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:01,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:01,815 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:01,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:01,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289423016] [2025-01-08 22:56:01,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289423016] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:01,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:01,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:01,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521477575] [2025-01-08 22:56:01,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:01,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:56:01,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:01,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:56:01,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:56:01,820 INFO L87 Difference]: Start difference. First operand 1680 states and 2255 transitions. Second operand has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 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-01-08 22:56:02,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:02,830 INFO L93 Difference]: Finished difference Result 3508 states and 4770 transitions. [2025-01-08 22:56:02,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:56:02,831 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 206 [2025-01-08 22:56:02,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:02,838 INFO L225 Difference]: With dead ends: 3508 [2025-01-08 22:56:02,839 INFO L226 Difference]: Without dead ends: 1656 [2025-01-08 22:56:02,841 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:56:02,841 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 299 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 802 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 802 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:02,841 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 47 Invalid, 980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 802 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 22:56:02,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1656 states. [2025-01-08 22:56:02,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1656 to 1656. [2025-01-08 22:56:02,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1656 states, 1655 states have (on average 1.2308157099697885) internal successors, (2037), 1655 states have internal predecessors, (2037), 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-01-08 22:56:02,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1656 states to 1656 states and 2037 transitions. [2025-01-08 22:56:02,875 INFO L78 Accepts]: Start accepts. Automaton has 1656 states and 2037 transitions. Word has length 206 [2025-01-08 22:56:02,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:02,875 INFO L471 AbstractCegarLoop]: Abstraction has 1656 states and 2037 transitions. [2025-01-08 22:56:02,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 50.25) internal successors, (201), 3 states have internal predecessors, (201), 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-01-08 22:56:02,875 INFO L276 IsEmpty]: Start isEmpty. Operand 1656 states and 2037 transitions. [2025-01-08 22:56:02,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-01-08 22:56:02,880 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:02,881 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:02,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:56:02,881 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:02,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:02,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2129108572, now seen corresponding path program 1 times [2025-01-08 22:56:02,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:02,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613271181] [2025-01-08 22:56:02,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:02,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:02,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-01-08 22:56:02,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-01-08 22:56:02,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:02,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:03,547 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:03,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:03,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613271181] [2025-01-08 22:56:03,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613271181] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:03,548 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:03,548 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:03,548 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83976760] [2025-01-08 22:56:03,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:03,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:56:03,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:03,550 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:56:03,550 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:56:03,551 INFO L87 Difference]: Start difference. First operand 1656 states and 2037 transitions. Second operand has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 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-01-08 22:56:04,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:04,722 INFO L93 Difference]: Finished difference Result 4307 states and 5335 transitions. [2025-01-08 22:56:04,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:56:04,723 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 222 [2025-01-08 22:56:04,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:04,731 INFO L225 Difference]: With dead ends: 4307 [2025-01-08 22:56:04,731 INFO L226 Difference]: Without dead ends: 2479 [2025-01-08 22:56:04,733 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:56:04,734 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 197 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:04,734 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 99 Invalid, 1210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 22:56:04,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2479 states. [2025-01-08 22:56:04,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2479 to 2478. [2025-01-08 22:56:04,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2477 states have (on average 1.2208316511909567) internal successors, (3024), 2477 states have internal predecessors, (3024), 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-01-08 22:56:04,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 3024 transitions. [2025-01-08 22:56:04,779 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 3024 transitions. Word has length 222 [2025-01-08 22:56:04,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:04,779 INFO L471 AbstractCegarLoop]: Abstraction has 2478 states and 3024 transitions. [2025-01-08 22:56:04,780 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 55.5) internal successors, (222), 3 states have internal predecessors, (222), 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-01-08 22:56:04,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 3024 transitions. [2025-01-08 22:56:04,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2025-01-08 22:56:04,787 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:04,788 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:04,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:56:04,788 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:04,789 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:04,789 INFO L85 PathProgramCache]: Analyzing trace with hash -598875542, now seen corresponding path program 1 times [2025-01-08 22:56:04,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:04,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033206174] [2025-01-08 22:56:04,791 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:04,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:04,834 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-08 22:56:04,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-08 22:56:04,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:04,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:05,248 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:05,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:05,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033206174] [2025-01-08 22:56:05,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033206174] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:05,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358804953] [2025-01-08 22:56:05,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:05,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:05,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:05,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:56:05,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 22:56:05,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 229 statements into 1 equivalence classes. [2025-01-08 22:56:05,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 229 of 229 statements. [2025-01-08 22:56:05,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:05,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:05,458 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:56:05,470 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:05,755 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-01-08 22:56:05,756 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:05,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358804953] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:05,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:05,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:56:05,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838948570] [2025-01-08 22:56:05,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:05,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:05,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:05,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:05,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:05,758 INFO L87 Difference]: Start difference. First operand 2478 states and 3024 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-01-08 22:56:06,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:06,486 INFO L93 Difference]: Finished difference Result 4962 states and 6061 transitions. [2025-01-08 22:56:06,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:06,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 229 [2025-01-08 22:56:06,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:06,496 INFO L225 Difference]: With dead ends: 4962 [2025-01-08 22:56:06,497 INFO L226 Difference]: Without dead ends: 2486 [2025-01-08 22:56:06,500 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 231 GetRequests, 228 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:06,501 INFO L435 NwaCegarLoop]: 304 mSDtfsCounter, 33 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 636 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:06,501 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 319 Invalid, 636 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:56:06,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2486 states. [2025-01-08 22:56:06,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2486 to 2478. [2025-01-08 22:56:06,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2478 states, 2477 states have (on average 1.2046830843762617) internal successors, (2984), 2477 states have internal predecessors, (2984), 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-01-08 22:56:06,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2478 states to 2478 states and 2984 transitions. [2025-01-08 22:56:06,550 INFO L78 Accepts]: Start accepts. Automaton has 2478 states and 2984 transitions. Word has length 229 [2025-01-08 22:56:06,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:06,551 INFO L471 AbstractCegarLoop]: Abstraction has 2478 states and 2984 transitions. [2025-01-08 22:56:06,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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-01-08 22:56:06,551 INFO L276 IsEmpty]: Start isEmpty. Operand 2478 states and 2984 transitions. [2025-01-08 22:56:06,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-01-08 22:56:06,556 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:06,557 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:06,566 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 22:56:06,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:06,758 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:06,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:06,759 INFO L85 PathProgramCache]: Analyzing trace with hash 2073089779, now seen corresponding path program 1 times [2025-01-08 22:56:06,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:06,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861630464] [2025-01-08 22:56:06,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:06,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:06,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-01-08 22:56:06,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-01-08 22:56:06,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:06,802 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:06,960 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-01-08 22:56:06,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:06,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861630464] [2025-01-08 22:56:06,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861630464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:06,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:06,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:06,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802592573] [2025-01-08 22:56:06,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:06,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:06,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:06,962 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:06,962 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:06,962 INFO L87 Difference]: Start difference. First operand 2478 states and 2984 transitions. Second operand has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 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-01-08 22:56:07,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:07,678 INFO L93 Difference]: Finished difference Result 7416 states and 8931 transitions. [2025-01-08 22:56:07,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:07,679 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2025-01-08 22:56:07,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:07,695 INFO L225 Difference]: With dead ends: 7416 [2025-01-08 22:56:07,695 INFO L226 Difference]: Without dead ends: 4940 [2025-01-08 22:56:07,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:07,700 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 240 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:07,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 94 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 572 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:56:07,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4940 states. [2025-01-08 22:56:07,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4940 to 4937. [2025-01-08 22:56:07,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4937 states, 4936 states have (on average 1.1857779578606158) internal successors, (5853), 4936 states have internal predecessors, (5853), 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-01-08 22:56:07,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4937 states to 4937 states and 5853 transitions. [2025-01-08 22:56:07,774 INFO L78 Accepts]: Start accepts. Automaton has 4937 states and 5853 transitions. Word has length 231 [2025-01-08 22:56:07,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:07,774 INFO L471 AbstractCegarLoop]: Abstraction has 4937 states and 5853 transitions. [2025-01-08 22:56:07,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.0) internal successors, (204), 2 states have internal predecessors, (204), 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-01-08 22:56:07,774 INFO L276 IsEmpty]: Start isEmpty. Operand 4937 states and 5853 transitions. [2025-01-08 22:56:07,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2025-01-08 22:56:07,783 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:07,783 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:07,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:56:07,783 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:07,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:07,784 INFO L85 PathProgramCache]: Analyzing trace with hash 1294904678, now seen corresponding path program 1 times [2025-01-08 22:56:07,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:07,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [818827887] [2025-01-08 22:56:07,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:07,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:07,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-08 22:56:07,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-08 22:56:07,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:07,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:08,161 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:08,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:08,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [818827887] [2025-01-08 22:56:08,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [818827887] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:08,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255303904] [2025-01-08 22:56:08,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:08,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:08,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:08,165 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:56:08,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 22:56:08,262 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 235 statements into 1 equivalence classes. [2025-01-08 22:56:08,360 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 235 of 235 statements. [2025-01-08 22:56:08,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:08,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:08,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 469 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:56:08,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:08,394 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:08,395 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:08,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255303904] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:08,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:08,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:56:08,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180609460] [2025-01-08 22:56:08,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:08,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:08,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:08,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:08,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:08,397 INFO L87 Difference]: Start difference. First operand 4937 states and 5853 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-01-08 22:56:09,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:09,119 INFO L93 Difference]: Finished difference Result 12311 states and 14857 transitions. [2025-01-08 22:56:09,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:09,120 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 235 [2025-01-08 22:56:09,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:09,143 INFO L225 Difference]: With dead ends: 12311 [2025-01-08 22:56:09,143 INFO L226 Difference]: Without dead ends: 7376 [2025-01-08 22:56:09,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 234 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:09,150 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 213 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 105 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 105 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:09,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 332 Invalid, 596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [105 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:56:09,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7376 states. [2025-01-08 22:56:09,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7376 to 7373. [2025-01-08 22:56:09,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7373 states, 7372 states have (on average 1.1483993488876831) internal successors, (8466), 7372 states have internal predecessors, (8466), 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-01-08 22:56:09,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 8466 transitions. [2025-01-08 22:56:09,271 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 8466 transitions. Word has length 235 [2025-01-08 22:56:09,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:09,272 INFO L471 AbstractCegarLoop]: Abstraction has 7373 states and 8466 transitions. [2025-01-08 22:56:09,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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-01-08 22:56:09,272 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 8466 transitions. [2025-01-08 22:56:09,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2025-01-08 22:56:09,283 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:09,283 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:09,291 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 22:56:09,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:09,488 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:09,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:09,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1055765608, now seen corresponding path program 1 times [2025-01-08 22:56:09,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:09,489 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538531265] [2025-01-08 22:56:09,489 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:09,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:09,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-08 22:56:09,541 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-08 22:56:09,541 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:09,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:09,793 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 50 proven. 6 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-01-08 22:56:09,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:09,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538531265] [2025-01-08 22:56:09,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538531265] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:09,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58477606] [2025-01-08 22:56:09,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:09,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:09,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:09,797 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:56:09,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 22:56:09,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 236 statements into 1 equivalence classes. [2025-01-08 22:56:09,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 236 of 236 statements. [2025-01-08 22:56:09,948 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:09,948 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:09,952 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:56:09,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:10,176 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:56:10,176 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:10,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58477606] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:10,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:10,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:56:10,177 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402803738] [2025-01-08 22:56:10,177 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:10,177 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:10,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:10,178 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:10,178 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:10,179 INFO L87 Difference]: Start difference. First operand 7373 states and 8466 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-01-08 22:56:10,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:10,873 INFO L93 Difference]: Finished difference Result 21270 states and 24481 transitions. [2025-01-08 22:56:10,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:10,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 236 [2025-01-08 22:56:10,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:10,904 INFO L225 Difference]: With dead ends: 21270 [2025-01-08 22:56:10,904 INFO L226 Difference]: Without dead ends: 13899 [2025-01-08 22:56:10,915 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 238 GetRequests, 235 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:10,915 INFO L435 NwaCegarLoop]: 285 mSDtfsCounter, 38 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 604 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:10,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 310 Invalid, 604 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:56:10,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13899 states. [2025-01-08 22:56:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13899 to 12862. [2025-01-08 22:56:11,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12862 states, 12861 states have (on average 1.145789596454397) internal successors, (14736), 12861 states have internal predecessors, (14736), 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-01-08 22:56:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12862 states to 12862 states and 14736 transitions. [2025-01-08 22:56:11,135 INFO L78 Accepts]: Start accepts. Automaton has 12862 states and 14736 transitions. Word has length 236 [2025-01-08 22:56:11,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:11,136 INFO L471 AbstractCegarLoop]: Abstraction has 12862 states and 14736 transitions. [2025-01-08 22:56:11,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 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-01-08 22:56:11,136 INFO L276 IsEmpty]: Start isEmpty. Operand 12862 states and 14736 transitions. [2025-01-08 22:56:11,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-01-08 22:56:11,155 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:11,155 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:11,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-08 22:56:11,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:11,356 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:11,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:11,356 INFO L85 PathProgramCache]: Analyzing trace with hash -1346083725, now seen corresponding path program 1 times [2025-01-08 22:56:11,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:11,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229177269] [2025-01-08 22:56:11,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:11,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:11,395 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-08 22:56:11,403 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-08 22:56:11,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:11,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:11,736 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 74 proven. 6 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-01-08 22:56:11,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:11,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229177269] [2025-01-08 22:56:11,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229177269] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:11,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1821798464] [2025-01-08 22:56:11,737 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:11,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:11,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:11,739 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:56:11,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 22:56:11,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-08 22:56:11,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-08 22:56:11,887 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:11,887 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:11,889 INFO L256 TraceCheckSpWp]: Trace formula consists of 492 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:56:11,893 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:11,945 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:11,945 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:11,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1821798464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:11,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:11,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:56:11,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121385398] [2025-01-08 22:56:11,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:11,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:11,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:11,948 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:11,948 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:11,948 INFO L87 Difference]: Start difference. First operand 12862 states and 14736 transitions. Second operand has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-01-08 22:56:12,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:12,631 INFO L93 Difference]: Finished difference Result 24898 states and 28575 transitions. [2025-01-08 22:56:12,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:12,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 263 [2025-01-08 22:56:12,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:12,663 INFO L225 Difference]: With dead ends: 24898 [2025-01-08 22:56:12,664 INFO L226 Difference]: Without dead ends: 12038 [2025-01-08 22:56:12,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 265 GetRequests, 262 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:12,677 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 208 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 586 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:12,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 322 Invalid, 586 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:56:12,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12038 states. [2025-01-08 22:56:12,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12038 to 12033. [2025-01-08 22:56:12,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12033 states, 12032 states have (on average 1.1293218085106382) internal successors, (13588), 12032 states have internal predecessors, (13588), 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-01-08 22:56:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12033 states to 12033 states and 13588 transitions. [2025-01-08 22:56:12,857 INFO L78 Accepts]: Start accepts. Automaton has 12033 states and 13588 transitions. Word has length 263 [2025-01-08 22:56:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:12,858 INFO L471 AbstractCegarLoop]: Abstraction has 12033 states and 13588 transitions. [2025-01-08 22:56:12,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 86.0) internal successors, (258), 3 states have internal predecessors, (258), 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-01-08 22:56:12,858 INFO L276 IsEmpty]: Start isEmpty. Operand 12033 states and 13588 transitions. [2025-01-08 22:56:12,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-08 22:56:12,877 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:12,877 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:12,885 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 22:56:13,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-01-08 22:56:13,079 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:13,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash -668091111, now seen corresponding path program 1 times [2025-01-08 22:56:13,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:13,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071665636] [2025-01-08 22:56:13,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:13,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:13,122 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-08 22:56:13,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-08 22:56:13,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:13,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:13,281 INFO L134 CoverageAnalysis]: Checked inductivity of 95 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:13,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:13,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071665636] [2025-01-08 22:56:13,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071665636] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:13,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:13,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:13,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206788400] [2025-01-08 22:56:13,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:13,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:13,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:13,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:13,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:13,284 INFO L87 Difference]: Start difference. First operand 12033 states and 13588 transitions. Second operand has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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-01-08 22:56:13,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:13,875 INFO L93 Difference]: Finished difference Result 31781 states and 35767 transitions. [2025-01-08 22:56:13,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:13,876 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 287 [2025-01-08 22:56:13,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:13,918 INFO L225 Difference]: With dead ends: 31781 [2025-01-08 22:56:13,918 INFO L226 Difference]: Without dead ends: 19750 [2025-01-08 22:56:13,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:13,934 INFO L435 NwaCegarLoop]: 292 mSDtfsCounter, 43 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:13,934 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 307 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:56:13,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19750 states. [2025-01-08 22:56:14,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19750 to 17514. [2025-01-08 22:56:14,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17514 states, 17513 states have (on average 1.1002112716267916) internal successors, (19268), 17513 states have internal predecessors, (19268), 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-01-08 22:56:14,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17514 states to 17514 states and 19268 transitions. [2025-01-08 22:56:14,157 INFO L78 Accepts]: Start accepts. Automaton has 17514 states and 19268 transitions. Word has length 287 [2025-01-08 22:56:14,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:14,158 INFO L471 AbstractCegarLoop]: Abstraction has 17514 states and 19268 transitions. [2025-01-08 22:56:14,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.66666666666667) internal successors, (287), 3 states have internal predecessors, (287), 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-01-08 22:56:14,158 INFO L276 IsEmpty]: Start isEmpty. Operand 17514 states and 19268 transitions. [2025-01-08 22:56:14,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 353 [2025-01-08 22:56:14,184 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:14,184 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:14,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:56:14,184 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:14,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:14,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1657602027, now seen corresponding path program 1 times [2025-01-08 22:56:14,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:14,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275873715] [2025-01-08 22:56:14,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:14,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:14,235 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-08 22:56:14,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-08 22:56:14,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:14,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:14,592 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 68 proven. 6 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-08 22:56:14,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:14,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275873715] [2025-01-08 22:56:14,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275873715] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:14,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [168266198] [2025-01-08 22:56:14,593 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:14,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:14,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:14,595 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 22:56:14,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 22:56:14,669 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 352 statements into 1 equivalence classes. [2025-01-08 22:56:14,759 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 352 of 352 statements. [2025-01-08 22:56:14,759 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:14,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:14,761 INFO L256 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:56:14,765 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:14,968 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-01-08 22:56:14,969 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:14,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [168266198] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:14,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:14,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:56:14,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764627191] [2025-01-08 22:56:14,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:14,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:14,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:14,971 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:14,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:14,971 INFO L87 Difference]: Start difference. First operand 17514 states and 19268 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-01-08 22:56:15,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:15,513 INFO L93 Difference]: Finished difference Result 34824 states and 38327 transitions. [2025-01-08 22:56:15,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:15,513 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 352 [2025-01-08 22:56:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:15,514 INFO L225 Difference]: With dead ends: 34824 [2025-01-08 22:56:15,514 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:56:15,531 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 351 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:15,531 INFO L435 NwaCegarLoop]: 265 mSDtfsCounter, 72 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:15,531 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 273 Invalid, 565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:56:15,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:56:15,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:56:15,532 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-01-08 22:56:15,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:56:15,532 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 352 [2025-01-08 22:56:15,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:15,532 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:56:15,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 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-01-08 22:56:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:56:15,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:56:15,535 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:56:15,544 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 22:56:15,736 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-08 22:56:15,739 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:15,741 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:56:16,281 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:56:16,304 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:56:16 BoogieIcfgContainer [2025-01-08 22:56:16,305 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:56:16,306 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:56:16,306 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:56:16,306 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:56:16,306 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:55:56" (3/4) ... [2025-01-08 22:56:16,308 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:56:16,342 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:56:16,345 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:56:16,347 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:56:16,348 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:56:16,523 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:56:16,524 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:56:16,524 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:56:16,525 INFO L158 Benchmark]: Toolchain (without parser) took 23492.91ms. Allocated memory was 142.6MB in the beginning and 545.3MB in the end (delta: 402.7MB). Free memory was 107.6MB in the beginning and 207.4MB in the end (delta: -99.8MB). Peak memory consumption was 299.0MB. Max. memory is 16.1GB. [2025-01-08 22:56:16,525 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:56:16,526 INFO L158 Benchmark]: CACSL2BoogieTranslator took 674.50ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 48.8MB in the end (delta: 58.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. [2025-01-08 22:56:16,526 INFO L158 Benchmark]: Boogie Procedure Inliner took 145.36ms. Allocated memory is still 142.6MB. Free memory was 48.8MB in the beginning and 97.9MB in the end (delta: -49.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. [2025-01-08 22:56:16,526 INFO L158 Benchmark]: Boogie Preprocessor took 199.80ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 86.0MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:56:16,527 INFO L158 Benchmark]: RCFGBuilder took 2199.71ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 86.0MB in the beginning and 114.4MB in the end (delta: -28.4MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. [2025-01-08 22:56:16,527 INFO L158 Benchmark]: TraceAbstraction took 20047.77ms. Allocated memory was 176.2MB in the beginning and 545.3MB in the end (delta: 369.1MB). Free memory was 113.4MB in the beginning and 232.3MB in the end (delta: -118.9MB). Peak memory consumption was 254.1MB. Max. memory is 16.1GB. [2025-01-08 22:56:16,528 INFO L158 Benchmark]: Witness Printer took 218.42ms. Allocated memory is still 545.3MB. Free memory was 232.3MB in the beginning and 207.4MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:56:16,529 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 674.50ms. Allocated memory is still 142.6MB. Free memory was 107.6MB in the beginning and 48.8MB in the end (delta: 58.8MB). Peak memory consumption was 58.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 145.36ms. Allocated memory is still 142.6MB. Free memory was 48.8MB in the beginning and 97.9MB in the end (delta: -49.1MB). Peak memory consumption was 19.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 199.80ms. Allocated memory is still 142.6MB. Free memory was 97.9MB in the beginning and 86.0MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * RCFGBuilder took 2199.71ms. Allocated memory was 142.6MB in the beginning and 176.2MB in the end (delta: 33.6MB). Free memory was 86.0MB in the beginning and 114.4MB in the end (delta: -28.4MB). Peak memory consumption was 57.4MB. Max. memory is 16.1GB. * TraceAbstraction took 20047.77ms. Allocated memory was 176.2MB in the beginning and 545.3MB in the end (delta: 369.1MB). Free memory was 113.4MB in the beginning and 232.3MB in the end (delta: -118.9MB). Peak memory consumption was 254.1MB. Max. memory is 16.1GB. * Witness Printer took 218.42ms. Allocated memory is still 545.3MB. Free memory was 232.3MB in the beginning and 207.4MB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 1618]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 302 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 19.4s, OverallIterations: 12, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 10.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1916 SdHoareTripleChecker+Valid, 9.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1916 mSDsluCounter, 2557 SdHoareTripleChecker+Invalid, 7.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 246 mSDsCounter, 1247 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 7449 IncrementalHoareTripleChecker+Invalid, 8696 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1247 mSolverCounterUnsat, 2311 mSDtfsCounter, 7449 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1342 GetRequests, 1318 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17514occurred in iteration=11, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 12 MinimizatonAttempts, 3317 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 5.2s InterpolantComputationTime, 4166 NumberOfCodeBlocks, 4166 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 4149 ConstructedInterpolants, 0 QuantifiedInterpolants, 16215 SizeOfPredicates, 0 NumberOfNonLiveVariables, 2429 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 17 InterpolantComputations, 12 PerfectInterpolantSequences, 1142/1172 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1668]: Loop Invariant Derived loop invariant: (((((((((((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a27 == 1)) && (a18 == 1)) || ((((((a5 == 1) && (a12 == 1)) && (a3 <= 0)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((a5 == 1) && (a12 == 1)) && (a6 == 1)) && (a18 == 1)) && (a27 <= 0))) || ((((a5 == 1) && (a12 == 0)) && (a27 == 1)) && (a18 == 1))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0))) || ((((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a11 <= 0)) && (a27 == 1)) && (a18 == 1))) || ((((((a5 == 1) && (a12 == 1)) && (2 <= a3)) && (a6 == 1)) && (a27 == 1)) && (a18 == 1))) || (((((a5 == 1) && (a12 == 1)) && (a3 <= 0)) && (a18 == 1)) && (a27 <= 0))) || (((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a18 == 1)) && (a27 <= 0))) || (((((a5 == 1) && (2 <= a3)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0))) || (((((a5 == 1) && (a3 == 1)) && (a12 == 0)) && (a18 == 1)) && (a27 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:56:16,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE