./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label22.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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_label22.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 b6203532a9ef5ba90e15dbd2d5728025b7640a6606e85e563b08b8dcbd8cbea0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 10:44:08,725 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 10:44:08,766 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 10:44:08,769 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 10:44:08,769 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 10:44:08,792 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 10:44:08,793 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 10:44:08,793 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 10:44:08,793 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 10:44:08,793 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 10:44:08,793 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 10:44:08,793 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 10:44:08,794 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 10:44:08,794 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 10:44:08,794 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 10:44:08,795 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:44:08,795 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 10:44:08,795 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 10:44:08,795 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 -> b6203532a9ef5ba90e15dbd2d5728025b7640a6606e85e563b08b8dcbd8cbea0 [2025-02-05 10:44:08,987 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 10:44:08,992 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 10:44:08,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 10:44:08,994 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 10:44:08,994 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 10:44:08,995 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label22.c [2025-02-05 10:44:10,104 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84f11ebd5/fafe1abeb52b4cc9a1ffb1ab21f4ff6f/FLAG0390e02d0 [2025-02-05 10:44:10,492 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 10:44:10,497 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label22.c [2025-02-05 10:44:10,510 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84f11ebd5/fafe1abeb52b4cc9a1ffb1ab21f4ff6f/FLAG0390e02d0 [2025-02-05 10:44:10,680 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/84f11ebd5/fafe1abeb52b4cc9a1ffb1ab21f4ff6f [2025-02-05 10:44:10,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 10:44:10,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 10:44:10,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 10:44:10,686 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 10:44:10,690 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 10:44:10,690 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:44:10" (1/1) ... [2025-02-05 10:44:10,692 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@61459e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:10, skipping insertion in model container [2025-02-05 10:44:10,692 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 10:44:10" (1/1) ... [2025-02-05 10:44:10,717 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 10:44:10,949 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_label22.c[16445,16458] [2025-02-05 10:44:10,975 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:44:10,981 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 10:44:11,036 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_label22.c[16445,16458] [2025-02-05 10:44:11,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 10:44:11,072 INFO L204 MainTranslator]: Completed translation [2025-02-05 10:44:11,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11 WrapperNode [2025-02-05 10:44:11,073 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 10:44:11,074 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 10:44:11,074 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 10:44:11,074 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 10:44:11,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (1/1) ... [2025-02-05 10:44:11,093 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (1/1) ... [2025-02-05 10:44:11,141 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 666 [2025-02-05 10:44:11,144 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 10:44:11,145 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 10:44:11,145 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 10:44:11,145 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 10:44:11,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (1/1) ... [2025-02-05 10:44:11,151 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (1/1) ... [2025-02-05 10:44:11,154 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (1/1) ... [2025-02-05 10:44:11,175 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-02-05 10:44:11,175 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (1/1) ... [2025-02-05 10:44:11,175 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (1/1) ... [2025-02-05 10:44:11,189 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (1/1) ... [2025-02-05 10:44:11,190 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (1/1) ... [2025-02-05 10:44:11,191 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (1/1) ... [2025-02-05 10:44:11,192 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (1/1) ... [2025-02-05 10:44:11,195 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 10:44:11,195 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 10:44:11,195 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 10:44:11,195 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 10:44:11,196 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (1/1) ... [2025-02-05 10:44:11,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 10:44:11,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:44:11,220 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-02-05 10:44:11,223 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-02-05 10:44:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 10:44:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 10:44:11,238 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 10:44:11,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 10:44:11,281 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 10:44:11,282 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 10:44:12,007 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2025-02-05 10:44:12,007 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 10:44:12,016 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 10:44:12,016 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 10:44:12,016 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:44:12 BoogieIcfgContainer [2025-02-05 10:44:12,016 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 10:44:12,018 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 10:44:12,018 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 10:44:12,021 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 10:44:12,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 10:44:10" (1/3) ... [2025-02-05 10:44:12,021 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124dadaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:44:12, skipping insertion in model container [2025-02-05 10:44:12,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 10:44:11" (2/3) ... [2025-02-05 10:44:12,022 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124dadaf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 10:44:12, skipping insertion in model container [2025-02-05 10:44:12,022 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:44:12" (3/3) ... [2025-02-05 10:44:12,023 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem02_label22.c [2025-02-05 10:44:12,036 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 10:44:12,038 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem02_label22.c that has 1 procedures, 227 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 10:44:12,099 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 10:44:12,107 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;@3aa5180f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 10:44:12,107 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 10:44:12,110 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-02-05 10:44:12,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-02-05 10:44:12,123 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:12,124 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:12,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:12,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:12,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1744519272, now seen corresponding path program 1 times [2025-02-05 10:44:12,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:12,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [292247092] [2025-02-05 10:44:12,142 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:12,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-02-05 10:44:12,238 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-02-05 10:44:12,238 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:12,238 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:12,515 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:12,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:12,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [292247092] [2025-02-05 10:44:12,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [292247092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:12,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:12,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:12,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388679805] [2025-02-05 10:44:12,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:12,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:12,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:12,543 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:12,544 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:12,550 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 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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-02-05 10:44:13,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:13,139 INFO L93 Difference]: Finished difference Result 596 states and 1027 transitions. [2025-02-05 10:44:13,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:13,141 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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 97 [2025-02-05 10:44:13,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:13,149 INFO L225 Difference]: With dead ends: 596 [2025-02-05 10:44:13,149 INFO L226 Difference]: Without dead ends: 305 [2025-02-05 10:44:13,151 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-02-05 10:44:13,152 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 147 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 423 mSolverCounterSat, 138 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 89 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-02-05 10:44:13,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 89 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [138 Valid, 423 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:44:13,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-02-05 10:44:13,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2025-02-05 10:44:13,194 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-02-05 10:44:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 464 transitions. [2025-02-05 10:44:13,197 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 464 transitions. Word has length 97 [2025-02-05 10:44:13,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:13,197 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 464 transitions. [2025-02-05 10:44:13,198 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 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-02-05 10:44:13,198 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 464 transitions. [2025-02-05 10:44:13,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2025-02-05 10:44:13,200 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:13,200 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, 1, 1, 1, 1, 1] [2025-02-05 10:44:13,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 10:44:13,200 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:13,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:13,201 INFO L85 PathProgramCache]: Analyzing trace with hash -1395137334, now seen corresponding path program 1 times [2025-02-05 10:44:13,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:13,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533662849] [2025-02-05 10:44:13,201 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:13,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:13,218 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 108 statements into 1 equivalence classes. [2025-02-05 10:44:13,230 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 108 of 108 statements. [2025-02-05 10:44:13,230 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:13,230 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:13,300 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:13,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:13,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533662849] [2025-02-05 10:44:13,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533662849] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:13,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:13,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:13,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469866618] [2025-02-05 10:44:13,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:13,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:13,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:13,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:13,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:13,302 INFO L87 Difference]: Start difference. First operand 305 states and 464 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:13,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:13,694 INFO L93 Difference]: Finished difference Result 902 states and 1375 transitions. [2025-02-05 10:44:13,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:13,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 108 [2025-02-05 10:44:13,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:13,700 INFO L225 Difference]: With dead ends: 902 [2025-02-05 10:44:13,701 INFO L226 Difference]: Without dead ends: 599 [2025-02-05 10:44:13,703 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-02-05 10:44:13,704 INFO L435 NwaCegarLoop]: 52 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, 71 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-02-05 10:44:13,706 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 71 Invalid, 440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 10:44:13,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2025-02-05 10:44:13,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 596. [2025-02-05 10:44:13,759 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-02-05 10:44:13,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 879 transitions. [2025-02-05 10:44:13,767 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 879 transitions. Word has length 108 [2025-02-05 10:44:13,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:13,767 INFO L471 AbstractCegarLoop]: Abstraction has 596 states and 879 transitions. [2025-02-05 10:44:13,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:13,767 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 879 transitions. [2025-02-05 10:44:13,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2025-02-05 10:44:13,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:13,769 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, 1, 1, 1, 1, 1] [2025-02-05 10:44:13,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 10:44:13,769 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:13,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:13,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1631251501, now seen corresponding path program 1 times [2025-02-05 10:44:13,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:13,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299717529] [2025-02-05 10:44:13,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:13,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:13,838 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 112 statements into 1 equivalence classes. [2025-02-05 10:44:13,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 112 of 112 statements. [2025-02-05 10:44:13,848 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:13,848 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:13,934 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-05 10:44:13,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:13,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299717529] [2025-02-05 10:44:13,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299717529] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:13,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:13,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:13,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116509570] [2025-02-05 10:44:13,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:13,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:13,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:13,935 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:13,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:13,937 INFO L87 Difference]: Start difference. First operand 596 states and 879 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-02-05 10:44:14,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:14,132 INFO L93 Difference]: Finished difference Result 1040 states and 1541 transitions. [2025-02-05 10:44:14,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:14,133 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 112 [2025-02-05 10:44:14,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:14,135 INFO L225 Difference]: With dead ends: 1040 [2025-02-05 10:44:14,136 INFO L226 Difference]: Without dead ends: 446 [2025-02-05 10:44:14,136 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-02-05 10:44:14,140 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-02-05 10:44:14,140 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-02-05 10:44:14,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 446 states. [2025-02-05 10:44:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 446 to 446. [2025-02-05 10:44:14,151 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-02-05 10:44:14,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 446 states to 446 states and 634 transitions. [2025-02-05 10:44:14,153 INFO L78 Accepts]: Start accepts. Automaton has 446 states and 634 transitions. Word has length 112 [2025-02-05 10:44:14,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:14,153 INFO L471 AbstractCegarLoop]: Abstraction has 446 states and 634 transitions. [2025-02-05 10:44:14,153 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-02-05 10:44:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 446 states and 634 transitions. [2025-02-05 10:44:14,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2025-02-05 10:44:14,155 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:14,155 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, 1, 1, 1, 1, 1] [2025-02-05 10:44:14,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 10:44:14,155 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:14,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:14,156 INFO L85 PathProgramCache]: Analyzing trace with hash 582594237, now seen corresponding path program 1 times [2025-02-05 10:44:14,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:14,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267973141] [2025-02-05 10:44:14,156 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:14,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:14,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 115 statements into 1 equivalence classes. [2025-02-05 10:44:14,182 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 115 of 115 statements. [2025-02-05 10:44:14,182 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:14,182 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:14,335 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:14,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:14,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267973141] [2025-02-05 10:44:14,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267973141] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:14,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:14,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:14,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822643078] [2025-02-05 10:44:14,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:14,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:14,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:14,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:14,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:14,338 INFO L87 Difference]: Start difference. First operand 446 states and 634 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 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-02-05 10:44:14,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:14,680 INFO L93 Difference]: Finished difference Result 1326 states and 1888 transitions. [2025-02-05 10:44:14,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:14,680 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 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-02-05 10:44:14,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:14,683 INFO L225 Difference]: With dead ends: 1326 [2025-02-05 10:44:14,683 INFO L226 Difference]: Without dead ends: 882 [2025-02-05 10:44:14,683 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-02-05 10:44:14,684 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 148 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 346 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 346 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:14,684 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 84 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 346 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:14,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2025-02-05 10:44:14,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 875. [2025-02-05 10:44:14,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 875 states, 874 states have (on average 1.3729977116704806) internal successors, (1200), 874 states have internal predecessors, (1200), 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-02-05 10:44:14,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 875 states to 875 states and 1200 transitions. [2025-02-05 10:44:14,699 INFO L78 Accepts]: Start accepts. Automaton has 875 states and 1200 transitions. Word has length 115 [2025-02-05 10:44:14,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:14,700 INFO L471 AbstractCegarLoop]: Abstraction has 875 states and 1200 transitions. [2025-02-05 10:44:14,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 2 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-02-05 10:44:14,700 INFO L276 IsEmpty]: Start isEmpty. Operand 875 states and 1200 transitions. [2025-02-05 10:44:14,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 10:44:14,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:14,701 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, 1, 1, 1, 1, 1] [2025-02-05 10:44:14,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 10:44:14,702 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:14,702 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:14,702 INFO L85 PathProgramCache]: Analyzing trace with hash -261020793, now seen corresponding path program 1 times [2025-02-05 10:44:14,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:14,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255888819] [2025-02-05 10:44:14,703 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:14,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:14,716 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 10:44:14,720 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 10:44:14,720 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:14,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:14,757 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:14,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:14,757 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1255888819] [2025-02-05 10:44:14,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1255888819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:14,757 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:14,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 10:44:14,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1080668960] [2025-02-05 10:44:14,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:14,758 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:14,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:14,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:14,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:14,759 INFO L87 Difference]: Start difference. First operand 875 states and 1200 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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-02-05 10:44:15,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:15,088 INFO L93 Difference]: Finished difference Result 2591 states and 3558 transitions. [2025-02-05 10:44:15,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:15,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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-02-05 10:44:15,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:15,093 INFO L225 Difference]: With dead ends: 2591 [2025-02-05 10:44:15,093 INFO L226 Difference]: Without dead ends: 1718 [2025-02-05 10:44:15,094 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-02-05 10:44:15,095 INFO L435 NwaCegarLoop]: 51 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, 62 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-02-05 10:44:15,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 62 Invalid, 399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:15,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1718 states. [2025-02-05 10:44:15,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1718 to 1718. [2025-02-05 10:44:15,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1717 states have (on average 1.2958648806057076) internal successors, (2225), 1717 states have internal predecessors, (2225), 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-02-05 10:44:15,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2225 transitions. [2025-02-05 10:44:15,123 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2225 transitions. Word has length 119 [2025-02-05 10:44:15,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:15,123 INFO L471 AbstractCegarLoop]: Abstraction has 1718 states and 2225 transitions. [2025-02-05 10:44:15,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 2 states have internal predecessors, (119), 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-02-05 10:44:15,124 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2225 transitions. [2025-02-05 10:44:15,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-02-05 10:44:15,126 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:15,126 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:15,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 10:44:15,126 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:15,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:15,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1656413702, now seen corresponding path program 1 times [2025-02-05 10:44:15,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:15,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352340417] [2025-02-05 10:44:15,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:15,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:15,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-02-05 10:44:15,143 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-02-05 10:44:15,143 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:15,144 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:15,228 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:15,230 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:15,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352340417] [2025-02-05 10:44:15,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352340417] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:15,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:15,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:15,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [735975120] [2025-02-05 10:44:15,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:15,231 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:15,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:15,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:15,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:15,232 INFO L87 Difference]: Start difference. First operand 1718 states and 2225 transitions. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-02-05 10:44:15,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:15,595 INFO L93 Difference]: Finished difference Result 4273 states and 5527 transitions. [2025-02-05 10:44:15,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:15,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-02-05 10:44:15,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:15,603 INFO L225 Difference]: With dead ends: 4273 [2025-02-05 10:44:15,604 INFO L226 Difference]: Without dead ends: 2557 [2025-02-05 10:44:15,606 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-02-05 10:44:15,607 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 137 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:15,607 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 73 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2557 states. [2025-02-05 10:44:15,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2557 to 2557. [2025-02-05 10:44:15,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2557 states, 2556 states have (on average 1.2253521126760563) internal successors, (3132), 2556 states have internal predecessors, (3132), 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-02-05 10:44:15,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2557 states to 2557 states and 3132 transitions. [2025-02-05 10:44:15,645 INFO L78 Accepts]: Start accepts. Automaton has 2557 states and 3132 transitions. Word has length 119 [2025-02-05 10:44:15,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:15,645 INFO L471 AbstractCegarLoop]: Abstraction has 2557 states and 3132 transitions. [2025-02-05 10:44:15,645 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 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-02-05 10:44:15,646 INFO L276 IsEmpty]: Start isEmpty. Operand 2557 states and 3132 transitions. [2025-02-05 10:44:15,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-02-05 10:44:15,648 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:15,648 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, 1, 1, 1, 1, 1] [2025-02-05 10:44:15,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 10:44:15,649 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:15,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:15,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1305911082, now seen corresponding path program 1 times [2025-02-05 10:44:15,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:15,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065489036] [2025-02-05 10:44:15,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:15,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:15,662 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 10:44:15,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 10:44:15,669 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:15,669 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:15,964 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:15,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065489036] [2025-02-05 10:44:15,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065489036] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 10:44:15,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960431056] [2025-02-05 10:44:15,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:15,968 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:15,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 10:44:15,970 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 10:44:15,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 10:44:16,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-02-05 10:44:16,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-02-05 10:44:16,050 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:16,050 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:16,052 INFO L256 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 10:44:16,056 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 10:44:16,259 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:44:16,259 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 10:44:16,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960431056] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:16,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 10:44:16,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-02-05 10:44:16,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208687368] [2025-02-05 10:44:16,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:16,259 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:16,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:16,260 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:16,260 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:44:16,260 INFO L87 Difference]: Start difference. First operand 2557 states and 3132 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-02-05 10:44:16,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:16,821 INFO L93 Difference]: Finished difference Result 5110 states and 6260 transitions. [2025-02-05 10:44:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:16,821 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 124 [2025-02-05 10:44:16,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:16,828 INFO L225 Difference]: With dead ends: 5110 [2025-02-05 10:44:16,828 INFO L226 Difference]: Without dead ends: 2555 [2025-02-05 10:44:16,830 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 123 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 10:44:16,831 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 63 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:16,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 212 Invalid, 389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 10:44:16,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2025-02-05 10:44:16,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2415. [2025-02-05 10:44:16,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2415 states, 2414 states have (on average 1.1541010770505384) internal successors, (2786), 2414 states have internal predecessors, (2786), 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-02-05 10:44:16,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2415 states to 2415 states and 2786 transitions. [2025-02-05 10:44:16,864 INFO L78 Accepts]: Start accepts. Automaton has 2415 states and 2786 transitions. Word has length 124 [2025-02-05 10:44:16,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:16,865 INFO L471 AbstractCegarLoop]: Abstraction has 2415 states and 2786 transitions. [2025-02-05 10:44:16,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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-02-05 10:44:16,865 INFO L276 IsEmpty]: Start isEmpty. Operand 2415 states and 2786 transitions. [2025-02-05 10:44:16,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2025-02-05 10:44:16,868 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:16,868 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-05 10:44:16,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 10:44:17,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 10:44:17,074 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:17,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:17,074 INFO L85 PathProgramCache]: Analyzing trace with hash -1508741890, now seen corresponding path program 1 times [2025-02-05 10:44:17,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:17,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196600958] [2025-02-05 10:44:17,075 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:17,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:17,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 133 statements into 1 equivalence classes. [2025-02-05 10:44:17,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 133 of 133 statements. [2025-02-05 10:44:17,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:17,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:17,190 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:17,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:17,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196600958] [2025-02-05 10:44:17,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196600958] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:17,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:17,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:17,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626897646] [2025-02-05 10:44:17,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:17,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:17,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:17,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:17,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:17,192 INFO L87 Difference]: Start difference. First operand 2415 states and 2786 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-02-05 10:44:17,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:17,499 INFO L93 Difference]: Finished difference Result 5103 states and 5914 transitions. [2025-02-05 10:44:17,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:17,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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 133 [2025-02-05 10:44:17,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:17,506 INFO L225 Difference]: With dead ends: 5103 [2025-02-05 10:44:17,506 INFO L226 Difference]: Without dead ends: 2690 [2025-02-05 10:44:17,508 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-02-05 10:44:17,509 INFO L435 NwaCegarLoop]: 32 mSDtfsCounter, 141 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:17,509 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 38 Invalid, 401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:17,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2025-02-05 10:44:17,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2690. [2025-02-05 10:44:17,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2690 states, 2689 states have (on average 1.150985496467088) internal successors, (3095), 2689 states have internal predecessors, (3095), 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-02-05 10:44:17,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2690 states to 2690 states and 3095 transitions. [2025-02-05 10:44:17,546 INFO L78 Accepts]: Start accepts. Automaton has 2690 states and 3095 transitions. Word has length 133 [2025-02-05 10:44:17,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:17,546 INFO L471 AbstractCegarLoop]: Abstraction has 2690 states and 3095 transitions. [2025-02-05 10:44:17,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 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-02-05 10:44:17,547 INFO L276 IsEmpty]: Start isEmpty. Operand 2690 states and 3095 transitions. [2025-02-05 10:44:17,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2025-02-05 10:44:17,550 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:17,550 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, 1, 1, 1, 1, 1] [2025-02-05 10:44:17,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 10:44:17,550 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:17,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:17,551 INFO L85 PathProgramCache]: Analyzing trace with hash -2051221324, now seen corresponding path program 1 times [2025-02-05 10:44:17,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:17,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058261601] [2025-02-05 10:44:17,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:17,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:17,564 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 137 statements into 1 equivalence classes. [2025-02-05 10:44:17,568 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 137 of 137 statements. [2025-02-05 10:44:17,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:17,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:17,602 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 10:44:17,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:17,603 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058261601] [2025-02-05 10:44:17,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058261601] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:17,603 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:17,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:17,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131443740] [2025-02-05 10:44:17,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:17,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:17,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:17,604 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:17,604 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:17,604 INFO L87 Difference]: Start difference. First operand 2690 states and 3095 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-02-05 10:44:17,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:17,924 INFO L93 Difference]: Finished difference Result 5237 states and 6032 transitions. [2025-02-05 10:44:17,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:17,925 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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 137 [2025-02-05 10:44:17,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:17,931 INFO L225 Difference]: With dead ends: 5237 [2025-02-05 10:44:17,931 INFO L226 Difference]: Without dead ends: 2549 [2025-02-05 10:44:17,934 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-02-05 10:44:17,934 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 129 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:17,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 235 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:17,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2549 states. [2025-02-05 10:44:17,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2549 to 2403. [2025-02-05 10:44:17,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2403 states, 2402 states have (on average 1.1174021648626145) internal successors, (2684), 2402 states have internal predecessors, (2684), 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-02-05 10:44:17,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2403 states to 2403 states and 2684 transitions. [2025-02-05 10:44:17,968 INFO L78 Accepts]: Start accepts. Automaton has 2403 states and 2684 transitions. Word has length 137 [2025-02-05 10:44:17,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:17,968 INFO L471 AbstractCegarLoop]: Abstraction has 2403 states and 2684 transitions. [2025-02-05 10:44:17,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 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-02-05 10:44:17,969 INFO L276 IsEmpty]: Start isEmpty. Operand 2403 states and 2684 transitions. [2025-02-05 10:44:17,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2025-02-05 10:44:17,972 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:17,973 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:17,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 10:44:17,973 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:17,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:17,973 INFO L85 PathProgramCache]: Analyzing trace with hash 248991519, now seen corresponding path program 1 times [2025-02-05 10:44:17,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:17,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744333591] [2025-02-05 10:44:17,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:17,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:17,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 190 statements into 1 equivalence classes. [2025-02-05 10:44:17,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 190 of 190 statements. [2025-02-05 10:44:17,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:17,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:18,061 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-05 10:44:18,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:18,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744333591] [2025-02-05 10:44:18,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744333591] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:18,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:18,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:18,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1998437628] [2025-02-05 10:44:18,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:18,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:18,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:18,062 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:18,062 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:18,062 INFO L87 Difference]: Start difference. First operand 2403 states and 2684 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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-02-05 10:44:18,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:18,361 INFO L93 Difference]: Finished difference Result 3956 states and 4413 transitions. [2025-02-05 10:44:18,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:18,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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 190 [2025-02-05 10:44:18,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:18,366 INFO L225 Difference]: With dead ends: 3956 [2025-02-05 10:44:18,367 INFO L226 Difference]: Without dead ends: 2121 [2025-02-05 10:44:18,368 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-02-05 10:44:18,369 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 80 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:18,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 227 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:18,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2121 states. [2025-02-05 10:44:18,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2121 to 2121. [2025-02-05 10:44:18,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2121 states, 2120 states have (on average 1.0981132075471698) internal successors, (2328), 2120 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:18,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2121 states to 2121 states and 2328 transitions. [2025-02-05 10:44:18,419 INFO L78 Accepts]: Start accepts. Automaton has 2121 states and 2328 transitions. Word has length 190 [2025-02-05 10:44:18,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:18,419 INFO L471 AbstractCegarLoop]: Abstraction has 2121 states and 2328 transitions. [2025-02-05 10:44:18,419 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 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-02-05 10:44:18,419 INFO L276 IsEmpty]: Start isEmpty. Operand 2121 states and 2328 transitions. [2025-02-05 10:44:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2025-02-05 10:44:18,423 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 10:44:18,423 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:18,423 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 10:44:18,423 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 10:44:18,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 10:44:18,424 INFO L85 PathProgramCache]: Analyzing trace with hash -944287438, now seen corresponding path program 1 times [2025-02-05 10:44:18,424 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 10:44:18,424 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847229133] [2025-02-05 10:44:18,424 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 10:44:18,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 10:44:18,441 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 199 statements into 1 equivalence classes. [2025-02-05 10:44:18,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 199 of 199 statements. [2025-02-05 10:44:18,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 10:44:18,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 10:44:18,486 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 73 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-02-05 10:44:18,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 10:44:18,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847229133] [2025-02-05 10:44:18,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847229133] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 10:44:18,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 10:44:18,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 10:44:18,487 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [102831048] [2025-02-05 10:44:18,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 10:44:18,488 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 10:44:18,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 10:44:18,488 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 10:44:18,488 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 10:44:18,488 INFO L87 Difference]: Start difference. First operand 2121 states and 2328 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:18,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 10:44:18,769 INFO L93 Difference]: Finished difference Result 2825 states and 3082 transitions. [2025-02-05 10:44:18,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 10:44:18,770 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 199 [2025-02-05 10:44:18,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 10:44:18,770 INFO L225 Difference]: With dead ends: 2825 [2025-02-05 10:44:18,770 INFO L226 Difference]: Without dead ends: 0 [2025-02-05 10:44:18,772 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-02-05 10:44:18,772 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 111 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 316 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 316 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 10:44:18,772 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 214 Invalid, 360 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 316 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 10:44:18,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-02-05 10:44:18,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-02-05 10:44:18,773 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-02-05 10:44:18,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-02-05 10:44:18,773 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 199 [2025-02-05 10:44:18,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 10:44:18,773 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-02-05 10:44:18,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 10:44:18,773 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-02-05 10:44:18,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-02-05 10:44:18,776 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 10:44:18,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 10:44:18,778 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 10:44:18,780 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-02-05 10:44:18,950 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 10:44:18,962 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 10:44:18 BoogieIcfgContainer [2025-02-05 10:44:18,963 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 10:44:18,963 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 10:44:18,963 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 10:44:18,963 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 10:44:18,964 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 10:44:12" (3/4) ... [2025-02-05 10:44:18,965 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-02-05 10:44:18,976 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-02-05 10:44:18,977 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-02-05 10:44:18,978 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-02-05 10:44:18,978 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-02-05 10:44:19,103 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 10:44:19,103 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 10:44:19,103 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 10:44:19,105 INFO L158 Benchmark]: Toolchain (without parser) took 8419.93ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 155.9MB in the beginning and 80.2MB in the end (delta: 75.8MB). Peak memory consumption was 119.4MB. Max. memory is 16.1GB. [2025-02-05 10:44:19,105 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 209.7MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:44:19,105 INFO L158 Benchmark]: CACSL2BoogieTranslator took 387.11ms. Allocated memory is still 201.3MB. Free memory was 155.7MB in the beginning and 129.6MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-02-05 10:44:19,105 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.97ms. Allocated memory is still 201.3MB. Free memory was 129.6MB in the beginning and 124.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 10:44:19,105 INFO L158 Benchmark]: Boogie Preprocessor took 49.76ms. Allocated memory is still 201.3MB. Free memory was 124.6MB in the beginning and 120.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 10:44:19,105 INFO L158 Benchmark]: IcfgBuilder took 821.22ms. Allocated memory is still 201.3MB. Free memory was 120.6MB in the beginning and 140.5MB in the end (delta: -19.9MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. [2025-02-05 10:44:19,105 INFO L158 Benchmark]: TraceAbstraction took 6944.95ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 140.5MB in the beginning and 91.8MB in the end (delta: 48.7MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2025-02-05 10:44:19,105 INFO L158 Benchmark]: Witness Printer took 140.21ms. Allocated memory is still 243.3MB. Free memory was 91.8MB in the beginning and 80.2MB in the end (delta: 11.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 10:44:19,106 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 209.7MB. Free memory is still 124.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 387.11ms. Allocated memory is still 201.3MB. Free memory was 155.7MB in the beginning and 129.6MB in the end (delta: 26.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.97ms. Allocated memory is still 201.3MB. Free memory was 129.6MB in the beginning and 124.6MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 49.76ms. Allocated memory is still 201.3MB. Free memory was 124.6MB in the beginning and 120.6MB in the end (delta: 4.0MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 821.22ms. Allocated memory is still 201.3MB. Free memory was 120.6MB in the beginning and 140.5MB in the end (delta: -19.9MB). Peak memory consumption was 84.0MB. Max. memory is 16.1GB. * TraceAbstraction took 6944.95ms. Allocated memory was 201.3MB in the beginning and 243.3MB in the end (delta: 41.9MB). Free memory was 140.5MB in the beginning and 91.8MB in the end (delta: 48.7MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. * Witness Printer took 140.21ms. Allocated memory is still 243.3MB. Free memory was 91.8MB in the beginning and 80.2MB in the end (delta: 11.6MB). 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: 473]: 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: 6.7s, OverallIterations: 11, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1507 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1507 mSDsluCounter, 1328 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 136 mSDsCounter, 618 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3696 IncrementalHoareTripleChecker+Invalid, 4314 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 618 mSolverCounterUnsat, 1192 mSDtfsCounter, 3696 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 152 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2690occurred in iteration=8, InterpolantAutomatonStates: 33, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.3s AutomataMinimizationTime, 11 MinimizatonAttempts, 296 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1577 NumberOfCodeBlocks, 1577 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 1565 ConstructedInterpolants, 0 QuantifiedInterpolants, 4219 SizeOfPredicates, 0 NumberOfNonLiveVariables, 250 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 12 InterpolantComputations, 11 PerfectInterpolantSequences, 488/504 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]: Location Invariant Derived location invariant: (((((((((((((((a17 == 8) && (a28 <= 9)) && (a11 == 1)) && (a19 == 1)) && (a25 == 0)) || (((((a17 == 8) && (a25 == 1)) && (a11 == 1)) && (a28 <= 10)) && (a19 == 1))) || ((((a25 == 1) && (a28 <= 9)) && (a17 <= 7)) && (a19 == 1))) || (((((a11 == 1) && (a17 <= 7)) && (a28 <= 10)) && (a19 == 1)) && (a25 == 0))) || (((((a17 == 8) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1)) && (a25 == 0))) || (((((a17 == 8) && (a25 == 1)) && (a11 <= 0)) && (a28 <= 10)) && (a19 <= 0))) || ((((a17 <= 7) && (a28 <= 10)) && (a25 == 0)) && (a19 <= 0))) || (((((a17 == 8) && (a28 <= 9)) && (a11 == 1)) && (a25 == 0)) && (a19 <= 0))) || ((((a25 == 1) && (a28 <= 9)) && (a17 <= 7)) && (a19 <= 0))) || (((((a17 == 8) && (a28 <= 9)) && (a11 <= 0)) && (a25 == 0)) && (a19 <= 0))) || ((((a17 == 8) && (a25 == 1)) && (a11 <= 0)) && (a19 == 1))) RESULT: Ultimate proved your program to be correct! [2025-02-05 10:44:19,143 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