./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label36.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem01_label36.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1f02632fff6230a332a62c3e19b9c0e1537cb9f813d08c30374ad65993036a6c --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 00:57:49,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 00:57:49,369 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 00:57:49,375 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 00:57:49,378 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 00:57:49,394 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 00:57:49,394 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 00:57:49,395 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 00:57:49,396 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 00:57:49,396 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 00:57:49,396 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 00:57:49,397 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 00:57:49,397 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 00:57:49,397 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 00:57:49,397 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 00:57:49,398 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 00:57:49,398 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 00:57:49,398 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 00:57:49,398 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 00:57:49,398 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 00:57:49,398 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 00:57:49,398 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 00:57:49,398 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 00:57:49,398 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 00:57:49,398 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 00:57:49,399 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 00:57:49,399 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 00:57:49,399 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 00:57:49,399 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 00:57:49,399 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 00:57:49,399 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 00:57:49,399 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 00:57:49,399 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:57:49,400 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 00:57:49,400 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 00:57:49,400 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 00:57:49,400 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 00:57:49,400 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 00:57:49,400 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 00:57:49,400 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 00:57:49,400 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 00:57:49,400 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 00:57:49,400 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 00:57:49,400 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1f02632fff6230a332a62c3e19b9c0e1537cb9f813d08c30374ad65993036a6c [2025-03-08 00:57:49,643 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 00:57:49,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 00:57:49,650 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 00:57:49,650 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 00:57:49,651 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 00:57:49,651 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label36.c [2025-03-08 00:57:50,818 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79fd1adda/b56aa44226ef4e929b383f18388f0f40/FLAGe27f7e143 [2025-03-08 00:57:51,078 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 00:57:51,078 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label36.c [2025-03-08 00:57:51,088 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79fd1adda/b56aa44226ef4e929b383f18388f0f40/FLAGe27f7e143 [2025-03-08 00:57:51,404 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/79fd1adda/b56aa44226ef4e929b383f18388f0f40 [2025-03-08 00:57:51,406 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 00:57:51,409 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 00:57:51,411 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 00:57:51,411 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 00:57:51,414 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 00:57:51,414 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,415 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5b2f0276 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51, skipping insertion in model container [2025-03-08 00:57:51,415 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,442 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 00:57:51,620 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label36.c[18233,18246] [2025-03-08 00:57:51,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:57:51,652 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 00:57:51,696 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label36.c[18233,18246] [2025-03-08 00:57:51,707 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 00:57:51,719 INFO L204 MainTranslator]: Completed translation [2025-03-08 00:57:51,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51 WrapperNode [2025-03-08 00:57:51,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 00:57:51,721 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 00:57:51,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 00:57:51,722 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 00:57:51,727 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,788 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 655 [2025-03-08 00:57:51,789 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 00:57:51,790 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 00:57:51,790 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 00:57:51,790 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 00:57:51,800 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,800 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,805 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,820 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-08 00:57:51,820 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,820 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,844 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,847 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,849 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,850 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,854 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 00:57:51,855 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 00:57:51,855 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 00:57:51,855 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 00:57:51,855 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (1/1) ... [2025-03-08 00:57:51,862 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 00:57:51,873 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:57:51,885 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 00:57:51,892 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 00:57:51,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 00:57:51,910 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 00:57:51,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 00:57:51,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 00:57:51,964 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 00:57:51,966 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 00:57:52,792 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live. [2025-03-08 00:57:52,792 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 00:57:52,803 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 00:57:52,804 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 00:57:52,804 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:52 BoogieIcfgContainer [2025-03-08 00:57:52,804 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 00:57:52,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 00:57:52,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 00:57:52,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 00:57:52,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 12:57:51" (1/3) ... [2025-03-08 00:57:52,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3521a4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:57:52, skipping insertion in model container [2025-03-08 00:57:52,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 12:57:51" (2/3) ... [2025-03-08 00:57:52,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3521a4c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 12:57:52, skipping insertion in model container [2025-03-08 00:57:52,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:52" (3/3) ... [2025-03-08 00:57:52,811 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem01_label36.c [2025-03-08 00:57:52,823 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 00:57:52,825 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem01_label36.c that has 1 procedures, 198 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 00:57:52,882 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 00:57:52,890 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;@575bc46e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 00:57:52,891 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 00:57:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:52,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2025-03-08 00:57:52,900 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:52,901 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] [2025-03-08 00:57:52,901 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:52,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:52,905 INFO L85 PathProgramCache]: Analyzing trace with hash -208878640, now seen corresponding path program 1 times [2025-03-08 00:57:52,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:52,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419777687] [2025-03-08 00:57:52,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:52,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:52,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 102 statements into 1 equivalence classes. [2025-03-08 00:57:53,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 102 of 102 statements. [2025-03-08 00:57:53,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:53,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:53,374 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:53,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:53,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419777687] [2025-03-08 00:57:53,379 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419777687] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:53,379 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:53,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:53,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [448666738] [2025-03-08 00:57:53,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:53,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:53,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:53,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:53,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:53,406 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.663265306122449) internal successors, (326), 197 states have internal predecessors, (326), 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 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:53,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:53,995 INFO L93 Difference]: Finished difference Result 528 states and 912 transitions. [2025-03-08 00:57:53,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:53,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 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 102 [2025-03-08 00:57:53,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:54,005 INFO L225 Difference]: With dead ends: 528 [2025-03-08 00:57:54,006 INFO L226 Difference]: Without dead ends: 266 [2025-03-08 00:57:54,011 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-03-08 00:57:54,014 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 70 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:54,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 84 Invalid, 507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:57:54,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2025-03-08 00:57:54,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266. [2025-03-08 00:57:54,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:54,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions. [2025-03-08 00:57:54,059 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 102 [2025-03-08 00:57:54,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:54,060 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions. [2025-03-08 00:57:54,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:54,060 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions. [2025-03-08 00:57:54,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-03-08 00:57:54,062 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:54,062 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 00:57:54,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 00:57:54,062 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:54,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:54,063 INFO L85 PathProgramCache]: Analyzing trace with hash -961494546, now seen corresponding path program 1 times [2025-03-08 00:57:54,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:54,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1078972393] [2025-03-08 00:57:54,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:54,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:54,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-03-08 00:57:54,093 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-03-08 00:57:54,094 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:54,094 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:54,168 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:54,170 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:54,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1078972393] [2025-03-08 00:57:54,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1078972393] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:54,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:54,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:54,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280705171] [2025-03-08 00:57:54,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:54,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:54,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:54,172 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:54,172 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:54,172 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:54,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:54,493 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions. [2025-03-08 00:57:54,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:54,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 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 108 [2025-03-08 00:57:54,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:54,496 INFO L225 Difference]: With dead ends: 792 [2025-03-08 00:57:54,496 INFO L226 Difference]: Without dead ends: 528 [2025-03-08 00:57:54,497 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-03-08 00:57:54,497 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 142 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 327 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 327 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:54,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 36 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 327 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:54,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states. [2025-03-08 00:57:54,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528. [2025-03-08 00:57:54,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3453510436432639) internal successors, (709), 527 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:54,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 709 transitions. [2025-03-08 00:57:54,522 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 709 transitions. Word has length 108 [2025-03-08 00:57:54,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:54,522 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 709 transitions. [2025-03-08 00:57:54,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:54,522 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 709 transitions. [2025-03-08 00:57:54,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2025-03-08 00:57:54,527 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:54,527 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] [2025-03-08 00:57:54,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 00:57:54,528 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:54,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:54,528 INFO L85 PathProgramCache]: Analyzing trace with hash -498770513, now seen corresponding path program 1 times [2025-03-08 00:57:54,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:54,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989111339] [2025-03-08 00:57:54,528 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:54,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:54,543 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 109 statements into 1 equivalence classes. [2025-03-08 00:57:54,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 109 of 109 statements. [2025-03-08 00:57:54,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:54,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:54,830 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:54,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:54,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989111339] [2025-03-08 00:57:54,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1989111339] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:54,830 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:54,830 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:54,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22771946] [2025-03-08 00:57:54,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:54,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:57:54,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:54,831 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:57:54,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:57:54,831 INFO L87 Difference]: Start difference. First operand 528 states and 709 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:55,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:55,318 INFO L93 Difference]: Finished difference Result 1411 states and 1882 transitions. [2025-03-08 00:57:55,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:57:55,318 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 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 109 [2025-03-08 00:57:55,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:55,321 INFO L225 Difference]: With dead ends: 1411 [2025-03-08 00:57:55,321 INFO L226 Difference]: Without dead ends: 790 [2025-03-08 00:57:55,321 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-03-08 00:57:55,322 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 130 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 106 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 106 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:55,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 80 Invalid, 633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [106 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 00:57:55,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 790 states. [2025-03-08 00:57:55,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 790 to 790. [2025-03-08 00:57:55,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 790 states, 789 states have (on average 1.1634980988593155) internal successors, (918), 789 states have internal predecessors, (918), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:55,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 790 states to 790 states and 918 transitions. [2025-03-08 00:57:55,338 INFO L78 Accepts]: Start accepts. Automaton has 790 states and 918 transitions. Word has length 109 [2025-03-08 00:57:55,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:55,338 INFO L471 AbstractCegarLoop]: Abstraction has 790 states and 918 transitions. [2025-03-08 00:57:55,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:55,338 INFO L276 IsEmpty]: Start isEmpty. Operand 790 states and 918 transitions. [2025-03-08 00:57:55,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-03-08 00:57:55,340 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:55,340 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-08 00:57:55,340 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 00:57:55,340 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:55,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:55,341 INFO L85 PathProgramCache]: Analyzing trace with hash -1379602164, now seen corresponding path program 1 times [2025-03-08 00:57:55,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:55,341 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [585517551] [2025-03-08 00:57:55,341 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:55,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:55,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-03-08 00:57:55,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-03-08 00:57:55,359 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:55,359 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:55,454 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:57:55,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:55,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [585517551] [2025-03-08 00:57:55,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [585517551] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:55,454 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:55,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 00:57:55,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846196768] [2025-03-08 00:57:55,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:55,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:55,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:55,455 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:55,455 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:55,455 INFO L87 Difference]: Start difference. First operand 790 states and 918 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:55,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:55,750 INFO L93 Difference]: Finished difference Result 1578 states and 1859 transitions. [2025-03-08 00:57:55,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:55,750 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 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 114 [2025-03-08 00:57:55,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:55,752 INFO L225 Difference]: With dead ends: 1578 [2025-03-08 00:57:55,753 INFO L226 Difference]: Without dead ends: 921 [2025-03-08 00:57:55,753 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-03-08 00:57:55,754 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 129 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 330 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:55,754 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 45 Invalid, 330 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:55,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states. [2025-03-08 00:57:55,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921. [2025-03-08 00:57:55,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.1532608695652173) internal successors, (1061), 920 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:55,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1061 transitions. [2025-03-08 00:57:55,776 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1061 transitions. Word has length 114 [2025-03-08 00:57:55,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:55,776 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1061 transitions. [2025-03-08 00:57:55,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:55,777 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1061 transitions. [2025-03-08 00:57:55,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-03-08 00:57:55,782 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:55,782 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:57:55,782 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 00:57:55,782 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:55,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:55,783 INFO L85 PathProgramCache]: Analyzing trace with hash -658238464, now seen corresponding path program 1 times [2025-03-08 00:57:55,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:55,783 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886260020] [2025-03-08 00:57:55,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:55,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:55,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-03-08 00:57:55,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-03-08 00:57:55,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:55,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:55,864 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:57:55,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:55,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886260020] [2025-03-08 00:57:55,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886260020] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:55,865 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:55,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:55,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894776998] [2025-03-08 00:57:55,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:55,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:55,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:55,866 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:55,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:55,866 INFO L87 Difference]: Start difference. First operand 921 states and 1061 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:56,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:56,157 INFO L93 Difference]: Finished difference Result 2364 states and 2732 transitions. [2025-03-08 00:57:56,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:56,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 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 123 [2025-03-08 00:57:56,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:56,161 INFO L225 Difference]: With dead ends: 2364 [2025-03-08 00:57:56,161 INFO L226 Difference]: Without dead ends: 1576 [2025-03-08 00:57:56,162 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-03-08 00:57:56,163 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 135 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:56,163 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 19 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:56,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states. [2025-03-08 00:57:56,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1183. [2025-03-08 00:57:56,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.1505922165820643) internal successors, (1360), 1182 states have internal predecessors, (1360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:56,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1360 transitions. [2025-03-08 00:57:56,181 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1360 transitions. Word has length 123 [2025-03-08 00:57:56,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:56,182 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1360 transitions. [2025-03-08 00:57:56,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:56,182 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1360 transitions. [2025-03-08 00:57:56,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2025-03-08 00:57:56,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:56,183 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 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] [2025-03-08 00:57:56,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 00:57:56,184 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:56,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:56,184 INFO L85 PathProgramCache]: Analyzing trace with hash -873872015, now seen corresponding path program 1 times [2025-03-08 00:57:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:56,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248189061] [2025-03-08 00:57:56,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:56,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 129 statements into 1 equivalence classes. [2025-03-08 00:57:56,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 129 of 129 statements. [2025-03-08 00:57:56,210 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:56,210 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:56,305 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-08 00:57:56,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:56,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248189061] [2025-03-08 00:57:56,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248189061] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:56,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:56,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:56,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694307522] [2025-03-08 00:57:56,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:56,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:57:56,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:56,308 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:57:56,308 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:57:56,308 INFO L87 Difference]: Start difference. First operand 1183 states and 1360 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:56,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:56,734 INFO L93 Difference]: Finished difference Result 2495 states and 2925 transitions. [2025-03-08 00:57:56,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:57:56,734 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 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 129 [2025-03-08 00:57:56,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:56,738 INFO L225 Difference]: With dead ends: 2495 [2025-03-08 00:57:56,738 INFO L226 Difference]: Without dead ends: 1445 [2025-03-08 00:57:56,739 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-03-08 00:57:56,740 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 262 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:56,740 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 34 Invalid, 548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:57:56,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1445 states. [2025-03-08 00:57:56,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1445 to 1445. [2025-03-08 00:57:56,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.144736842105263) internal successors, (1653), 1444 states have internal predecessors, (1653), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:56,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1653 transitions. [2025-03-08 00:57:56,770 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1653 transitions. Word has length 129 [2025-03-08 00:57:56,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:56,770 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1653 transitions. [2025-03-08 00:57:56,770 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 3 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:56,770 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1653 transitions. [2025-03-08 00:57:56,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2025-03-08 00:57:56,772 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:56,772 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:57:56,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 00:57:56,772 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:56,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:56,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1785199822, now seen corresponding path program 1 times [2025-03-08 00:57:56,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:56,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674797646] [2025-03-08 00:57:56,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:56,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:56,787 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 143 statements into 1 equivalence classes. [2025-03-08 00:57:56,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 143 of 143 statements. [2025-03-08 00:57:56,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:56,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:56,904 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-08 00:57:56,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:56,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674797646] [2025-03-08 00:57:56,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674797646] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:56,905 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:56,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:56,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379863321] [2025-03-08 00:57:56,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:56,906 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 00:57:56,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:56,906 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 00:57:56,906 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 00:57:56,906 INFO L87 Difference]: Start difference. First operand 1445 states and 1653 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:57,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:57,337 INFO L93 Difference]: Finished difference Result 3281 states and 3775 transitions. [2025-03-08 00:57:57,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 00:57:57,338 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 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 143 [2025-03-08 00:57:57,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:57,343 INFO L225 Difference]: With dead ends: 3281 [2025-03-08 00:57:57,343 INFO L226 Difference]: Without dead ends: 1969 [2025-03-08 00:57:57,345 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-03-08 00:57:57,345 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 347 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 468 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:57,345 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [347 Valid, 42 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 468 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 00:57:57,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1969 states. [2025-03-08 00:57:57,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1969 to 1838. [2025-03-08 00:57:57,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1838 states, 1837 states have (on average 1.136091453456723) internal successors, (2087), 1837 states have internal predecessors, (2087), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:57,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1838 states to 1838 states and 2087 transitions. [2025-03-08 00:57:57,375 INFO L78 Accepts]: Start accepts. Automaton has 1838 states and 2087 transitions. Word has length 143 [2025-03-08 00:57:57,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:57,376 INFO L471 AbstractCegarLoop]: Abstraction has 1838 states and 2087 transitions. [2025-03-08 00:57:57,376 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 1838 states and 2087 transitions. [2025-03-08 00:57:57,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-08 00:57:57,378 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:57,378 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:57:57,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 00:57:57,379 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:57,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:57,379 INFO L85 PathProgramCache]: Analyzing trace with hash -816994298, now seen corresponding path program 1 times [2025-03-08 00:57:57,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:57,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148847199] [2025-03-08 00:57:57,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:57,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:57,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 00:57:57,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 00:57:57,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:57,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:57,596 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 63 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 00:57:57,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:57,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148847199] [2025-03-08 00:57:57,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1148847199] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:57:57,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4220698] [2025-03-08 00:57:57,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:57,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:57:57,597 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:57:57,599 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:57:57,600 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 00:57:57,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-08 00:57:57,679 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-08 00:57:57,680 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:57,680 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:57,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:57:57,688 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:57:57,809 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-08 00:57:57,809 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:57:57,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4220698] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:57,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:57:57,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:57:57,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005532411] [2025-03-08 00:57:57,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:57,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:57,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:57,810 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:57,810 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:57:57,810 INFO L87 Difference]: Start difference. First operand 1838 states and 2087 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:58,111 INFO L93 Difference]: Finished difference Result 4329 states and 4933 transitions. [2025-03-08 00:57:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:58,111 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 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 160 [2025-03-08 00:57:58,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:58,120 INFO L225 Difference]: With dead ends: 4329 [2025-03-08 00:57:58,121 INFO L226 Difference]: Without dead ends: 2493 [2025-03-08 00:57:58,123 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 160 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-03-08 00:57:58,124 INFO L435 NwaCegarLoop]: 179 mSDtfsCounter, 32 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 364 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:58,124 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 185 Invalid, 364 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:58,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2493 states. [2025-03-08 00:57:58,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2493 to 2100. [2025-03-08 00:57:58,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.1090995712243925) internal successors, (2328), 2099 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:58,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2328 transitions. [2025-03-08 00:57:58,179 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2328 transitions. Word has length 160 [2025-03-08 00:57:58,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:58,180 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2328 transitions. [2025-03-08 00:57:58,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:58,180 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2328 transitions. [2025-03-08 00:57:58,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-03-08 00:57:58,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:58,183 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:57:58,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 00:57:58,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:57:58,384 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:58,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:58,384 INFO L85 PathProgramCache]: Analyzing trace with hash -688617592, now seen corresponding path program 1 times [2025-03-08 00:57:58,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:58,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121477309] [2025-03-08 00:57:58,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:58,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:58,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-03-08 00:57:58,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-03-08 00:57:58,406 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:58,406 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:58,496 INFO L134 CoverageAnalysis]: Checked inductivity of 77 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-08 00:57:58,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:58,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121477309] [2025-03-08 00:57:58,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121477309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:58,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:58,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:58,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929628742] [2025-03-08 00:57:58,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:58,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:58,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:58,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:58,498 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:58,498 INFO L87 Difference]: Start difference. First operand 2100 states and 2328 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:58,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:58,802 INFO L93 Difference]: Finished difference Result 4591 states and 5119 transitions. [2025-03-08 00:57:58,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:58,802 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 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 163 [2025-03-08 00:57:58,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:58,809 INFO L225 Difference]: With dead ends: 4591 [2025-03-08 00:57:58,809 INFO L226 Difference]: Without dead ends: 2624 [2025-03-08 00:57:58,810 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-03-08 00:57:58,811 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 94 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:58,811 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 40 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:58,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-03-08 00:57:58,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2493. [2025-03-08 00:57:58,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 2492 states have (on average 1.112760834670947) internal successors, (2773), 2492 states have internal predecessors, (2773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:58,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2773 transitions. [2025-03-08 00:57:58,850 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2773 transitions. Word has length 163 [2025-03-08 00:57:58,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:58,850 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 2773 transitions. [2025-03-08 00:57:58,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:58,850 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2773 transitions. [2025-03-08 00:57:58,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2025-03-08 00:57:58,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:58,853 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 00:57:58,853 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 00:57:58,854 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:58,854 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:58,854 INFO L85 PathProgramCache]: Analyzing trace with hash 703144946, now seen corresponding path program 1 times [2025-03-08 00:57:58,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:58,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961774131] [2025-03-08 00:57:58,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:58,854 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:58,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 206 statements into 1 equivalence classes. [2025-03-08 00:57:58,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 206 of 206 statements. [2025-03-08 00:57:58,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:58,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:58,940 INFO L134 CoverageAnalysis]: Checked inductivity of 186 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-03-08 00:57:58,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:58,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961774131] [2025-03-08 00:57:58,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961774131] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:58,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:58,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:58,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442499491] [2025-03-08 00:57:58,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:58,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:58,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:58,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:58,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:58,942 INFO L87 Difference]: Start difference. First operand 2493 states and 2773 transitions. Second operand has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 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-03-08 00:57:59,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:59,228 INFO L93 Difference]: Finished difference Result 4984 states and 5549 transitions. [2025-03-08 00:57:59,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:59,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 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 206 [2025-03-08 00:57:59,229 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:59,236 INFO L225 Difference]: With dead ends: 4984 [2025-03-08 00:57:59,236 INFO L226 Difference]: Without dead ends: 2624 [2025-03-08 00:57:59,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-03-08 00:57:59,240 INFO L435 NwaCegarLoop]: 173 mSDtfsCounter, 86 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 318 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:59,240 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 179 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 318 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 00:57:59,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-03-08 00:57:59,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2493. [2025-03-08 00:57:59,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2493 states, 2492 states have (on average 1.1035313001605136) internal successors, (2750), 2492 states have internal predecessors, (2750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2493 states to 2493 states and 2750 transitions. [2025-03-08 00:57:59,291 INFO L78 Accepts]: Start accepts. Automaton has 2493 states and 2750 transitions. Word has length 206 [2025-03-08 00:57:59,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:59,292 INFO L471 AbstractCegarLoop]: Abstraction has 2493 states and 2750 transitions. [2025-03-08 00:57:59,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.666666666666664) internal successors, (188), 3 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-03-08 00:57:59,292 INFO L276 IsEmpty]: Start isEmpty. Operand 2493 states and 2750 transitions. [2025-03-08 00:57:59,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-08 00:57:59,296 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:59,296 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-08 00:57:59,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 00:57:59,297 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:59,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:59,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1236432215, now seen corresponding path program 1 times [2025-03-08 00:57:59,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:59,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058917211] [2025-03-08 00:57:59,297 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:59,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:59,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 00:57:59,324 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 00:57:59,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:59,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:59,396 INFO L134 CoverageAnalysis]: Checked inductivity of 223 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2025-03-08 00:57:59,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:59,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058917211] [2025-03-08 00:57:59,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058917211] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:57:59,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 00:57:59,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 00:57:59,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136647470] [2025-03-08 00:57:59,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:57:59,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:57:59,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:57:59,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:57:59,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 00:57:59,398 INFO L87 Difference]: Start difference. First operand 2493 states and 2750 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:59,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:57:59,667 INFO L93 Difference]: Finished difference Result 5115 states and 5649 transitions. [2025-03-08 00:57:59,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:57:59,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 219 [2025-03-08 00:57:59,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:57:59,675 INFO L225 Difference]: With dead ends: 5115 [2025-03-08 00:57:59,675 INFO L226 Difference]: Without dead ends: 2624 [2025-03-08 00:57:59,678 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-03-08 00:57:59,679 INFO L435 NwaCegarLoop]: 163 mSDtfsCounter, 96 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 331 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:57:59,679 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 169 Invalid, 331 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:57:59,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2624 states. [2025-03-08 00:57:59,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2624 to 2362. [2025-03-08 00:57:59,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2362 states, 2361 states have (on average 1.086827615417196) internal successors, (2566), 2361 states have internal predecessors, (2566), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:59,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2362 states to 2362 states and 2566 transitions. [2025-03-08 00:57:59,729 INFO L78 Accepts]: Start accepts. Automaton has 2362 states and 2566 transitions. Word has length 219 [2025-03-08 00:57:59,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:57:59,729 INFO L471 AbstractCegarLoop]: Abstraction has 2362 states and 2566 transitions. [2025-03-08 00:57:59,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:57:59,730 INFO L276 IsEmpty]: Start isEmpty. Operand 2362 states and 2566 transitions. [2025-03-08 00:57:59,733 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2025-03-08 00:57:59,733 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:57:59,733 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 00:57:59,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 00:57:59,733 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:57:59,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:57:59,734 INFO L85 PathProgramCache]: Analyzing trace with hash -1065215671, now seen corresponding path program 1 times [2025-03-08 00:57:59,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:57:59,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2043733770] [2025-03-08 00:57:59,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:59,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:57:59,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 00:57:59,774 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 00:57:59,774 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:59,774 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:59,900 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 124 proven. 67 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2025-03-08 00:57:59,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:57:59,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2043733770] [2025-03-08 00:57:59,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2043733770] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:57:59,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [698589359] [2025-03-08 00:57:59,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:57:59,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:57:59,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:57:59,902 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:57:59,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 00:57:59,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 228 statements into 1 equivalence classes. [2025-03-08 00:57:59,991 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 228 of 228 statements. [2025-03-08 00:57:59,991 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:57:59,991 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:57:59,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:57:59,996 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:58:00,117 INFO L134 CoverageAnalysis]: Checked inductivity of 218 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 93 trivial. 0 not checked. [2025-03-08 00:58:00,119 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:58:00,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [698589359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:00,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:58:00,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 00:58:00,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636724966] [2025-03-08 00:58:00,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:00,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:00,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:00,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:00,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:58:00,121 INFO L87 Difference]: Start difference. First operand 2362 states and 2566 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:58:00,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:00,383 INFO L93 Difference]: Finished difference Result 4722 states and 5130 transitions. [2025-03-08 00:58:00,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:00,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 228 [2025-03-08 00:58:00,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:00,388 INFO L225 Difference]: With dead ends: 4722 [2025-03-08 00:58:00,388 INFO L226 Difference]: Without dead ends: 2362 [2025-03-08 00:58:00,390 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 229 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 00:58:00,391 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 38 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:00,391 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 172 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:58:00,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2362 states. [2025-03-08 00:58:00,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2362 to 2100. [2025-03-08 00:58:00,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2100 states, 2099 states have (on average 1.0709861838970938) internal successors, (2248), 2099 states have internal predecessors, (2248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:58:00,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2100 states to 2100 states and 2248 transitions. [2025-03-08 00:58:00,415 INFO L78 Accepts]: Start accepts. Automaton has 2100 states and 2248 transitions. Word has length 228 [2025-03-08 00:58:00,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:00,415 INFO L471 AbstractCegarLoop]: Abstraction has 2100 states and 2248 transitions. [2025-03-08 00:58:00,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:58:00,416 INFO L276 IsEmpty]: Start isEmpty. Operand 2100 states and 2248 transitions. [2025-03-08 00:58:00,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2025-03-08 00:58:00,418 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 00:58:00,418 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:00,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 00:58:00,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-08 00:58:00,623 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 00:58:00,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 00:58:00,624 INFO L85 PathProgramCache]: Analyzing trace with hash -289658738, now seen corresponding path program 1 times [2025-03-08 00:58:00,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 00:58:00,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929226394] [2025-03-08 00:58:00,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:00,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 00:58:00,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-08 00:58:00,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-08 00:58:00,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:00,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:00,925 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 143 proven. 86 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2025-03-08 00:58:00,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 00:58:00,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929226394] [2025-03-08 00:58:00,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929226394] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 00:58:00,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1269305092] [2025-03-08 00:58:00,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 00:58:00,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:58:00,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 00:58:00,928 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 00:58:00,930 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 00:58:00,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 247 statements into 1 equivalence classes. [2025-03-08 00:58:01,037 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 247 of 247 statements. [2025-03-08 00:58:01,037 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 00:58:01,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 00:58:01,039 INFO L256 TraceCheckSpWp]: Trace formula consists of 430 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 00:58:01,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 00:58:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-03-08 00:58:01,147 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 00:58:01,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1269305092] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 00:58:01,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 00:58:01,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-08 00:58:01,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152793246] [2025-03-08 00:58:01,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 00:58:01,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 00:58:01,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 00:58:01,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 00:58:01,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:58:01,148 INFO L87 Difference]: Start difference. First operand 2100 states and 2248 transitions. Second operand has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:58:01,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 00:58:01,412 INFO L93 Difference]: Finished difference Result 4327 states and 4640 transitions. [2025-03-08 00:58:01,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 00:58:01,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 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 247 [2025-03-08 00:58:01,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 00:58:01,413 INFO L225 Difference]: With dead ends: 4327 [2025-03-08 00:58:01,413 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 00:58:01,416 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 247 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-08 00:58:01,416 INFO L435 NwaCegarLoop]: 156 mSDtfsCounter, 36 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 343 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 00:58:01,416 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 161 Invalid, 343 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 00:58:01,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 00:58:01,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 00:58:01,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:58:01,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 00:58:01,417 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 247 [2025-03-08 00:58:01,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 00:58:01,417 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 00:58:01,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 55.0) internal successors, (165), 3 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 00:58:01,417 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 00:58:01,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 00:58:01,419 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 00:58:01,426 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 00:58:01,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 00:58:01,623 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 00:58:01,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-08 00:58:01,829 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-08 00:58:01,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.03 12:58:01 BoogieIcfgContainer [2025-03-08 00:58:01,840 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-08 00:58:01,840 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-08 00:58:01,840 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-08 00:58:01,841 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-08 00:58:01,842 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 12:57:52" (3/4) ... [2025-03-08 00:58:01,844 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-08 00:58:01,862 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-08 00:58:01,863 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-08 00:58:01,863 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-08 00:58:01,864 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-08 00:58:01,957 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-08 00:58:01,958 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-08 00:58:01,958 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-08 00:58:01,958 INFO L158 Benchmark]: Toolchain (without parser) took 10549.06ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 156.7MB in the beginning and 143.0MB in the end (delta: 13.6MB). Peak memory consumption was 102.8MB. Max. memory is 16.1GB. [2025-03-08 00:58:01,959 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:58:01,959 INFO L158 Benchmark]: CACSL2BoogieTranslator took 310.21ms. Allocated memory is still 201.3MB. Free memory was 156.7MB in the beginning and 129.6MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-08 00:58:01,959 INFO L158 Benchmark]: Boogie Procedure Inliner took 67.64ms. Allocated memory is still 201.3MB. Free memory was 129.6MB in the beginning and 124.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:58:01,959 INFO L158 Benchmark]: Boogie Preprocessor took 64.46ms. Allocated memory is still 201.3MB. Free memory was 123.9MB in the beginning and 120.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-08 00:58:01,959 INFO L158 Benchmark]: IcfgBuilder took 949.75ms. Allocated memory is still 201.3MB. Free memory was 120.0MB in the beginning and 137.1MB in the end (delta: -17.1MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. [2025-03-08 00:58:01,959 INFO L158 Benchmark]: TraceAbstraction took 9034.01ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 137.1MB in the beginning and 156.3MB in the end (delta: -19.2MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. [2025-03-08 00:58:01,959 INFO L158 Benchmark]: Witness Printer took 117.36ms. Allocated memory is still 293.6MB. Free memory was 156.3MB in the beginning and 143.0MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-08 00:58:01,960 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.20ms. Allocated memory is still 201.3MB. Free memory is still 116.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 310.21ms. Allocated memory is still 201.3MB. Free memory was 156.7MB in the beginning and 129.6MB in the end (delta: 27.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 67.64ms. Allocated memory is still 201.3MB. Free memory was 129.6MB in the beginning and 124.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.46ms. Allocated memory is still 201.3MB. Free memory was 123.9MB in the beginning and 120.0MB in the end (delta: 3.9MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 949.75ms. Allocated memory is still 201.3MB. Free memory was 120.0MB in the beginning and 137.1MB in the end (delta: -17.1MB). Peak memory consumption was 84.2MB. Max. memory is 16.1GB. * TraceAbstraction took 9034.01ms. Allocated memory was 201.3MB in the beginning and 293.6MB in the end (delta: 92.3MB). Free memory was 137.1MB in the beginning and 156.3MB in the end (delta: -19.2MB). Peak memory consumption was 77.4MB. Max. memory is 16.1GB. * Witness Printer took 117.36ms. Allocated memory is still 293.6MB. Free memory was 156.3MB in the beginning and 143.0MB in the end (delta: 13.3MB). Peak memory consumption was 8.4MB. 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: 492]: 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, 198 locations, 326 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.8s, OverallIterations: 13, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1597 SdHoareTripleChecker+Valid, 4.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1597 mSDsluCounter, 1246 SdHoareTripleChecker+Invalid, 3.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 79 mSDsCounter, 701 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4665 IncrementalHoareTripleChecker+Invalid, 5366 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 701 mSolverCounterUnsat, 1167 mSDtfsCounter, 4665 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 673 GetRequests, 650 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2493occurred in iteration=9, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 13 MinimizatonAttempts, 1703 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 2686 NumberOfCodeBlocks, 2686 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2670 ConstructedInterpolants, 0 QuantifiedInterpolants, 9495 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1155 ConjunctsInSsa, 6 ConjunctsInUnsatCore, 16 InterpolantComputations, 13 PerfectInterpolantSequences, 1606/1767 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: 593]: Location Invariant Derived location invariant: ((((((((((((((((a20 != 1) && (6 <= a16)) && (a21 == 1)) && (a17 == 1)) && (15 <= a8)) || (((a21 <= 0) && (a16 <= 4)) && (a20 == 1))) || (((a21 <= 0) && (a17 == 1)) && (a16 <= 4))) || (((((a12 == 8) && (6 <= a16)) && (a21 == 1)) && (a17 == 1)) && (a20 == 1))) || (((a21 <= 0) && (a17 == 1)) && (a20 == 1))) || (((a17 <= 0) && (a21 == 1)) && (15 <= a8))) || (((a17 <= 0) && (a21 == 1)) && (a16 <= 5))) || (((a17 <= 0) && (a21 == 1)) && (a20 == 1))) || (((((a20 != 1) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (15 <= a8))) || (((((a12 == 8) && (a21 == 1)) && (a17 == 1)) && (a16 <= 4)) && (a20 == 1))) || (((6 <= a16) && (a21 <= 0)) && (a20 == 1))) || (((((a12 == 8) && (a7 != 1)) && (a21 == 1)) && (a17 == 1)) && (15 <= a8))) RESULT: Ultimate proved your program to be correct! [2025-03-08 00:58:01,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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