./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label19.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem02_label19.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash eadd63632d128e63354140f48e358b613932fbd540e74b83f7baa2b6412d6e8f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 22:53:46,648 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 22:53:46,716 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 22:53:46,721 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 22:53:46,721 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 22:53:46,746 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 22:53:46,747 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 22:53:46,747 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 22:53:46,747 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 22:53:46,748 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 22:53:46,748 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 22:53:46,748 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 22:53:46,749 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 22:53:46,749 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 22:53:46,749 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 22:53:46,749 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 22:53:46,749 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 22:53:46,749 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 22:53:46,750 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 22:53:46,750 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 22:53:46,750 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 22:53:46,750 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 22:53:46,750 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 22:53:46,750 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 22:53:46,750 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 22:53:46,750 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 22:53:46,750 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 22:53:46,750 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 22:53:46,750 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 22:53:46,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:53:46,751 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:53:46,751 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:53:46,751 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:46,751 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 22:53:46,751 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 22:53:46,752 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 22:53:46,752 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 22:53:46,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:46,752 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 22:53:46,752 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 22:53:46,752 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 22:53:46,752 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 22:53:46,752 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 22:53:46,752 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 22:53:46,752 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 22:53:46,752 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 22:53:46,753 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 22:53:46,753 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 22:53:46,753 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> eadd63632d128e63354140f48e358b613932fbd540e74b83f7baa2b6412d6e8f [2025-01-08 22:53:46,943 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 22:53:46,948 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 22:53:46,949 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 22:53:46,950 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 22:53:46,950 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 22:53:46,951 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label19.c [2025-01-08 22:53:48,040 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d02f4d5f/7f8828e4de924ff5a9cade6c5ea12c69/FLAG616889d7c [2025-01-08 22:53:48,423 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 22:53:48,424 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label19.c [2025-01-08 22:53:48,435 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d02f4d5f/7f8828e4de924ff5a9cade6c5ea12c69/FLAG616889d7c [2025-01-08 22:53:48,450 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1d02f4d5f/7f8828e4de924ff5a9cade6c5ea12c69 [2025-01-08 22:53:48,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 22:53:48,453 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 22:53:48,454 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 22:53:48,455 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 22:53:48,458 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 22:53:48,458 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,459 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@24362be1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48, skipping insertion in model container [2025-01-08 22:53:48,459 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,486 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 22:53:48,649 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label19.c[15877,15890] [2025-01-08 22:53:48,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:53:48,697 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 22:53:48,746 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label19.c[15877,15890] [2025-01-08 22:53:48,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 22:53:48,781 INFO L204 MainTranslator]: Completed translation [2025-01-08 22:53:48,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48 WrapperNode [2025-01-08 22:53:48,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 22:53:48,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 22:53:48,784 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 22:53:48,784 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 22:53:48,790 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,807 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,856 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-01-08 22:53:48,858 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 22:53:48,858 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 22:53:48,859 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 22:53:48,859 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 22:53:48,865 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,871 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,884 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 22:53:48,884 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,884 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,894 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,895 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,899 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,901 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,903 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,906 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 22:53:48,907 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 22:53:48,907 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 22:53:48,907 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 22:53:48,908 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (1/1) ... [2025-01-08 22:53:48,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 22:53:48,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 22:53:48,934 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 22:53:48,939 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 22:53:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 22:53:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 22:53:48,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 22:53:48,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 22:53:49,003 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 22:53:49,004 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 22:53:49,678 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-01-08 22:53:49,678 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 22:53:49,687 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 22:53:49,687 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 22:53:49,687 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:49 BoogieIcfgContainer [2025-01-08 22:53:49,687 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 22:53:49,689 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 22:53:49,689 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 22:53:49,692 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 22:53:49,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 10:53:48" (1/3) ... [2025-01-08 22:53:49,692 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128ddfea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:53:49, skipping insertion in model container [2025-01-08 22:53:49,692 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 10:53:48" (2/3) ... [2025-01-08 22:53:49,693 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@128ddfea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 10:53:49, skipping insertion in model container [2025-01-08 22:53:49,693 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:49" (3/3) ... [2025-01-08 22:53:49,694 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label19.c [2025-01-08 22:53:49,703 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 22:53:49,704 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label19.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 22:53:49,773 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 22:53:49,792 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;@2ef59875, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 22:53:49,792 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 22:53:49,795 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:49,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2025-01-08 22:53:49,801 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:49,802 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] [2025-01-08 22:53:49,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:49,805 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:49,806 INFO L85 PathProgramCache]: Analyzing trace with hash -378599019, now seen corresponding path program 1 times [2025-01-08 22:53:49,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:49,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375273934] [2025-01-08 22:53:49,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:49,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:49,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 92 statements into 1 equivalence classes. [2025-01-08 22:53:49,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 92 of 92 statements. [2025-01-08 22:53:49,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:49,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:50,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:50,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:50,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375273934] [2025-01-08 22:53:50,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375273934] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:50,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:50,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:50,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194736987] [2025-01-08 22:53:50,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:50,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:50,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:50,215 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:50,216 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:50,220 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6622222222222223) internal successors, (374), 226 states have internal predecessors, (374), 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 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:50,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:50,762 INFO L93 Difference]: Finished difference Result 596 states and 1027 transitions. [2025-01-08 22:53:50,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:50,764 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 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 92 [2025-01-08 22:53:50,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:50,770 INFO L225 Difference]: With dead ends: 596 [2025-01-08 22:53:50,770 INFO L226 Difference]: Without dead ends: 305 [2025-01-08 22:53:50,773 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:50,774 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 152 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 138 IncrementalHoareTripleChecker+Valid, 423 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:50,775 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 90 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 22:53:50,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-08 22:53:50,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-01-08 22:53:50,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 304 states have (on average 1.5263157894736843) internal successors, (464), 304 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:50,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions. [2025-01-08 22:53:50,811 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 92 [2025-01-08 22:53:50,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:50,812 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 464 transitions. [2025-01-08 22:53:50,812 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.666666666666668) internal successors, (92), 2 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:50,812 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2025-01-08 22:53:50,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-01-08 22:53:50,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:50,819 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:50,819 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 22:53:50,819 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:50,820 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:50,820 INFO L85 PathProgramCache]: Analyzing trace with hash 1628530220, now seen corresponding path program 1 times [2025-01-08 22:53:50,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:50,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825364507] [2025-01-08 22:53:50,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:50,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:50,844 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 103 statements into 1 equivalence classes. [2025-01-08 22:53:50,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 103 of 103 statements. [2025-01-08 22:53:50,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:50,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:50,935 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:50,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:50,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825364507] [2025-01-08 22:53:50,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825364507] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:50,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:50,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:50,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538494395] [2025-01-08 22:53:50,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:50,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:50,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:50,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:50,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:50,938 INFO L87 Difference]: Start difference. First operand 305 states and 464 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:51,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:51,317 INFO L93 Difference]: Finished difference Result 902 states and 1375 transitions. [2025-01-08 22:53:51,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:51,318 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 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 103 [2025-01-08 22:53:51,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:51,320 INFO L225 Difference]: With dead ends: 902 [2025-01-08 22:53:51,322 INFO L226 Difference]: Without dead ends: 599 [2025-01-08 22:53:51,322 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:51,323 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 193 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:51,323 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 72 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 22:53:51,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-01-08 22:53:51,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2025-01-08 22:53:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 596 states, 595 states have (on average 1.477310924369748) internal successors, (879), 595 states have internal predecessors, (879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:51,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 879 transitions. [2025-01-08 22:53:51,342 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 879 transitions. Word has length 103 [2025-01-08 22:53:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:51,342 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 879 transitions. [2025-01-08 22:53:51,342 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 2 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 879 transitions. [2025-01-08 22:53:51,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-01-08 22:53:51,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:51,344 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:51,344 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 22:53:51,344 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:51,345 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:51,345 INFO L85 PathProgramCache]: Analyzing trace with hash -808270431, now seen corresponding path program 1 times [2025-01-08 22:53:51,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:51,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511828801] [2025-01-08 22:53:51,345 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:51,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:51,362 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-01-08 22:53:51,370 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-01-08 22:53:51,370 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:51,370 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:51,444 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-01-08 22:53:51,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:51,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511828801] [2025-01-08 22:53:51,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511828801] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:51,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:51,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:51,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137488938] [2025-01-08 22:53:51,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:51,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:51,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:51,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:51,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:51,446 INFO L87 Difference]: Start difference. First operand 596 states and 879 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:51,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:51,625 INFO L93 Difference]: Finished difference Result 1040 states and 1541 transitions. [2025-01-08 22:53:51,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:51,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 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 107 [2025-01-08 22:53:51,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:51,627 INFO L225 Difference]: With dead ends: 1040 [2025-01-08 22:53:51,627 INFO L226 Difference]: Without dead ends: 446 [2025-01-08 22:53:51,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:51,629 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 200 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:51,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 23 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-08 22:53:51,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-01-08 22:53:51,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2025-01-08 22:53:51,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 446 states, 445 states have (on average 1.4247191011235956) internal successors, (634), 445 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:51,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 634 transitions. [2025-01-08 22:53:51,639 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 634 transitions. Word has length 107 [2025-01-08 22:53:51,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:51,639 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 634 transitions. [2025-01-08 22:53:51,639 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:51,640 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 634 transitions. [2025-01-08 22:53:51,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2025-01-08 22:53:51,641 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:51,641 INFO L218 NwaCegarLoop]: trace histogram [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-01-08 22:53:51,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 22:53:51,641 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:51,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:51,641 INFO L85 PathProgramCache]: Analyzing trace with hash -1132707210, now seen corresponding path program 1 times [2025-01-08 22:53:51,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:51,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573962655] [2025-01-08 22:53:51,642 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:51,642 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:51,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 110 statements into 1 equivalence classes. [2025-01-08 22:53:51,663 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 110 of 110 statements. [2025-01-08 22:53:51,664 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:51,664 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:51,740 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:51,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:51,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573962655] [2025-01-08 22:53:51,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1573962655] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:51,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:51,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:51,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209892887] [2025-01-08 22:53:51,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:51,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:51,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:51,741 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:51,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:51,742 INFO L87 Difference]: Start difference. First operand 446 states and 634 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:52,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:52,042 INFO L93 Difference]: Finished difference Result 1314 states and 1873 transitions. [2025-01-08 22:53:52,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:52,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 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 110 [2025-01-08 22:53:52,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:52,045 INFO L225 Difference]: With dead ends: 1314 [2025-01-08 22:53:52,045 INFO L226 Difference]: Without dead ends: 870 [2025-01-08 22:53:52,046 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:52,046 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 129 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:52,047 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 86 Invalid, 407 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:52,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 870 states. [2025-01-08 22:53:52,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 870 to 870. [2025-01-08 22:53:52,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 870 states, 869 states have (on average 1.2531645569620253) internal successors, (1089), 869 states have internal predecessors, (1089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:52,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 870 states to 870 states and 1089 transitions. [2025-01-08 22:53:52,060 INFO L78 Accepts]: Start accepts. Automaton has 870 states and 1089 transitions. Word has length 110 [2025-01-08 22:53:52,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:52,060 INFO L471 AbstractCegarLoop]: Abstraction has 870 states and 1089 transitions. [2025-01-08 22:53:52,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:52,060 INFO L276 IsEmpty]: Start isEmpty. Operand 870 states and 1089 transitions. [2025-01-08 22:53:52,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2025-01-08 22:53:52,062 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:52,062 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:52,062 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 22:53:52,063 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:52,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:52,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1588762900, now seen corresponding path program 1 times [2025-01-08 22:53:52,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:52,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060883324] [2025-01-08 22:53:52,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:52,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:52,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 114 statements into 1 equivalence classes. [2025-01-08 22:53:52,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 114 of 114 statements. [2025-01-08 22:53:52,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:52,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:52,164 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:52,164 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:52,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060883324] [2025-01-08 22:53:52,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060883324] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:52,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:52,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 22:53:52,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364584506] [2025-01-08 22:53:52,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:52,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:52,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:52,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:52,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:52,168 INFO L87 Difference]: Start difference. First operand 870 states and 1089 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:52,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:52,482 INFO L93 Difference]: Finished difference Result 2441 states and 3080 transitions. [2025-01-08 22:53:52,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:52,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 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-01-08 22:53:52,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:52,487 INFO L225 Difference]: With dead ends: 2441 [2025-01-08 22:53:52,487 INFO L226 Difference]: Without dead ends: 1573 [2025-01-08 22:53:52,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:52,489 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 158 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:52,489 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 61 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:52,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-01-08 22:53:52,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1573. [2025-01-08 22:53:52,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1572 states have (on average 1.210559796437659) internal successors, (1903), 1572 states have internal predecessors, (1903), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:52,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1903 transitions. [2025-01-08 22:53:52,513 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1903 transitions. Word has length 114 [2025-01-08 22:53:52,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:52,513 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 1903 transitions. [2025-01-08 22:53:52,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 2 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:52,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1903 transitions. [2025-01-08 22:53:52,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-01-08 22:53:52,515 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:52,515 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 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-01-08 22:53:52,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 22:53:52,515 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:52,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:52,516 INFO L85 PathProgramCache]: Analyzing trace with hash 19270396, now seen corresponding path program 1 times [2025-01-08 22:53:52,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:52,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620723898] [2025-01-08 22:53:52,516 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:52,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:52,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-01-08 22:53:52,532 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-01-08 22:53:52,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:52,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:52,688 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:52,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:52,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620723898] [2025-01-08 22:53:52,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1620723898] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:52,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:52,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 22:53:52,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567706520] [2025-01-08 22:53:52,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:52,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 22:53:52,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:52,689 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 22:53:52,689 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 22:53:52,690 INFO L87 Difference]: Start difference. First operand 1573 states and 1903 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:53,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:53,286 INFO L93 Difference]: Finished difference Result 3844 states and 4649 transitions. [2025-01-08 22:53:53,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-08 22:53:53,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 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 115 [2025-01-08 22:53:53,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:53,291 INFO L225 Difference]: With dead ends: 3844 [2025-01-08 22:53:53,291 INFO L226 Difference]: Without dead ends: 1993 [2025-01-08 22:53:53,292 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-01-08 22:53:53,292 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 372 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 993 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:53,293 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 99 Invalid, 993 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 22:53:53,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1993 states. [2025-01-08 22:53:53,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1993 to 1573. [2025-01-08 22:53:53,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1572 states have (on average 1.1596692111959288) internal successors, (1823), 1572 states have internal predecessors, (1823), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:53,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 1823 transitions. [2025-01-08 22:53:53,314 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 1823 transitions. Word has length 115 [2025-01-08 22:53:53,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:53,315 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 1823 transitions. [2025-01-08 22:53:53,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 4 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:53,315 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 1823 transitions. [2025-01-08 22:53:53,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-01-08 22:53:53,316 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:53,316 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:53,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 22:53:53,317 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:53,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:53,317 INFO L85 PathProgramCache]: Analyzing trace with hash 858572594, now seen corresponding path program 1 times [2025-01-08 22:53:53,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:53,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381835232] [2025-01-08 22:53:53,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:53,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:53,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-01-08 22:53:53,335 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-01-08 22:53:53,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:53,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:53:53,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:53,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381835232] [2025-01-08 22:53:53,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381835232] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:53,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:53,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:53,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111670189] [2025-01-08 22:53:53,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:53,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:53,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:53,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:53,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:53,412 INFO L87 Difference]: Start difference. First operand 1573 states and 1823 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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-01-08 22:53:53,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:53,700 INFO L93 Difference]: Finished difference Result 3144 states and 3644 transitions. [2025-01-08 22:53:53,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:53,701 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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 119 [2025-01-08 22:53:53,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:53,704 INFO L225 Difference]: With dead ends: 3144 [2025-01-08 22:53:53,704 INFO L226 Difference]: Without dead ends: 1573 [2025-01-08 22:53:53,705 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:53,705 INFO L435 NwaCegarLoop]: 190 mSDtfsCounter, 69 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:53,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 203 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:53,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1573 states. [2025-01-08 22:53:53,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1573 to 1433. [2025-01-08 22:53:53,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1433 states, 1432 states have (on average 1.1019553072625698) internal successors, (1578), 1432 states have internal predecessors, (1578), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:53,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 1578 transitions. [2025-01-08 22:53:53,722 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 1578 transitions. Word has length 119 [2025-01-08 22:53:53,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:53,722 INFO L471 AbstractCegarLoop]: Abstraction has 1433 states and 1578 transitions. [2025-01-08 22:53:53,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 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-01-08 22:53:53,722 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 1578 transitions. [2025-01-08 22:53:53,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2025-01-08 22:53:53,724 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:53,725 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:53,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 22:53:53,725 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:53,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:53,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1283108407, now seen corresponding path program 1 times [2025-01-08 22:53:53,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:53,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420338111] [2025-01-08 22:53:53,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:53,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:53,742 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 132 statements into 1 equivalence classes. [2025-01-08 22:53:53,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 132 of 132 statements. [2025-01-08 22:53:53,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:53,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:53,794 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 22:53:53,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:53,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420338111] [2025-01-08 22:53:53,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420338111] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:53,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:53,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:53,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523542017] [2025-01-08 22:53:53,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:53,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:53,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:53,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:53,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:53,796 INFO L87 Difference]: Start difference. First operand 1433 states and 1578 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:54,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:54,079 INFO L93 Difference]: Finished difference Result 3853 states and 4254 transitions. [2025-01-08 22:53:54,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:54,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 132 [2025-01-08 22:53:54,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:54,083 INFO L225 Difference]: With dead ends: 3853 [2025-01-08 22:53:54,084 INFO L226 Difference]: Without dead ends: 2139 [2025-01-08 22:53:54,085 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:54,085 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 126 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:54,085 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 233 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:54,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2139 states. [2025-01-08 22:53:54,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2139 to 1852. [2025-01-08 22:53:54,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1852 states, 1851 states have (on average 1.0967044840626687) internal successors, (2030), 1851 states have internal predecessors, (2030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:54,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1852 states to 1852 states and 2030 transitions. [2025-01-08 22:53:54,107 INFO L78 Accepts]: Start accepts. Automaton has 1852 states and 2030 transitions. Word has length 132 [2025-01-08 22:53:54,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:54,107 INFO L471 AbstractCegarLoop]: Abstraction has 1852 states and 2030 transitions. [2025-01-08 22:53:54,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:54,108 INFO L276 IsEmpty]: Start isEmpty. Operand 1852 states and 2030 transitions. [2025-01-08 22:53:54,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2025-01-08 22:53:54,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 22:53:54,110 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:54,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 22:53:54,110 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 22:53:54,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 22:53:54,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1843028169, now seen corresponding path program 1 times [2025-01-08 22:53:54,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 22:53:54,111 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1356094108] [2025-01-08 22:53:54,111 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 22:53:54,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 22:53:54,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 141 statements into 1 equivalence classes. [2025-01-08 22:53:54,127 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 141 of 141 statements. [2025-01-08 22:53:54,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 22:53:54,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 22:53:54,180 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 74 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-01-08 22:53:54,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 22:53:54,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1356094108] [2025-01-08 22:53:54,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1356094108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 22:53:54,180 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 22:53:54,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 22:53:54,180 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959307236] [2025-01-08 22:53:54,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 22:53:54,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 22:53:54,181 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 22:53:54,181 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 22:53:54,181 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:54,181 INFO L87 Difference]: Start difference. First operand 1852 states and 2030 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:54,450 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 22:53:54,450 INFO L93 Difference]: Finished difference Result 2834 states and 3110 transitions. [2025-01-08 22:53:54,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 22:53:54,450 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 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 141 [2025-01-08 22:53:54,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 22:53:54,451 INFO L225 Difference]: With dead ends: 2834 [2025-01-08 22:53:54,451 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 22:53:54,452 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 22:53:54,453 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 120 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 22:53:54,453 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 216 Invalid, 361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 22:53:54,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 22:53:54,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 22:53:54,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:54,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 22:53:54,454 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 141 [2025-01-08 22:53:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 22:53:54,454 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 22:53:54,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 22:53:54,454 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 22:53:54,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 22:53:54,456 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 22:53:54,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 22:53:54,458 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 22:53:54,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 22:53:54,587 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 22:53:54,597 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 10:53:54 BoogieIcfgContainer [2025-01-08 22:53:54,597 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 22:53:54,597 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 22:53:54,597 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 22:53:54,598 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 22:53:54,598 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 10:53:49" (3/4) ... [2025-01-08 22:53:54,599 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 22:53:54,608 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 22:53:54,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 22:53:54,609 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 22:53:54,610 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 22:53:54,686 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 22:53:54,686 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 22:53:54,686 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 22:53:54,686 INFO L158 Benchmark]: Toolchain (without parser) took 6233.33ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 110.0MB in the beginning and 100.5MB in the end (delta: 9.5MB). Peak memory consumption was 85.7MB. Max. memory is 16.1GB. [2025-01-08 22:53:54,687 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:53:54,687 INFO L158 Benchmark]: CACSL2BoogieTranslator took 329.07ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 84.0MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 22:53:54,687 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.19ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 79.0MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-08 22:53:54,687 INFO L158 Benchmark]: Boogie Preprocessor took 48.05ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 74.2MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 22:53:54,687 INFO L158 Benchmark]: RCFGBuilder took 780.56ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 62.7MB in the end (delta: 11.5MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2025-01-08 22:53:54,688 INFO L158 Benchmark]: TraceAbstraction took 4908.22ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 62.0MB in the beginning and 113.5MB in the end (delta: -51.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2025-01-08 22:53:54,688 INFO L158 Benchmark]: Witness Printer took 88.56ms. Allocated memory is still 218.1MB. Free memory was 113.5MB in the beginning and 100.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 22:53:54,689 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.17ms. Allocated memory is still 201.3MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 329.07ms. Allocated memory is still 142.6MB. Free memory was 109.6MB in the beginning and 84.0MB in the end (delta: 25.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.19ms. Allocated memory is still 142.6MB. Free memory was 84.0MB in the beginning and 79.0MB in the end (delta: 4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.05ms. Allocated memory is still 142.6MB. Free memory was 79.0MB in the beginning and 74.2MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 780.56ms. Allocated memory is still 142.6MB. Free memory was 74.2MB in the beginning and 62.7MB in the end (delta: 11.5MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. * TraceAbstraction took 4908.22ms. Allocated memory was 142.6MB in the beginning and 218.1MB in the end (delta: 75.5MB). Free memory was 62.0MB in the beginning and 113.5MB in the end (delta: -51.5MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. * Witness Printer took 88.56ms. Allocated memory is still 218.1MB. Free memory was 113.5MB in the beginning and 100.5MB in the end (delta: 13.0MB). Peak memory consumption was 16.8MB. 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: 458]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.7s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1519 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1519 mSDsluCounter, 1083 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 563 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3542 IncrementalHoareTripleChecker+Invalid, 4105 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 563 mSolverCounterUnsat, 937 mSDtfsCounter, 3542 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 24 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1852occurred in iteration=8, InterpolantAutomatonStates: 29, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 9 MinimizatonAttempts, 850 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 1033 NumberOfCodeBlocks, 1033 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 1024 ConstructedInterpolants, 0 QuantifiedInterpolants, 1825 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 9 InterpolantComputations, 9 PerfectInterpolantSequences, 254/254 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: 616]: Loop Invariant Derived loop invariant: (((((((((a17 == 8) && (a25 == 1)) && (a19 == 1)) && (a28 <= 7)) || (((a19 == 0) && (a11 == 1)) && (a17 <= 8))) || (((a19 == 0) && (a17 == 8)) && (a11 <= 0))) || (((a11 == 1) && (a17 <= 8)) && (a19 == 1))) || (((a17 == 8) && (a11 <= 0)) && (a19 == 1))) || ((((a17 == 8) && (a28 == 10)) && (a21 == 1)) && (a19 == 1))) RESULT: Ultimate proved your program to be correct! [2025-01-08 22:53:54,701 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE