./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem03_label30.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_label30.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 a272bf0f73a58d72dfba23a9c902bbeb665b6b76cc21acf92951a09cb8e04c47 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:56:31,179 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:56:31,227 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:56:31,233 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:56:31,234 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:56:31,253 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:56:31,253 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:56:31,255 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:56:31,255 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:56:31,255 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:56:31,255 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:56:31,255 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:56:31,255 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:56:31,255 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:56:31,255 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:56:31,256 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:56:31,256 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:56:31,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:56:31,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:56:31,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:56:31,257 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:56:31,257 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 -> a272bf0f73a58d72dfba23a9c902bbeb665b6b76cc21acf92951a09cb8e04c47 [2025-01-08 22:56:31,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:56:31,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:56:31,482 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:56:31,483 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:56:31,483 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:56:31,484 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem03_label30.c [2025-01-08 22:56:32,645 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c218ad082/d64ce0a153574f90b163ad32330f57f0/FLAGc38443533 [2025-01-08 22:56:33,024 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:56:33,024 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem03_label30.c [2025-01-08 22:56:33,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c218ad082/d64ce0a153574f90b163ad32330f57f0/FLAGc38443533 [2025-01-08 22:56:33,061 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/c218ad082/d64ce0a153574f90b163ad32330f57f0 [2025-01-08 22:56:33,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:56:33,064 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:56:33,071 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:56:33,071 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:56:33,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:56:33,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7d58bc37 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33, skipping insertion in model container [2025-01-08 22:56:33,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,127 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:56:33,473 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_label30.c[57849,57862] [2025-01-08 22:56:33,505 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:56:33,512 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:56:33,629 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_label30.c[57849,57862] [2025-01-08 22:56:33,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:56:33,652 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:56:33,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33 WrapperNode [2025-01-08 22:56:33,654 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:56:33,655 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:56:33,655 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:56:33,655 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:56:33,659 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:56:33" (1/1) ... [2025-01-08 22:56:33,679 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:56:33" (1/1) ... [2025-01-08 22:56:33,741 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1769 [2025-01-08 22:56:33,741 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:56:33,742 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:56:33,742 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:56:33,743 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:56:33,751 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,764 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,802 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:56:33,802 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,802 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,830 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,838 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,850 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,862 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,907 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:56:33,909 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:56:33,909 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:56:33,909 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:56:33,910 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33" (1/1) ... [2025-01-08 22:56:33,916 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:56:33,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:33,939 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:56:33,941 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:56:33,963 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:56:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:56:33,964 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:56:33,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:56:34,032 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:56:34,033 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:56:35,433 INFO L? ?]: Removed 147 outVars from TransFormulas that were not future-live. [2025-01-08 22:56:35,433 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:56:35,456 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:56:35,458 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:56:35,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:56:35 BoogieIcfgContainer [2025-01-08 22:56:35,459 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:56:35,461 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:56:35,461 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:56:35,464 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:56:35,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:56:33" (1/3) ... [2025-01-08 22:56:35,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3f1085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:56:35, skipping insertion in model container [2025-01-08 22:56:35,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:56:33" (2/3) ... [2025-01-08 22:56:35,465 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1e3f1085 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:56:35, skipping insertion in model container [2025-01-08 22:56:35,465 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:56:35" (3/3) ... [2025-01-08 22:56:35,466 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem03_label30.c [2025-01-08 22:56:35,477 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:56:35,480 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem03_label30.c that has 1 procedures, 302 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:56:35,534 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:56:35,545 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;@467e2d2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:56:35,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:56:35,550 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:56:35,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2025-01-08 22:56:35,564 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:35,564 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] [2025-01-08 22:56:35,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:35,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:35,570 INFO L85 PathProgramCache]: Analyzing trace with hash 959665550, now seen corresponding path program 1 times [2025-01-08 22:56:35,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:35,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180600830] [2025-01-08 22:56:35,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:35,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:35,682 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 175 statements into 1 equivalence classes. [2025-01-08 22:56:35,813 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 175 of 175 statements. [2025-01-08 22:56:35,813 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:35,813 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:36,229 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:56:36,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:36,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180600830] [2025-01-08 22:56:36,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180600830] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:36,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:36,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:36,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390572853] [2025-01-08 22:56:36,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:36,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:36,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:36,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:36,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:36,252 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 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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:37,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:37,109 INFO L93 Difference]: Finished difference Result 829 states and 1475 transitions. [2025-01-08 22:56:37,110 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:37,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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 175 [2025-01-08 22:56:37,111 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:37,118 INFO L225 Difference]: With dead ends: 829 [2025-01-08 22:56:37,118 INFO L226 Difference]: Without dead ends: 463 [2025-01-08 22:56:37,120 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:37,122 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 116 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 644 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 899 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 644 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:37,122 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 129 Invalid, 899 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 644 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:56:37,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 463 states. [2025-01-08 22:56:37,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 463 to 449. [2025-01-08 22:56:37,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 449 states, 448 states have (on average 1.6183035714285714) internal successors, (725), 448 states have internal predecessors, (725), 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:37,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 449 states to 449 states and 725 transitions. [2025-01-08 22:56:37,169 INFO L78 Accepts]: Start accepts. Automaton has 449 states and 725 transitions. Word has length 175 [2025-01-08 22:56:37,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:37,170 INFO L471 AbstractCegarLoop]: Abstraction has 449 states and 725 transitions. [2025-01-08 22:56:37,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.333333333333336) internal successors, (175), 2 states have internal predecessors, (175), 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:37,170 INFO L276 IsEmpty]: Start isEmpty. Operand 449 states and 725 transitions. [2025-01-08 22:56:37,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2025-01-08 22:56:37,175 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:37,175 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 22:56:37,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:56:37,176 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:37,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:37,177 INFO L85 PathProgramCache]: Analyzing trace with hash 94967139, now seen corresponding path program 1 times [2025-01-08 22:56:37,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:37,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226386788] [2025-01-08 22:56:37,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:37,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:37,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 180 statements into 1 equivalence classes. [2025-01-08 22:56:37,241 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 180 of 180 statements. [2025-01-08 22:56:37,241 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:37,242 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:37,394 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:37,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:37,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226386788] [2025-01-08 22:56:37,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226386788] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:37,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:37,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:37,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21881024] [2025-01-08 22:56:37,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:37,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:37,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:37,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:37,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:37,397 INFO L87 Difference]: Start difference. First operand 449 states and 725 transitions. Second operand has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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:37,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:37,610 INFO L93 Difference]: Finished difference Result 1341 states and 2169 transitions. [2025-01-08 22:56:37,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:37,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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 180 [2025-01-08 22:56:37,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:37,614 INFO L225 Difference]: With dead ends: 1341 [2025-01-08 22:56:37,614 INFO L226 Difference]: Without dead ends: 894 [2025-01-08 22:56:37,617 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:37,618 INFO L435 NwaCegarLoop]: 313 mSDtfsCounter, 366 mSDsluCounter, 288 mSDsCounter, 0 mSdLazyCounter, 166 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 601 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 166 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:37,619 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 601 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 166 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:56:37,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 894 states. [2025-01-08 22:56:37,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 894 to 891. [2025-01-08 22:56:37,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 891 states, 890 states have (on average 1.6191011235955055) internal successors, (1441), 890 states have internal predecessors, (1441), 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:37,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 891 states to 891 states and 1441 transitions. [2025-01-08 22:56:37,657 INFO L78 Accepts]: Start accepts. Automaton has 891 states and 1441 transitions. Word has length 180 [2025-01-08 22:56:37,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:37,658 INFO L471 AbstractCegarLoop]: Abstraction has 891 states and 1441 transitions. [2025-01-08 22:56:37,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.0) internal successors, (180), 2 states have internal predecessors, (180), 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:37,658 INFO L276 IsEmpty]: Start isEmpty. Operand 891 states and 1441 transitions. [2025-01-08 22:56:37,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-08 22:56:37,660 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:37,660 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 22:56:37,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:56:37,661 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:37,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:37,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1453296008, now seen corresponding path program 1 times [2025-01-08 22:56:37,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:37,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651415808] [2025-01-08 22:56:37,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:37,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:37,689 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-08 22:56:37,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-08 22:56:37,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:37,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:38,074 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:56:38,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:38,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651415808] [2025-01-08 22:56:38,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651415808] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:38,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503983553] [2025-01-08 22:56:38,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:38,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:38,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:38,076 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:38,095 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:38,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-08 22:56:38,204 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-08 22:56:38,204 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:38,205 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:38,207 INFO L256 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:56:38,213 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:38,418 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:38,418 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:38,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1503983553] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:38,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:38,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2025-01-08 22:56:38,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049720166] [2025-01-08 22:56:38,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:38,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:38,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:38,420 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:38,420 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:38,420 INFO L87 Difference]: Start difference. First operand 891 states and 1441 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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:39,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:39,057 INFO L93 Difference]: Finished difference Result 2602 states and 4226 transitions. [2025-01-08 22:56:39,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:39,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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 182 [2025-01-08 22:56:39,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:39,064 INFO L225 Difference]: With dead ends: 2602 [2025-01-08 22:56:39,065 INFO L226 Difference]: Without dead ends: 1713 [2025-01-08 22:56:39,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:39,068 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 101 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 108 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 108 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:39,069 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 92 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [108 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:56:39,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1713 states. [2025-01-08 22:56:39,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1713 to 1709. [2025-01-08 22:56:39,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1708 states have (on average 1.5907494145199064) internal successors, (2717), 1708 states have internal predecessors, (2717), 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:39,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2717 transitions. [2025-01-08 22:56:39,115 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2717 transitions. Word has length 182 [2025-01-08 22:56:39,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:39,116 INFO L471 AbstractCegarLoop]: Abstraction has 1709 states and 2717 transitions. [2025-01-08 22:56:39,116 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 2 states have internal predecessors, (177), 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:39,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2717 transitions. [2025-01-08 22:56:39,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-01-08 22:56:39,119 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:39,119 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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:39,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-08 22:56:39,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:39,320 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:39,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:39,321 INFO L85 PathProgramCache]: Analyzing trace with hash 440443704, now seen corresponding path program 1 times [2025-01-08 22:56:39,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:39,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399598689] [2025-01-08 22:56:39,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:39,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:39,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-01-08 22:56:39,364 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-01-08 22:56:39,365 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:39,365 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:39,498 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-01-08 22:56:39,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:39,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399598689] [2025-01-08 22:56:39,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399598689] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:39,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:39,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:39,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598836267] [2025-01-08 22:56:39,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:39,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:39,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:39,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:39,500 INFO L87 Difference]: Start difference. First operand 1709 states and 2717 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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:40,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:40,161 INFO L93 Difference]: Finished difference Result 5069 states and 8074 transitions. [2025-01-08 22:56:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:40,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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 192 [2025-01-08 22:56:40,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:40,171 INFO L225 Difference]: With dead ends: 5069 [2025-01-08 22:56:40,171 INFO L226 Difference]: Without dead ends: 3362 [2025-01-08 22:56:40,173 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:40,174 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 252 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:40,174 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 135 Invalid, 702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:56:40,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3362 states. [2025-01-08 22:56:40,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3362 to 3358. [2025-01-08 22:56:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3358 states, 3357 states have (on average 1.503723562704796) internal successors, (5048), 3357 states have internal predecessors, (5048), 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:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3358 states to 3358 states and 5048 transitions. [2025-01-08 22:56:40,229 INFO L78 Accepts]: Start accepts. Automaton has 3358 states and 5048 transitions. Word has length 192 [2025-01-08 22:56:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:40,229 INFO L471 AbstractCegarLoop]: Abstraction has 3358 states and 5048 transitions. [2025-01-08 22:56:40,230 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 2 states have internal predecessors, (188), 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:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 3358 states and 5048 transitions. [2025-01-08 22:56:40,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-01-08 22:56:40,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:40,234 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:56:40,235 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:40,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:40,235 INFO L85 PathProgramCache]: Analyzing trace with hash 2024922545, now seen corresponding path program 1 times [2025-01-08 22:56:40,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:40,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148913459] [2025-01-08 22:56:40,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:40,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:40,257 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-01-08 22:56:40,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-01-08 22:56:40,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:40,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:40,555 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-01-08 22:56:40,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:40,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148913459] [2025-01-08 22:56:40,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148913459] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:40,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:40,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:40,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083725908] [2025-01-08 22:56:40,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:40,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:40,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:40,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:40,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:40,557 INFO L87 Difference]: Start difference. First operand 3358 states and 5048 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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:41,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:41,206 INFO L93 Difference]: Finished difference Result 8381 states and 12554 transitions. [2025-01-08 22:56:41,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:41,206 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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 198 [2025-01-08 22:56:41,206 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:41,221 INFO L225 Difference]: With dead ends: 8381 [2025-01-08 22:56:41,221 INFO L226 Difference]: Without dead ends: 5025 [2025-01-08 22:56:41,225 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:41,226 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 226 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 717 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:41,226 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 164 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 717 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:56:41,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5025 states. [2025-01-08 22:56:41,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5025 to 5003. [2025-01-08 22:56:41,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5003 states, 5002 states have (on average 1.4838064774090365) internal successors, (7422), 5002 states have internal predecessors, (7422), 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:41,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5003 states to 5003 states and 7422 transitions. [2025-01-08 22:56:41,309 INFO L78 Accepts]: Start accepts. Automaton has 5003 states and 7422 transitions. Word has length 198 [2025-01-08 22:56:41,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:41,309 INFO L471 AbstractCegarLoop]: Abstraction has 5003 states and 7422 transitions. [2025-01-08 22:56:41,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 2 states have internal predecessors, (186), 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:41,309 INFO L276 IsEmpty]: Start isEmpty. Operand 5003 states and 7422 transitions. [2025-01-08 22:56:41,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-08 22:56:41,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:41,316 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 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:41,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:56:41,316 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:41,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:41,316 INFO L85 PathProgramCache]: Analyzing trace with hash -974713636, now seen corresponding path program 1 times [2025-01-08 22:56:41,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:41,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59075127] [2025-01-08 22:56:41,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:41,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:41,337 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-08 22:56:41,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-08 22:56:41,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:41,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:41,444 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2025-01-08 22:56:41,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:41,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59075127] [2025-01-08 22:56:41,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59075127] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:41,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:41,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:41,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902138118] [2025-01-08 22:56:41,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:41,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:41,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:41,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:41,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:41,447 INFO L87 Difference]: Start difference. First operand 5003 states and 7422 transitions. 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:56:41,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:41,817 INFO L93 Difference]: Finished difference Result 9946 states and 14764 transitions. [2025-01-08 22:56:41,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:41,818 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 203 [2025-01-08 22:56:41,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:41,833 INFO L225 Difference]: With dead ends: 9946 [2025-01-08 22:56:41,833 INFO L226 Difference]: Without dead ends: 4945 [2025-01-08 22:56:41,839 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:41,839 INFO L435 NwaCegarLoop]: 31 mSDtfsCounter, 326 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:41,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 31 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:56:41,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4945 states. [2025-01-08 22:56:41,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4945 to 4945. [2025-01-08 22:56:41,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4945 states, 4944 states have (on average 1.4583333333333333) internal successors, (7210), 4944 states have internal predecessors, (7210), 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:41,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4945 states to 4945 states and 7210 transitions. [2025-01-08 22:56:41,917 INFO L78 Accepts]: Start accepts. Automaton has 4945 states and 7210 transitions. Word has length 203 [2025-01-08 22:56:41,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:41,917 INFO L471 AbstractCegarLoop]: Abstraction has 4945 states and 7210 transitions. [2025-01-08 22:56:41,917 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:56:41,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4945 states and 7210 transitions. [2025-01-08 22:56:41,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-01-08 22:56:41,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:41,923 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 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] [2025-01-08 22:56:41,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:56:41,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:41,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:41,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1038644952, now seen corresponding path program 1 times [2025-01-08 22:56:41,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:41,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37532570] [2025-01-08 22:56:41,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:41,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:41,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-01-08 22:56:41,947 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-01-08 22:56:41,947 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:41,947 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:42,059 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2025-01-08 22:56:42,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:42,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37532570] [2025-01-08 22:56:42,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37532570] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:42,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:42,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:42,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796734049] [2025-01-08 22:56:42,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:42,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:42,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:42,060 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:42,060 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:42,060 INFO L87 Difference]: Start difference. First operand 4945 states and 7210 transitions. 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:56:42,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:42,680 INFO L93 Difference]: Finished difference Result 14782 states and 21557 transitions. [2025-01-08 22:56:42,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:42,681 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 206 [2025-01-08 22:56:42,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:42,718 INFO L225 Difference]: With dead ends: 14782 [2025-01-08 22:56:42,718 INFO L226 Difference]: Without dead ends: 9839 [2025-01-08 22:56:42,727 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:42,728 INFO L435 NwaCegarLoop]: 101 mSDtfsCounter, 229 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 601 mSolverCounterSat, 79 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 79 IncrementalHoareTripleChecker+Valid, 601 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:42,728 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 120 Invalid, 680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [79 Valid, 601 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:56:42,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9839 states. [2025-01-08 22:56:42,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9839 to 9831. [2025-01-08 22:56:42,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9831 states, 9830 states have (on average 1.3930824008138352) internal successors, (13694), 9830 states have internal predecessors, (13694), 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:42,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9831 states to 9831 states and 13694 transitions. [2025-01-08 22:56:42,935 INFO L78 Accepts]: Start accepts. Automaton has 9831 states and 13694 transitions. Word has length 206 [2025-01-08 22:56:42,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:42,935 INFO L471 AbstractCegarLoop]: Abstraction has 9831 states and 13694 transitions. [2025-01-08 22:56:42,936 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:56:42,936 INFO L276 IsEmpty]: Start isEmpty. Operand 9831 states and 13694 transitions. [2025-01-08 22:56:42,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2025-01-08 22:56:42,947 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:42,948 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] [2025-01-08 22:56:42,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:56:42,948 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:42,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:42,949 INFO L85 PathProgramCache]: Analyzing trace with hash -600439254, now seen corresponding path program 1 times [2025-01-08 22:56:42,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:42,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108679411] [2025-01-08 22:56:42,949 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:42,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:42,971 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-08 22:56:42,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-08 22:56:42,977 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:42,977 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:43,211 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:43,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:43,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108679411] [2025-01-08 22:56:43,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108679411] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:43,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [441807763] [2025-01-08 22:56:43,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:43,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:43,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:43,214 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:43,215 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:43,267 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 213 statements into 1 equivalence classes. [2025-01-08 22:56:43,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 213 of 213 statements. [2025-01-08 22:56:43,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:43,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:43,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:56:43,327 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:43,498 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:43,498 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:43,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [441807763] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:43,499 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:43,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:56:43,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738632688] [2025-01-08 22:56:43,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:43,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:43,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:43,499 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:43,500 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:43,500 INFO L87 Difference]: Start difference. First operand 9831 states and 13694 transitions. Second operand has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:44,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:44,211 INFO L93 Difference]: Finished difference Result 27601 states and 38644 transitions. [2025-01-08 22:56:44,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:44,212 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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 213 [2025-01-08 22:56:44,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:44,255 INFO L225 Difference]: With dead ends: 27601 [2025-01-08 22:56:44,255 INFO L226 Difference]: Without dead ends: 17772 [2025-01-08 22:56:44,269 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 215 GetRequests, 212 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:44,269 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 69 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:44,270 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 346 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:56:44,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17772 states. [2025-01-08 22:56:44,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17772 to 15328. [2025-01-08 22:56:44,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15328 states, 15327 states have (on average 1.3569517844327004) internal successors, (20798), 15327 states have internal predecessors, (20798), 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:44,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15328 states to 15328 states and 20798 transitions. [2025-01-08 22:56:44,568 INFO L78 Accepts]: Start accepts. Automaton has 15328 states and 20798 transitions. Word has length 213 [2025-01-08 22:56:44,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:44,568 INFO L471 AbstractCegarLoop]: Abstraction has 15328 states and 20798 transitions. [2025-01-08 22:56:44,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.33333333333333) internal successors, (208), 3 states have internal predecessors, (208), 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:44,568 INFO L276 IsEmpty]: Start isEmpty. Operand 15328 states and 20798 transitions. [2025-01-08 22:56:44,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 264 [2025-01-08 22:56:44,593 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:44,593 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:44,599 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:44,798 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:44,798 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:44,798 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:44,799 INFO L85 PathProgramCache]: Analyzing trace with hash -43407994, now seen corresponding path program 1 times [2025-01-08 22:56:44,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:44,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977755018] [2025-01-08 22:56:44,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:44,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:44,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 263 statements into 1 equivalence classes. [2025-01-08 22:56:44,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 263 of 263 statements. [2025-01-08 22:56:44,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:44,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:45,083 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 99 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:45,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:45,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977755018] [2025-01-08 22:56:45,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977755018] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:45,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:45,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:45,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402413248] [2025-01-08 22:56:45,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:45,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:56:45,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:45,084 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:56:45,084 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:56:45,085 INFO L87 Difference]: Start difference. First operand 15328 states and 20798 transitions. Second operand has 4 states, 4 states have (on average 64.5) 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:45,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:45,812 INFO L93 Difference]: Finished difference Result 30238 states and 41051 transitions. [2025-01-08 22:56:45,812 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:56:45,812 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 64.5) 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:45,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:45,838 INFO L225 Difference]: With dead ends: 30238 [2025-01-08 22:56:45,838 INFO L226 Difference]: Without dead ends: 15115 [2025-01-08 22:56:45,851 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:45,852 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 515 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 817 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 515 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 817 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:45,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [515 Valid, 52 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 817 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:56:45,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15115 states. [2025-01-08 22:56:46,055 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15115 to 15115. [2025-01-08 22:56:46,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15115 states, 15114 states have (on average 1.2631335185920338) internal successors, (19091), 15114 states have internal predecessors, (19091), 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:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15115 states to 15115 states and 19091 transitions. [2025-01-08 22:56:46,093 INFO L78 Accepts]: Start accepts. Automaton has 15115 states and 19091 transitions. Word has length 263 [2025-01-08 22:56:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:46,093 INFO L471 AbstractCegarLoop]: Abstraction has 15115 states and 19091 transitions. [2025-01-08 22:56:46,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 64.5) 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:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 15115 states and 19091 transitions. [2025-01-08 22:56:46,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2025-01-08 22:56:46,113 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:46,114 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:46,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:56:46,114 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:46,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:46,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1821054092, now seen corresponding path program 1 times [2025-01-08 22:56:46,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:46,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421591670] [2025-01-08 22:56:46,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:46,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:46,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 269 statements into 1 equivalence classes. [2025-01-08 22:56:46,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 269 of 269 statements. [2025-01-08 22:56:46,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:46,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:46,304 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-01-08 22:56:46,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:46,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421591670] [2025-01-08 22:56:46,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421591670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:46,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:46,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:46,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292567872] [2025-01-08 22:56:46,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:46,305 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:46,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:46,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:46,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:46,307 INFO L87 Difference]: Start difference. First operand 15115 states and 19091 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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:46,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:46,963 INFO L93 Difference]: Finished difference Result 33094 states and 41652 transitions. [2025-01-08 22:56:46,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:46,964 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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 269 [2025-01-08 22:56:46,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:46,993 INFO L225 Difference]: With dead ends: 33094 [2025-01-08 22:56:46,993 INFO L226 Difference]: Without dead ends: 18387 [2025-01-08 22:56:47,005 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:47,006 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 210 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 564 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 564 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:47,006 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 361 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 564 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:56:47,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18387 states. [2025-01-08 22:56:47,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18387 to 18379. [2025-01-08 22:56:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18379 states, 18378 states have (on average 1.246435956034389) internal successors, (22907), 18378 states have internal predecessors, (22907), 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:47,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18379 states to 18379 states and 22907 transitions. [2025-01-08 22:56:47,231 INFO L78 Accepts]: Start accepts. Automaton has 18379 states and 22907 transitions. Word has length 269 [2025-01-08 22:56:47,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:47,231 INFO L471 AbstractCegarLoop]: Abstraction has 18379 states and 22907 transitions. [2025-01-08 22:56:47,231 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 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:47,231 INFO L276 IsEmpty]: Start isEmpty. Operand 18379 states and 22907 transitions. [2025-01-08 22:56:47,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2025-01-08 22:56:47,254 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:47,255 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:47,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 22:56:47,256 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:47,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:47,256 INFO L85 PathProgramCache]: Analyzing trace with hash -241883466, now seen corresponding path program 1 times [2025-01-08 22:56:47,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:47,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359269923] [2025-01-08 22:56:47,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:47,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:47,287 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 277 statements into 1 equivalence classes. [2025-01-08 22:56:47,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 277 of 277 statements. [2025-01-08 22:56:47,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:47,293 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:47,435 INFO L134 CoverageAnalysis]: Checked inductivity of 147 backedges. 70 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-01-08 22:56:47,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:47,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359269923] [2025-01-08 22:56:47,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359269923] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:47,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:47,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:47,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260213765] [2025-01-08 22:56:47,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:47,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:47,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:47,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:47,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:47,436 INFO L87 Difference]: Start difference. First operand 18379 states and 22907 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:47,772 INFO L93 Difference]: Finished difference Result 52446 states and 65385 transitions. [2025-01-08 22:56:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:47,773 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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 277 [2025-01-08 22:56:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:47,821 INFO L225 Difference]: With dead ends: 52446 [2025-01-08 22:56:47,821 INFO L226 Difference]: Without dead ends: 34475 [2025-01-08 22:56:47,839 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:47,839 INFO L435 NwaCegarLoop]: 252 mSDtfsCounter, 316 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:47,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 476 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:56:47,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34475 states. [2025-01-08 22:56:48,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34475 to 34473. [2025-01-08 22:56:48,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34473 states, 34472 states have (on average 1.2436470178695753) internal successors, (42871), 34472 states have internal predecessors, (42871), 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:48,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 42871 transitions. [2025-01-08 22:56:48,392 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 42871 transitions. Word has length 277 [2025-01-08 22:56:48,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:48,392 INFO L471 AbstractCegarLoop]: Abstraction has 34473 states and 42871 transitions. [2025-01-08 22:56:48,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 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:48,392 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 42871 transitions. [2025-01-08 22:56:48,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2025-01-08 22:56:48,418 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:48,418 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:48,419 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 22:56:48,419 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:48,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:48,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1181392697, now seen corresponding path program 1 times [2025-01-08 22:56:48,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:48,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569835680] [2025-01-08 22:56:48,419 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:48,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:48,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 285 statements into 1 equivalence classes. [2025-01-08 22:56:48,453 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 285 of 285 statements. [2025-01-08 22:56:48,453 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:48,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:48,613 INFO L134 CoverageAnalysis]: Checked inductivity of 142 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-08 22:56:48,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:48,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569835680] [2025-01-08 22:56:48,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569835680] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:48,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:48,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:48,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739141755] [2025-01-08 22:56:48,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:48,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:56:48,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:48,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:56:48,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:56:48,614 INFO L87 Difference]: Start difference. First operand 34473 states and 42871 transitions. Second operand has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 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:49,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:49,570 INFO L93 Difference]: Finished difference Result 71227 states and 88529 transitions. [2025-01-08 22:56:49,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:56:49,570 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 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 285 [2025-01-08 22:56:49,570 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:49,609 INFO L225 Difference]: With dead ends: 71227 [2025-01-08 22:56:49,609 INFO L226 Difference]: Without dead ends: 37162 [2025-01-08 22:56:49,632 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:49,632 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 399 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1105 mSolverCounterSat, 177 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 177 IncrementalHoareTripleChecker+Valid, 1105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:49,632 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 99 Invalid, 1282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [177 Valid, 1105 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 22:56:49,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37162 states. [2025-01-08 22:56:50,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37162 to 31820. [2025-01-08 22:56:50,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31820 states, 31819 states have (on average 1.2477450579842233) internal successors, (39702), 31819 states have internal predecessors, (39702), 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:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31820 states to 31820 states and 39702 transitions. [2025-01-08 22:56:50,118 INFO L78 Accepts]: Start accepts. Automaton has 31820 states and 39702 transitions. Word has length 285 [2025-01-08 22:56:50,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:50,118 INFO L471 AbstractCegarLoop]: Abstraction has 31820 states and 39702 transitions. [2025-01-08 22:56:50,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 53.75) internal successors, (215), 3 states have internal predecessors, (215), 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:50,118 INFO L276 IsEmpty]: Start isEmpty. Operand 31820 states and 39702 transitions. [2025-01-08 22:56:50,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 288 [2025-01-08 22:56:50,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:50,144 INFO L218 NwaCegarLoop]: trace histogram [4, 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, 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] [2025-01-08 22:56:50,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 22:56:50,144 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:50,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:50,145 INFO L85 PathProgramCache]: Analyzing trace with hash 1920663800, now seen corresponding path program 1 times [2025-01-08 22:56:50,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:50,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825966237] [2025-01-08 22:56:50,145 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:50,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:50,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 287 statements into 1 equivalence classes. [2025-01-08 22:56:50,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 287 of 287 statements. [2025-01-08 22:56:50,184 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:50,184 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:50,348 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-01-08 22:56:50,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:50,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825966237] [2025-01-08 22:56:50,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825966237] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:50,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:50,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:56:50,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [873282773] [2025-01-08 22:56:50,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:50,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:50,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:50,350 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:50,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:50,350 INFO L87 Difference]: Start difference. First operand 31820 states and 39702 transitions. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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:51,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:51,157 INFO L93 Difference]: Finished difference Result 78316 states and 97544 transitions. [2025-01-08 22:56:51,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:51,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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:51,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:51,212 INFO L225 Difference]: With dead ends: 78316 [2025-01-08 22:56:51,213 INFO L226 Difference]: Without dead ends: 46498 [2025-01-08 22:56:51,239 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:51,240 INFO L435 NwaCegarLoop]: 343 mSDtfsCounter, 124 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:51,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 357 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:56:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46498 states. [2025-01-08 22:56:51,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46498 to 42173. [2025-01-08 22:56:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42173 states, 42172 states have (on average 1.210779664232192) internal successors, (51061), 42172 states have internal predecessors, (51061), 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:51,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42173 states to 42173 states and 51061 transitions. [2025-01-08 22:56:51,892 INFO L78 Accepts]: Start accepts. Automaton has 42173 states and 51061 transitions. Word has length 287 [2025-01-08 22:56:51,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:51,893 INFO L471 AbstractCegarLoop]: Abstraction has 42173 states and 51061 transitions. [2025-01-08 22:56:51,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 42173 states and 51061 transitions. [2025-01-08 22:56:52,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-01-08 22:56:52,041 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:52,042 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:52,042 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 22:56:52,042 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:52,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:52,042 INFO L85 PathProgramCache]: Analyzing trace with hash 668126701, now seen corresponding path program 1 times [2025-01-08 22:56:52,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:52,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497512176] [2025-01-08 22:56:52,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:52,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:52,077 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-08 22:56:52,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-08 22:56:52,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:52,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:52,202 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 101 trivial. 0 not checked. [2025-01-08 22:56:52,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:52,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497512176] [2025-01-08 22:56:52,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497512176] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:52,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:52,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:52,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42588638] [2025-01-08 22:56:52,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:52,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:52,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:52,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:52,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:52,204 INFO L87 Difference]: Start difference. First operand 42173 states and 51061 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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:52,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:52,923 INFO L93 Difference]: Finished difference Result 110442 states and 133005 transitions. [2025-01-08 22:56:52,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:52,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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 291 [2025-01-08 22:56:52,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:53,003 INFO L225 Difference]: With dead ends: 110442 [2025-01-08 22:56:53,004 INFO L226 Difference]: Without dead ends: 68677 [2025-01-08 22:56:53,039 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:53,039 INFO L435 NwaCegarLoop]: 94 mSDtfsCounter, 203 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:53,039 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 107 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:56:53,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68677 states. [2025-01-08 22:56:53,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68677 to 68675. [2025-01-08 22:56:53,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68675 states, 68674 states have (on average 1.1982264030055043) internal successors, (82287), 68674 states have internal predecessors, (82287), 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:53,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68675 states to 68675 states and 82287 transitions. [2025-01-08 22:56:53,947 INFO L78 Accepts]: Start accepts. Automaton has 68675 states and 82287 transitions. Word has length 291 [2025-01-08 22:56:53,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:53,948 INFO L471 AbstractCegarLoop]: Abstraction has 68675 states and 82287 transitions. [2025-01-08 22:56:53,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 2 states have internal predecessors, (207), 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:53,948 INFO L276 IsEmpty]: Start isEmpty. Operand 68675 states and 82287 transitions. [2025-01-08 22:56:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-08 22:56:53,989 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:53,990 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:56:53,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 22:56:53,990 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:53,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:53,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1718739533, now seen corresponding path program 1 times [2025-01-08 22:56:53,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:53,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338452991] [2025-01-08 22:56:53,990 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:53,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:54,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-08 22:56:54,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-08 22:56:54,031 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:54,031 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:54,423 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 81 proven. 6 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-08 22:56:54,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338452991] [2025-01-08 22:56:54,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338452991] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:56:54,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757815746] [2025-01-08 22:56:54,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:54,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:54,424 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:56:54,426 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:54,428 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:54,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-08 22:56:54,550 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-08 22:56:54,550 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:54,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:54,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 570 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 22:56:54,556 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:56:54,586 INFO L134 CoverageAnalysis]: Checked inductivity of 166 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-01-08 22:56:54,586 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:56:54,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757815746] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:54,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:56:54,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:56:54,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126985137] [2025-01-08 22:56:54,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:54,587 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:54,587 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:54,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:54,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:56:54,589 INFO L87 Difference]: Start difference. First operand 68675 states and 82287 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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:55,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:55,393 INFO L93 Difference]: Finished difference Result 148311 states and 176894 transitions. [2025-01-08 22:56:55,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:55,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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 292 [2025-01-08 22:56:55,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:55,483 INFO L225 Difference]: With dead ends: 148311 [2025-01-08 22:56:55,483 INFO L226 Difference]: Without dead ends: 73548 [2025-01-08 22:56:55,528 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 294 GetRequests, 291 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:55,529 INFO L435 NwaCegarLoop]: 355 mSDtfsCounter, 215 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 215 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 159 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:55,529 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [215 Valid, 376 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [159 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:56:55,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73548 states. [2025-01-08 22:56:56,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73548 to 65810. [2025-01-08 22:56:56,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65810 states, 65809 states have (on average 1.0996976097494264) internal successors, (72370), 65809 states have internal predecessors, (72370), 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:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65810 states to 65810 states and 72370 transitions. [2025-01-08 22:56:56,835 INFO L78 Accepts]: Start accepts. Automaton has 65810 states and 72370 transitions. Word has length 292 [2025-01-08 22:56:56,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:56,835 INFO L471 AbstractCegarLoop]: Abstraction has 65810 states and 72370 transitions. [2025-01-08 22:56:56,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 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:56,836 INFO L276 IsEmpty]: Start isEmpty. Operand 65810 states and 72370 transitions. [2025-01-08 22:56:56,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2025-01-08 22:56:56,872 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:56,873 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56,884 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 22:56:57,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:56:57,073 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:57,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:57,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1376848609, now seen corresponding path program 1 times [2025-01-08 22:56:57,074 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:57,074 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476879965] [2025-01-08 22:56:57,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:57,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:57,100 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 292 statements into 1 equivalence classes. [2025-01-08 22:56:57,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 292 of 292 statements. [2025-01-08 22:56:57,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:57,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:57,231 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 86 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-08 22:56:57,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:57,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476879965] [2025-01-08 22:56:57,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476879965] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:57,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:57,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:57,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1838555854] [2025-01-08 22:56:57,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:57,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:57,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:57,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:57,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:57,234 INFO L87 Difference]: Start difference. First operand 65810 states and 72370 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 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:58,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:56:58,057 INFO L93 Difference]: Finished difference Result 148843 states and 164857 transitions. [2025-01-08 22:56:58,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:56:58,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 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 292 [2025-01-08 22:56:58,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:56:58,147 INFO L225 Difference]: With dead ends: 148843 [2025-01-08 22:56:58,147 INFO L226 Difference]: Without dead ends: 81614 [2025-01-08 22:56:58,173 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:58,173 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 172 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 501 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:56:58,173 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 128 Invalid, 585 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 501 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:56:58,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81614 states. [2025-01-08 22:56:58,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81614 to 76742. [2025-01-08 22:56:58,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76742 states, 76741 states have (on average 1.0798921046116157) internal successors, (82872), 76741 states have internal predecessors, (82872), 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:59,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76742 states to 76742 states and 82872 transitions. [2025-01-08 22:56:59,039 INFO L78 Accepts]: Start accepts. Automaton has 76742 states and 82872 transitions. Word has length 292 [2025-01-08 22:56:59,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:56:59,039 INFO L471 AbstractCegarLoop]: Abstraction has 76742 states and 82872 transitions. [2025-01-08 22:56:59,040 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 2 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:59,040 INFO L276 IsEmpty]: Start isEmpty. Operand 76742 states and 82872 transitions. [2025-01-08 22:56:59,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-08 22:56:59,076 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:56:59,076 INFO L218 NwaCegarLoop]: trace histogram [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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,076 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 22:56:59,076 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:56:59,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:56:59,077 INFO L85 PathProgramCache]: Analyzing trace with hash -84613201, now seen corresponding path program 1 times [2025-01-08 22:56:59,077 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:56:59,077 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596042675] [2025-01-08 22:56:59,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:56:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:56:59,113 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-08 22:56:59,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-08 22:56:59,123 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:56:59,123 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:56:59,307 INFO L134 CoverageAnalysis]: Checked inductivity of 226 backedges. 147 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2025-01-08 22:56:59,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:56:59,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596042675] [2025-01-08 22:56:59,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596042675] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:56:59,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:56:59,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:56:59,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [938648472] [2025-01-08 22:56:59,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:56:59,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:56:59,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:56:59,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:56:59,309 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:56:59,309 INFO L87 Difference]: Start difference. First operand 76742 states and 82872 transitions. Second operand has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 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:57:00,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:00,277 INFO L93 Difference]: Finished difference Result 175911 states and 190066 transitions. [2025-01-08 22:57:00,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:00,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 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 329 [2025-01-08 22:57:00,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:00,401 INFO L225 Difference]: With dead ends: 175911 [2025-01-08 22:57:00,401 INFO L226 Difference]: Without dead ends: 99374 [2025-01-08 22:57:00,457 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:57:00,457 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 154 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:00,458 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [154 Valid, 125 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:57:00,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99374 states. [2025-01-08 22:57:01,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99374 to 86096. [2025-01-08 22:57:01,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86096 states, 86095 states have (on average 1.0824438120680644) internal successors, (93193), 86095 states have internal predecessors, (93193), 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:57:01,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86096 states to 86096 states and 93193 transitions. [2025-01-08 22:57:01,683 INFO L78 Accepts]: Start accepts. Automaton has 86096 states and 93193 transitions. Word has length 329 [2025-01-08 22:57:01,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:01,683 INFO L471 AbstractCegarLoop]: Abstraction has 86096 states and 93193 transitions. [2025-01-08 22:57:01,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.33333333333333) internal successors, (256), 2 states have internal predecessors, (256), 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:57:01,683 INFO L276 IsEmpty]: Start isEmpty. Operand 86096 states and 93193 transitions. [2025-01-08 22:57:01,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 334 [2025-01-08 22:57:01,715 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:01,715 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-08 22:57:01,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 22:57:01,716 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:01,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:01,716 INFO L85 PathProgramCache]: Analyzing trace with hash 1539854473, now seen corresponding path program 1 times [2025-01-08 22:57:01,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:01,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730717635] [2025-01-08 22:57:01,716 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:01,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:01,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 333 statements into 1 equivalence classes. [2025-01-08 22:57:01,755 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 333 of 333 statements. [2025-01-08 22:57:01,755 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:01,755 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:01,933 INFO L134 CoverageAnalysis]: Checked inductivity of 269 backedges. 198 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-01-08 22:57:01,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:01,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730717635] [2025-01-08 22:57:01,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730717635] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:01,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:57:01,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:57:01,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255999465] [2025-01-08 22:57:01,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:01,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 22:57:01,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:01,934 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 22:57:01,934 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 22:57:01,934 INFO L87 Difference]: Start difference. First operand 86096 states and 93193 transitions. Second operand has 4 states, 4 states have (on average 65.75) internal successors, (263), 3 states have internal predecessors, (263), 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:57:03,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:03,279 INFO L93 Difference]: Finished difference Result 173897 states and 188284 transitions. [2025-01-08 22:57:03,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 22:57:03,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 3 states have internal predecessors, (263), 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 333 [2025-01-08 22:57:03,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:03,364 INFO L225 Difference]: With dead ends: 173897 [2025-01-08 22:57:03,364 INFO L226 Difference]: Without dead ends: 86991 [2025-01-08 22:57:03,392 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:57:03,393 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 376 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 981 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:03,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 89 Invalid, 1159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 981 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 22:57:03,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86991 states. [2025-01-08 22:57:04,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86991 to 84472. [2025-01-08 22:57:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84472 states, 84471 states have (on average 1.0817558688780764) internal successors, (91377), 84471 states have internal predecessors, (91377), 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:57:04,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84472 states to 84472 states and 91377 transitions. [2025-01-08 22:57:04,558 INFO L78 Accepts]: Start accepts. Automaton has 84472 states and 91377 transitions. Word has length 333 [2025-01-08 22:57:04,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:04,558 INFO L471 AbstractCegarLoop]: Abstraction has 84472 states and 91377 transitions. [2025-01-08 22:57:04,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 65.75) internal successors, (263), 3 states have internal predecessors, (263), 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:57:04,558 INFO L276 IsEmpty]: Start isEmpty. Operand 84472 states and 91377 transitions. [2025-01-08 22:57:04,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 341 [2025-01-08 22:57:04,601 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:57:04,602 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-08 22:57:04,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 22:57:04,602 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:57:04,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:57:04,602 INFO L85 PathProgramCache]: Analyzing trace with hash 1045115651, now seen corresponding path program 1 times [2025-01-08 22:57:04,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:57:04,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778075553] [2025-01-08 22:57:04,603 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:04,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:57:04,652 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-08 22:57:04,660 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-08 22:57:04,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:04,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:05,066 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 111 proven. 6 refuted. 0 times theorem prover too weak. 179 trivial. 0 not checked. [2025-01-08 22:57:05,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:57:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778075553] [2025-01-08 22:57:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778075553] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 22:57:05,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1822741518] [2025-01-08 22:57:05,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:57:05,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:05,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:57:05,068 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:57:05,070 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:57:05,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 340 statements into 1 equivalence classes. [2025-01-08 22:57:05,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 340 of 340 statements. [2025-01-08 22:57:05,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:57:05,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:57:05,206 INFO L256 TraceCheckSpWp]: Trace formula consists of 618 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 22:57:05,210 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 22:57:05,361 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 162 proven. 0 refuted. 0 times theorem prover too weak. 134 trivial. 0 not checked. [2025-01-08 22:57:05,361 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 22:57:05,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1822741518] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:57:05,362 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 22:57:05,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2025-01-08 22:57:05,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507448692] [2025-01-08 22:57:05,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:57:05,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:57:05,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:57:05,364 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:57:05,364 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:57:05,364 INFO L87 Difference]: Start difference. First operand 84472 states and 91377 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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:57:06,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:57:06,071 INFO L93 Difference]: Finished difference Result 156298 states and 169155 transitions. [2025-01-08 22:57:06,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:57:06,071 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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 340 [2025-01-08 22:57:06,071 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:57:06,073 INFO L225 Difference]: With dead ends: 156298 [2025-01-08 22:57:06,074 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:57:06,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 339 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:57:06,124 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 67 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:57:06,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 310 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 496 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:57:06,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:57:06,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:57:06,124 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:57:06,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:57:06,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 340 [2025-01-08 22:57:06,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:57:06,125 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:57:06,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 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:57:06,126 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:57:06,126 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:57:06,129 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:57:06,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-08 22:57:06,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 22:57:06,332 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:57:06,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:57:14,169 WARN L286 SmtUtils]: Spent 7.83s on a formula simplification. DAG size of input: 793 DAG size of output: 722 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-08 22:57:18,202 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:57:18,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:57:18 BoogieIcfgContainer [2025-01-08 22:57:18,220 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:57:18,220 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:57:18,220 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:57:18,221 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:57:18,221 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:56:35" (3/4) ... [2025-01-08 22:57:18,224 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:57:18,253 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:57:18,254 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:57:18,256 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:57:18,257 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:57:18,391 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:57:18,391 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:57:18,391 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:57:18,392 INFO L158 Benchmark]: Toolchain (without parser) took 45328.42ms. Allocated memory was 167.8MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 127.6MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2025-01-08 22:57:18,393 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:57:18,393 INFO L158 Benchmark]: CACSL2BoogieTranslator took 583.29ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 69.5MB in the end (delta: 58.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-08 22:57:18,393 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.83ms. Allocated memory is still 167.8MB. Free memory was 69.5MB in the beginning and 55.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:57:18,394 INFO L158 Benchmark]: Boogie Preprocessor took 165.57ms. Allocated memory is still 167.8MB. Free memory was 55.1MB in the beginning and 118.0MB in the end (delta: -62.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-08 22:57:18,394 INFO L158 Benchmark]: RCFGBuilder took 1550.48ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 106.8MB in the end (delta: 11.2MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. [2025-01-08 22:57:18,396 INFO L158 Benchmark]: TraceAbstraction took 42759.23ms. Allocated memory was 167.8MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 106.8MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 6.0GB. Max. memory is 16.1GB. [2025-01-08 22:57:18,396 INFO L158 Benchmark]: Witness Printer took 171.29ms. Allocated memory is still 7.7GB. Free memory was 6.0GB in the beginning and 6.0GB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:57:18,397 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.81ms. Allocated memory is still 201.3MB. Free memory is still 125.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 583.29ms. Allocated memory is still 167.8MB. Free memory was 127.6MB in the beginning and 69.5MB in the end (delta: 58.2MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.83ms. Allocated memory is still 167.8MB. Free memory was 69.5MB in the beginning and 55.1MB in the end (delta: 14.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 165.57ms. Allocated memory is still 167.8MB. Free memory was 55.1MB in the beginning and 118.0MB in the end (delta: -62.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * RCFGBuilder took 1550.48ms. Allocated memory is still 167.8MB. Free memory was 118.0MB in the beginning and 106.8MB in the end (delta: 11.2MB). Peak memory consumption was 85.1MB. Max. memory is 16.1GB. * TraceAbstraction took 42759.23ms. Allocated memory was 167.8MB in the beginning and 7.7GB in the end (delta: 7.5GB). Free memory was 106.8MB in the beginning and 6.0GB in the end (delta: -5.9GB). Peak memory consumption was 6.0GB. Max. memory is 16.1GB. * Witness Printer took 171.29ms. Allocated memory is still 7.7GB. Free memory was 6.0GB in the beginning and 6.0GB in the end (delta: 25.2MB). 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: 1570]: 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: 30.8s, OverallIterations: 19, TraceHistogramMax: 5, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.5s, AutomataDifference: 14.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4436 SdHoareTripleChecker+Valid, 10.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4436 mSDsluCounter, 4098 SdHoareTripleChecker+Invalid, 8.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 834 mSDsCounter, 1931 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 11099 IncrementalHoareTripleChecker+Invalid, 13030 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1931 mSolverCounterUnsat, 3264 mSDtfsCounter, 11099 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1071 GetRequests, 1041 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=86096occurred in iteration=17, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 8.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 40585 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.6s InterpolantComputationTime, 5834 NumberOfCodeBlocks, 5834 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 5811 ConstructedInterpolants, 0 QuantifiedInterpolants, 10724 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1931 ConjunctsInSsa, 10 ConjunctsInUnsatCore, 23 InterpolantComputations, 19 PerfectInterpolantSequences, 2616/2640 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: (((((((((((((((((a5 == 1) && (a26 <= 0)) && (a11 == 1)) && (a6 <= 0)) || (((a5 == 1) && (a11 == 1)) && (a6 == 1))) || (((a5 == 1) && (a6 == 1)) && (a11 <= 0))) || ((((a5 == 1) && (a3 == 1)) && (a11 <= 0)) && (a6 <= 0))) || ((((a5 == 1) && (a11 == 1)) && (a27 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a11 == 1)) && (a3 == 1)) && (a4 == 1)) && (a6 <= 0))) || ((((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a12 == 1)) && (a3 == 1)) && (a6 == 1)) && (a4 == 1)) && (a27 == 1))) || (((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 == 1)) && (a4 == 1)) && (a27 == 1)) && (a6 <= 0))) || ((((a5 == 1) && (a12 == 1)) && (a11 <= 0)) && (a6 <= 0))) || ((((((a26 == 1) && (a5 == 1)) && (a12 == 1)) && (a3 <= 0)) && (a6 == 1)) && (a27 == 1))) || ((((a5 == 1) && (a12 == 1)) && (a11 == 1)) && (a6 <= 0))) || (((((a5 == 1) && (a26 <= 0)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) || ((((a5 == 1) && (a3 <= 0)) && (a11 == 1)) && (a6 <= 0))) || ((((((a15 == 1) && (a26 == 1)) && (a5 == 1)) && (a11 <= 0)) && (a27 == 1)) && (a6 <= 0))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:57:18,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE