./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label41.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem11_label41.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 fbec2ea101c707e702b17d0034cae7e7b8797fb6283b52539a46012e389affe6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:42:44,362 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:42:44,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:42:44,400 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:42:44,401 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:42:44,416 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:42:44,416 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:42:44,416 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:42:44,417 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:42:44,417 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:42:44,417 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:42:44,417 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:42:44,417 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:42:44,417 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:42:44,417 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:42:44,417 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:42:44,417 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:42:44,417 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:42:44,417 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:42:44,417 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:42:44,417 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:42:44,417 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:42:44,418 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:44,418 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:44,418 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:42:44,418 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:42:44,419 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:42:44,419 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:42:44,419 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:42:44,419 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:42:44,419 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:42:44,419 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:42:44,419 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:42:44,419 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 -> fbec2ea101c707e702b17d0034cae7e7b8797fb6283b52539a46012e389affe6 [2025-01-08 23:42:44,613 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:42:44,618 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:42:44,619 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:42:44,620 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:42:44,620 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:42:44,621 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label41.c [2025-01-08 23:42:45,789 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e656787b1/506a4385918f476985409a4d85b4ff06/FLAGb73084346 [2025-01-08 23:42:46,159 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:42:46,160 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label41.c [2025-01-08 23:42:46,169 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e656787b1/506a4385918f476985409a4d85b4ff06/FLAGb73084346 [2025-01-08 23:42:46,182 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e656787b1/506a4385918f476985409a4d85b4ff06 [2025-01-08 23:42:46,184 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:42:46,185 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:42:46,186 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:42:46,186 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:42:46,189 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:42:46,190 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,191 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@76c79c1d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46, skipping insertion in model container [2025-01-08 23:42:46,191 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,230 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:42:46,349 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/Problem11_label41.c[3129,3142] [2025-01-08 23:42:46,491 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:42:46,497 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:42:46,510 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/Problem11_label41.c[3129,3142] [2025-01-08 23:42:46,613 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:42:46,623 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:42:46,623 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46 WrapperNode [2025-01-08 23:42:46,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:42:46,624 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:42:46,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:42:46,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:42:46,628 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,647 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,735 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:42:46,736 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:42:46,736 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:42:46,736 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:42:46,737 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:42:46,743 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,744 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,755 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,797 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-08 23:42:46,797 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,798 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,836 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,844 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,855 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,865 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,876 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,889 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:42:46,891 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:42:46,891 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:42:46,891 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:42:46,892 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (1/1) ... [2025-01-08 23:42:46,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:42:46,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:46,921 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-08 23:42:46,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-08 23:42:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:42:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:42:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:42:46,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:42:47,013 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:42:47,015 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:42:48,394 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:42:48,395 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:42:48,403 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:42:48,403 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:42:48,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:48 BoogieIcfgContainer [2025-01-08 23:42:48,404 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:42:48,405 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:42:48,405 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:42:48,408 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:42:48,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:42:46" (1/3) ... [2025-01-08 23:42:48,408 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f662c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:42:48, skipping insertion in model container [2025-01-08 23:42:48,408 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:42:46" (2/3) ... [2025-01-08 23:42:48,409 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@72f662c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:42:48, skipping insertion in model container [2025-01-08 23:42:48,409 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:48" (3/3) ... [2025-01-08 23:42:48,409 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label41.c [2025-01-08 23:42:48,418 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:42:48,419 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label41.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:42:48,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:42:48,458 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;@739c98e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:42:48,458 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:42:48,461 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:48,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2025-01-08 23:42:48,463 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:48,464 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] [2025-01-08 23:42:48,464 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:48,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:48,467 INFO L85 PathProgramCache]: Analyzing trace with hash 2130108164, now seen corresponding path program 1 times [2025-01-08 23:42:48,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:48,472 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314482861] [2025-01-08 23:42:48,472 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:48,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:48,515 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 21 statements into 1 equivalence classes. [2025-01-08 23:42:48,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 21 of 21 statements. [2025-01-08 23:42:48,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:48,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:48,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:48,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:48,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314482861] [2025-01-08 23:42:48,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314482861] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:48,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:48,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:48,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122618348] [2025-01-08 23:42:48,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:48,624 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:48,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:48,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:48,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:48,637 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 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 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:49,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:49,457 INFO L93 Difference]: Finished difference Result 769 states and 1357 transitions. [2025-01-08 23:42:49,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:49,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2025-01-08 23:42:49,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:49,465 INFO L225 Difference]: With dead ends: 769 [2025-01-08 23:42:49,468 INFO L226 Difference]: Without dead ends: 422 [2025-01-08 23:42:49,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:49,478 INFO L435 NwaCegarLoop]: 142 mSDtfsCounter, 219 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 208 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 208 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:49,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 164 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [208 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:49,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2025-01-08 23:42:49,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 412. [2025-01-08 23:42:49,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 411 states have (on average 1.5231143552311435) internal successors, (626), 411 states have internal predecessors, (626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:49,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 626 transitions. [2025-01-08 23:42:49,530 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 626 transitions. Word has length 21 [2025-01-08 23:42:49,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:49,530 INFO L471 AbstractCegarLoop]: Abstraction has 412 states and 626 transitions. [2025-01-08 23:42:49,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 2 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:49,530 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 626 transitions. [2025-01-08 23:42:49,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2025-01-08 23:42:49,531 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:49,532 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:42:49,532 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:42:49,532 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:49,532 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:49,533 INFO L85 PathProgramCache]: Analyzing trace with hash -2047346202, now seen corresponding path program 1 times [2025-01-08 23:42:49,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:49,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737969495] [2025-01-08 23:42:49,533 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:49,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:49,545 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-01-08 23:42:49,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-01-08 23:42:49,596 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:49,596 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:49,772 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:49,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:49,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737969495] [2025-01-08 23:42:49,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737969495] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:49,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:49,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:49,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1111914265] [2025-01-08 23:42:49,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:49,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:49,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:49,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:49,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:49,777 INFO L87 Difference]: Start difference. First operand 412 states and 626 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:50,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:50,558 INFO L93 Difference]: Finished difference Result 1199 states and 1829 transitions. [2025-01-08 23:42:50,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:50,559 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 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 87 [2025-01-08 23:42:50,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:50,563 INFO L225 Difference]: With dead ends: 1199 [2025-01-08 23:42:50,563 INFO L226 Difference]: Without dead ends: 789 [2025-01-08 23:42:50,568 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:50,569 INFO L435 NwaCegarLoop]: 147 mSDtfsCounter, 156 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 543 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 543 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:50,569 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 176 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 543 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:50,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2025-01-08 23:42:50,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2025-01-08 23:42:50,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:50,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-01-08 23:42:50,601 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 87 [2025-01-08 23:42:50,602 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:50,602 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-01-08 23:42:50,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 2 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:50,602 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-01-08 23:42:50,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2025-01-08 23:42:50,603 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:50,604 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-01-08 23:42:50,604 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:42:50,604 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:50,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:50,604 INFO L85 PathProgramCache]: Analyzing trace with hash 778974768, now seen corresponding path program 1 times [2025-01-08 23:42:50,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:50,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315511000] [2025-01-08 23:42:50,605 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:50,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:50,616 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 91 statements into 1 equivalence classes. [2025-01-08 23:42:50,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 91 of 91 statements. [2025-01-08 23:42:50,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:50,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:50,845 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:50,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:50,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315511000] [2025-01-08 23:42:50,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315511000] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:50,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:50,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:50,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635386026] [2025-01-08 23:42:50,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:50,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:50,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:50,851 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:50,851 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:50,851 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:51,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:51,532 INFO L93 Difference]: Finished difference Result 2316 states and 3182 transitions. [2025-01-08 23:42:51,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:51,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2025-01-08 23:42:51,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:51,537 INFO L225 Difference]: With dead ends: 2316 [2025-01-08 23:42:51,537 INFO L226 Difference]: Without dead ends: 1529 [2025-01-08 23:42:51,538 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:51,539 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 121 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:51,539 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 194 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:42:51,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2025-01-08 23:42:51,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1526. [2025-01-08 23:42:51,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2177049180327868) internal successors, (1857), 1525 states have internal predecessors, (1857), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1857 transitions. [2025-01-08 23:42:51,559 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1857 transitions. Word has length 91 [2025-01-08 23:42:51,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:51,559 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1857 transitions. [2025-01-08 23:42:51,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1857 transitions. [2025-01-08 23:42:51,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2025-01-08 23:42:51,563 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:51,563 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:51,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:42:51,565 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:51,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:51,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1303895989, now seen corresponding path program 1 times [2025-01-08 23:42:51,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:51,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [627527956] [2025-01-08 23:42:51,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:51,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:51,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 148 statements into 1 equivalence classes. [2025-01-08 23:42:51,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 148 of 148 statements. [2025-01-08 23:42:51,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:51,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:51,745 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:42:51,745 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:51,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [627527956] [2025-01-08 23:42:51,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [627527956] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:51,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:51,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:51,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1095903464] [2025-01-08 23:42:51,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:51,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:51,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:51,747 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:51,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:51,748 INFO L87 Difference]: Start difference. First operand 1526 states and 1857 transitions. Second operand has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:52,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:52,341 INFO L93 Difference]: Finished difference Result 3257 states and 4125 transitions. [2025-01-08 23:42:52,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:52,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 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 148 [2025-01-08 23:42:52,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:52,348 INFO L225 Difference]: With dead ends: 3257 [2025-01-08 23:42:52,349 INFO L226 Difference]: Without dead ends: 1917 [2025-01-08 23:42:52,350 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:52,351 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 214 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:52,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [214 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:52,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-01-08 23:42:52,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1914. [2025-01-08 23:42:52,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.246732880292734) internal successors, (2385), 1913 states have internal predecessors, (2385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:52,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2385 transitions. [2025-01-08 23:42:52,378 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2385 transitions. Word has length 148 [2025-01-08 23:42:52,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:52,378 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2385 transitions. [2025-01-08 23:42:52,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:52,379 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2385 transitions. [2025-01-08 23:42:52,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-01-08 23:42:52,381 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:52,381 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:52,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:42:52,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:52,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:52,382 INFO L85 PathProgramCache]: Analyzing trace with hash -945139213, now seen corresponding path program 1 times [2025-01-08 23:42:52,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:52,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641075225] [2025-01-08 23:42:52,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:52,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:52,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-01-08 23:42:52,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-01-08 23:42:52,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:52,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:52,649 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:42:52,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:52,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641075225] [2025-01-08 23:42:52,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641075225] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:52,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:52,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:52,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914063767] [2025-01-08 23:42:52,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:52,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:52,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:52,651 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:52,651 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:52,652 INFO L87 Difference]: Start difference. First operand 1914 states and 2385 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:53,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:53,427 INFO L93 Difference]: Finished difference Result 4565 states and 5845 transitions. [2025-01-08 23:42:53,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:53,428 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 203 [2025-01-08 23:42:53,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:53,435 INFO L225 Difference]: With dead ends: 4565 [2025-01-08 23:42:53,436 INFO L226 Difference]: Without dead ends: 2652 [2025-01-08 23:42:53,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:53,439 INFO L435 NwaCegarLoop]: 345 mSDtfsCounter, 188 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 590 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 365 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:53,439 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [188 Valid, 365 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 590 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:42:53,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2652 states. [2025-01-08 23:42:53,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2652 to 2652. [2025-01-08 23:42:53,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2652 states, 2651 states have (on average 1.2742361373066766) internal successors, (3378), 2651 states have internal predecessors, (3378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:53,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2652 states to 2652 states and 3378 transitions. [2025-01-08 23:42:53,472 INFO L78 Accepts]: Start accepts. Automaton has 2652 states and 3378 transitions. Word has length 203 [2025-01-08 23:42:53,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:53,472 INFO L471 AbstractCegarLoop]: Abstraction has 2652 states and 3378 transitions. [2025-01-08 23:42:53,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:53,472 INFO L276 IsEmpty]: Start isEmpty. Operand 2652 states and 3378 transitions. [2025-01-08 23:42:53,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-01-08 23:42:53,474 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:53,474 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:53,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:42:53,474 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:53,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:53,475 INFO L85 PathProgramCache]: Analyzing trace with hash 289376855, now seen corresponding path program 1 times [2025-01-08 23:42:53,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:53,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778431471] [2025-01-08 23:42:53,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:53,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:53,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-01-08 23:42:53,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-01-08 23:42:53,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:53,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:53,644 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2025-01-08 23:42:53,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:53,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778431471] [2025-01-08 23:42:53,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778431471] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:53,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:53,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:53,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146002114] [2025-01-08 23:42:53,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:53,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:53,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:53,646 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:53,646 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:53,646 INFO L87 Difference]: Start difference. First operand 2652 states and 3378 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:54,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:54,266 INFO L93 Difference]: Finished difference Result 6046 states and 7834 transitions. [2025-01-08 23:42:54,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:54,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 214 [2025-01-08 23:42:54,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:54,275 INFO L225 Difference]: With dead ends: 6046 [2025-01-08 23:42:54,275 INFO L226 Difference]: Without dead ends: 3580 [2025-01-08 23:42:54,277 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:54,277 INFO L435 NwaCegarLoop]: 367 mSDtfsCounter, 175 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 582 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 582 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:54,277 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 389 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 582 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:54,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3580 states. [2025-01-08 23:42:54,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3580 to 3571. [2025-01-08 23:42:54,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3571 states, 3570 states have (on average 1.2442577030812325) internal successors, (4442), 3570 states have internal predecessors, (4442), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:54,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3571 states to 3571 states and 4442 transitions. [2025-01-08 23:42:54,316 INFO L78 Accepts]: Start accepts. Automaton has 3571 states and 4442 transitions. Word has length 214 [2025-01-08 23:42:54,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:54,317 INFO L471 AbstractCegarLoop]: Abstraction has 3571 states and 4442 transitions. [2025-01-08 23:42:54,317 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:54,317 INFO L276 IsEmpty]: Start isEmpty. Operand 3571 states and 4442 transitions. [2025-01-08 23:42:54,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2025-01-08 23:42:54,319 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:54,319 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:54,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:42:54,319 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:54,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:54,320 INFO L85 PathProgramCache]: Analyzing trace with hash -436472503, now seen corresponding path program 1 times [2025-01-08 23:42:54,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:54,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491182085] [2025-01-08 23:42:54,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:54,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:54,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 234 statements into 1 equivalence classes. [2025-01-08 23:42:54,362 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 234 of 234 statements. [2025-01-08 23:42:54,363 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:54,363 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:54,444 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-01-08 23:42:54,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:54,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491182085] [2025-01-08 23:42:54,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491182085] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:54,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:54,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:54,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659943810] [2025-01-08 23:42:54,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:54,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:54,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:54,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:54,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:54,446 INFO L87 Difference]: Start difference. First operand 3571 states and 4442 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:55,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:55,054 INFO L93 Difference]: Finished difference Result 9167 states and 11617 transitions. [2025-01-08 23:42:55,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:55,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 234 [2025-01-08 23:42:55,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:55,067 INFO L225 Difference]: With dead ends: 9167 [2025-01-08 23:42:55,067 INFO L226 Difference]: Without dead ends: 5781 [2025-01-08 23:42:55,070 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:55,071 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 209 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 502 mSolverCounterSat, 187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 187 IncrementalHoareTripleChecker+Valid, 502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:55,071 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 268 Invalid, 689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [187 Valid, 502 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:55,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5781 states. [2025-01-08 23:42:55,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5781 to 5778. [2025-01-08 23:42:55,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5778 states, 5777 states have (on average 1.2338584040159253) internal successors, (7128), 5777 states have internal predecessors, (7128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:55,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5778 states to 5778 states and 7128 transitions. [2025-01-08 23:42:55,170 INFO L78 Accepts]: Start accepts. Automaton has 5778 states and 7128 transitions. Word has length 234 [2025-01-08 23:42:55,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:55,170 INFO L471 AbstractCegarLoop]: Abstraction has 5778 states and 7128 transitions. [2025-01-08 23:42:55,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:55,171 INFO L276 IsEmpty]: Start isEmpty. Operand 5778 states and 7128 transitions. [2025-01-08 23:42:55,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2025-01-08 23:42:55,176 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:55,176 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:55,176 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:42:55,176 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:55,177 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:55,177 INFO L85 PathProgramCache]: Analyzing trace with hash -273980523, now seen corresponding path program 1 times [2025-01-08 23:42:55,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:55,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422083804] [2025-01-08 23:42:55,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:55,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:55,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 295 statements into 1 equivalence classes. [2025-01-08 23:42:55,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 295 of 295 statements. [2025-01-08 23:42:55,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:55,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:55,409 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-08 23:42:55,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:55,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422083804] [2025-01-08 23:42:55,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422083804] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:55,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:55,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:55,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683886982] [2025-01-08 23:42:55,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:55,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:55,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:55,411 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:55,412 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:55,412 INFO L87 Difference]: Start difference. First operand 5778 states and 7128 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:55,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:55,998 INFO L93 Difference]: Finished difference Result 12670 states and 15866 transitions. [2025-01-08 23:42:55,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:55,998 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 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 295 [2025-01-08 23:42:55,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:56,012 INFO L225 Difference]: With dead ends: 12670 [2025-01-08 23:42:56,012 INFO L226 Difference]: Without dead ends: 7078 [2025-01-08 23:42:56,017 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:56,017 INFO L435 NwaCegarLoop]: 312 mSDtfsCounter, 182 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:56,017 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 332 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:56,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7078 states. [2025-01-08 23:42:56,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7078 to 6882. [2025-01-08 23:42:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6882 states, 6881 states have (on average 1.2166836215666328) internal successors, (8372), 6881 states have internal predecessors, (8372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:56,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6882 states to 6882 states and 8372 transitions. [2025-01-08 23:42:56,136 INFO L78 Accepts]: Start accepts. Automaton has 6882 states and 8372 transitions. Word has length 295 [2025-01-08 23:42:56,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:56,136 INFO L471 AbstractCegarLoop]: Abstraction has 6882 states and 8372 transitions. [2025-01-08 23:42:56,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 3 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:56,137 INFO L276 IsEmpty]: Start isEmpty. Operand 6882 states and 8372 transitions. [2025-01-08 23:42:56,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 357 [2025-01-08 23:42:56,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:56,144 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-01-08 23:42:56,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:42:56,145 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:56,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:56,145 INFO L85 PathProgramCache]: Analyzing trace with hash -1454131822, now seen corresponding path program 1 times [2025-01-08 23:42:56,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:56,146 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427347270] [2025-01-08 23:42:56,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:56,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:56,175 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 356 statements into 1 equivalence classes. [2025-01-08 23:42:56,196 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 356 of 356 statements. [2025-01-08 23:42:56,196 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:56,196 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 257 proven. 0 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2025-01-08 23:42:56,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:56,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427347270] [2025-01-08 23:42:56,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427347270] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:56,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:56,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:56,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413837455] [2025-01-08 23:42:56,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:56,351 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:56,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:56,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:56,351 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:56,351 INFO L87 Difference]: Start difference. First operand 6882 states and 8372 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:56,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:56,949 INFO L93 Difference]: Finished difference Result 13002 states and 15803 transitions. [2025-01-08 23:42:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:56,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 356 [2025-01-08 23:42:56,950 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:56,969 INFO L225 Difference]: With dead ends: 13002 [2025-01-08 23:42:56,969 INFO L226 Difference]: Without dead ends: 6122 [2025-01-08 23:42:56,975 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:56,977 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 106 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 447 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 583 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 447 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:56,978 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 146 Invalid, 583 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 447 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:56,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6122 states. [2025-01-08 23:42:57,032 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6122 to 5568. [2025-01-08 23:42:57,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5568 states, 5567 states have (on average 1.1546613975211064) internal successors, (6428), 5567 states have internal predecessors, (6428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:57,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5568 states to 5568 states and 6428 transitions. [2025-01-08 23:42:57,049 INFO L78 Accepts]: Start accepts. Automaton has 5568 states and 6428 transitions. Word has length 356 [2025-01-08 23:42:57,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:57,050 INFO L471 AbstractCegarLoop]: Abstraction has 5568 states and 6428 transitions. [2025-01-08 23:42:57,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:57,050 INFO L276 IsEmpty]: Start isEmpty. Operand 5568 states and 6428 transitions. [2025-01-08 23:42:57,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2025-01-08 23:42:57,058 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:57,058 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-01-08 23:42:57,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:42:57,058 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:57,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:57,060 INFO L85 PathProgramCache]: Analyzing trace with hash -806091575, now seen corresponding path program 1 times [2025-01-08 23:42:57,060 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:57,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254883837] [2025-01-08 23:42:57,060 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:57,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:57,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 379 statements into 1 equivalence classes. [2025-01-08 23:42:57,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 379 of 379 statements. [2025-01-08 23:42:57,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:57,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:57,233 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-01-08 23:42:57,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:57,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254883837] [2025-01-08 23:42:57,234 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254883837] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:57,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:57,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:57,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459508609] [2025-01-08 23:42:57,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:57,234 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:57,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:57,235 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:57,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:57,235 INFO L87 Difference]: Start difference. First operand 5568 states and 6428 transitions. Second operand has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:57,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:57,777 INFO L93 Difference]: Finished difference Result 12053 states and 13977 transitions. [2025-01-08 23:42:57,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:57,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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 379 [2025-01-08 23:42:57,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:57,787 INFO L225 Difference]: With dead ends: 12053 [2025-01-08 23:42:57,787 INFO L226 Difference]: Without dead ends: 6487 [2025-01-08 23:42:57,790 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:57,791 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 66 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 341 SdHoareTripleChecker+Invalid, 601 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:57,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 341 Invalid, 601 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:57,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6487 states. [2025-01-08 23:42:57,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6487 to 6303. [2025-01-08 23:42:57,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6303 states, 6302 states have (on average 1.1591558235480799) internal successors, (7305), 6302 states have internal predecessors, (7305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:57,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6303 states to 6303 states and 7305 transitions. [2025-01-08 23:42:57,849 INFO L78 Accepts]: Start accepts. Automaton has 6303 states and 7305 transitions. Word has length 379 [2025-01-08 23:42:57,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:57,849 INFO L471 AbstractCegarLoop]: Abstraction has 6303 states and 7305 transitions. [2025-01-08 23:42:57,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:57,850 INFO L276 IsEmpty]: Start isEmpty. Operand 6303 states and 7305 transitions. [2025-01-08 23:42:57,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-08 23:42:57,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:57,857 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:42:57,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:42:57,857 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:57,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:57,858 INFO L85 PathProgramCache]: Analyzing trace with hash -686904803, now seen corresponding path program 1 times [2025-01-08 23:42:57,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:57,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174983083] [2025-01-08 23:42:57,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:57,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:57,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-08 23:42:57,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-08 23:42:57,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:57,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:58,188 INFO L134 CoverageAnalysis]: Checked inductivity of 405 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 111 trivial. 0 not checked. [2025-01-08 23:42:58,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:58,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174983083] [2025-01-08 23:42:58,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [174983083] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:58,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:58,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:58,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766565929] [2025-01-08 23:42:58,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:58,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:58,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:58,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:58,190 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:58,190 INFO L87 Difference]: Start difference. First operand 6303 states and 7305 transitions. Second operand has 4 states, 4 states have (on average 70.75) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:59,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:59,162 INFO L93 Difference]: Finished difference Result 17227 states and 19895 transitions. [2025-01-08 23:42:59,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:59,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 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 393 [2025-01-08 23:42:59,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:59,180 INFO L225 Difference]: With dead ends: 17227 [2025-01-08 23:42:59,180 INFO L226 Difference]: Without dead ends: 10926 [2025-01-08 23:42:59,187 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:59,187 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 217 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:59,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 82 Invalid, 1248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:42:59,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10926 states. [2025-01-08 23:42:59,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10926 to 10741. [2025-01-08 23:42:59,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10741 states, 10740 states have (on average 1.153072625698324) internal successors, (12384), 10740 states have internal predecessors, (12384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:59,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10741 states to 10741 states and 12384 transitions. [2025-01-08 23:42:59,362 INFO L78 Accepts]: Start accepts. Automaton has 10741 states and 12384 transitions. Word has length 393 [2025-01-08 23:42:59,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:59,363 INFO L471 AbstractCegarLoop]: Abstraction has 10741 states and 12384 transitions. [2025-01-08 23:42:59,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.75) internal successors, (283), 3 states have internal predecessors, (283), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 10741 states and 12384 transitions. [2025-01-08 23:42:59,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-01-08 23:42:59,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:59,394 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:59,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:42:59,394 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:59,394 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:59,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1286629871, now seen corresponding path program 1 times [2025-01-08 23:42:59,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:59,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176787474] [2025-01-08 23:42:59,394 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:59,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:59,455 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-08 23:42:59,492 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-08 23:42:59,492 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:59,492 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:00,099 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 376 proven. 24 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-01-08 23:43:00,100 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:00,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176787474] [2025-01-08 23:43:00,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176787474] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:43:00,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497646834] [2025-01-08 23:43:00,100 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:00,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:43:00,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:43:00,102 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:43:00,104 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-08 23:43:00,163 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-01-08 23:43:00,242 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-01-08 23:43:00,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:00,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:00,245 INFO L256 TraceCheckSpWp]: Trace formula consists of 644 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:43:00,258 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:43:00,442 INFO L134 CoverageAnalysis]: Checked inductivity of 674 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-01-08 23:43:00,445 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:43:00,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1497646834] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:00,446 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:43:00,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:43:00,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553766312] [2025-01-08 23:43:00,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:00,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:00,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:00,447 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:00,447 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:43:00,447 INFO L87 Difference]: Start difference. First operand 10741 states and 12384 transitions. Second operand has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:01,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:01,006 INFO L93 Difference]: Finished difference Result 21677 states and 25066 transitions. [2025-01-08 23:43:01,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:01,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 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 480 [2025-01-08 23:43:01,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:01,022 INFO L225 Difference]: With dead ends: 21677 [2025-01-08 23:43:01,022 INFO L226 Difference]: Without dead ends: 12414 [2025-01-08 23:43:01,029 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 479 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:43:01,029 INFO L435 NwaCegarLoop]: 91 mSDtfsCounter, 87 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 534 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 658 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:01,030 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 98 Invalid, 658 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 534 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:01,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12414 states. [2025-01-08 23:43:01,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12414 to 10925. [2025-01-08 23:43:01,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10925 states, 10924 states have (on average 1.1536067374588064) internal successors, (12602), 10924 states have internal predecessors, (12602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:01,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10925 states to 10925 states and 12602 transitions. [2025-01-08 23:43:01,112 INFO L78 Accepts]: Start accepts. Automaton has 10925 states and 12602 transitions. Word has length 480 [2025-01-08 23:43:01,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:01,113 INFO L471 AbstractCegarLoop]: Abstraction has 10925 states and 12602 transitions. [2025-01-08 23:43:01,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.33333333333333) internal successors, (289), 3 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:01,113 INFO L276 IsEmpty]: Start isEmpty. Operand 10925 states and 12602 transitions. [2025-01-08 23:43:01,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-01-08 23:43:01,158 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:01,159 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:01,169 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-08 23:43:01,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-01-08 23:43:01,360 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:01,360 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:01,360 INFO L85 PathProgramCache]: Analyzing trace with hash -1564697191, now seen corresponding path program 1 times [2025-01-08 23:43:01,360 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:01,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725934135] [2025-01-08 23:43:01,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:01,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:01,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-01-08 23:43:01,435 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-01-08 23:43:01,435 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:01,435 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 673 backedges. 504 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-01-08 23:43:01,719 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:01,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725934135] [2025-01-08 23:43:01,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725934135] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:01,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:01,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:01,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414392991] [2025-01-08 23:43:01,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:01,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:01,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:01,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:01,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:01,724 INFO L87 Difference]: Start difference. First operand 10925 states and 12602 transitions. Second operand has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:02,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:02,412 INFO L93 Difference]: Finished difference Result 25919 states and 29917 transitions. [2025-01-08 23:43:02,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:02,413 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 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 481 [2025-01-08 23:43:02,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:02,454 INFO L225 Difference]: With dead ends: 25919 [2025-01-08 23:43:02,457 INFO L226 Difference]: Without dead ends: 15732 [2025-01-08 23:43:02,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:02,478 INFO L435 NwaCegarLoop]: 109 mSDtfsCounter, 140 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 578 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:02,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 130 Invalid, 647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 578 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:43:02,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15732 states. [2025-01-08 23:43:02,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15732 to 15546. [2025-01-08 23:43:02,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15546 states, 15545 states have (on average 1.1327758121582503) internal successors, (17609), 15545 states have internal predecessors, (17609), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:02,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15546 states to 15546 states and 17609 transitions. [2025-01-08 23:43:02,649 INFO L78 Accepts]: Start accepts. Automaton has 15546 states and 17609 transitions. Word has length 481 [2025-01-08 23:43:02,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:02,649 INFO L471 AbstractCegarLoop]: Abstraction has 15546 states and 17609 transitions. [2025-01-08 23:43:02,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.0) internal successors, (333), 3 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:02,649 INFO L276 IsEmpty]: Start isEmpty. Operand 15546 states and 17609 transitions. [2025-01-08 23:43:02,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-01-08 23:43:02,661 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:02,662 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:02,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-08 23:43:02,662 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:02,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:02,663 INFO L85 PathProgramCache]: Analyzing trace with hash 1679999698, now seen corresponding path program 1 times [2025-01-08 23:43:02,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:02,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486803327] [2025-01-08 23:43:02,663 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:02,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:02,692 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-01-08 23:43:02,715 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-01-08 23:43:02,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:02,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:03,376 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 156 proven. 406 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2025-01-08 23:43:03,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:03,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486803327] [2025-01-08 23:43:03,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486803327] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:43:03,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [812994740] [2025-01-08 23:43:03,378 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:03,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:43:03,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:43:03,379 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:43:03,381 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-08 23:43:03,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-01-08 23:43:03,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-01-08 23:43:03,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:03,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:03,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 655 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:43:03,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:43:04,154 INFO L134 CoverageAnalysis]: Checked inductivity of 693 backedges. 593 proven. 0 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2025-01-08 23:43:04,155 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:43:04,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [812994740] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:04,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:43:04,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:43:04,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [478409768] [2025-01-08 23:43:04,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:04,157 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:04,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:04,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:04,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:43:04,158 INFO L87 Difference]: Start difference. First operand 15546 states and 17609 transitions. Second operand has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:05,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:05,208 INFO L93 Difference]: Finished difference Result 33868 states and 38501 transitions. [2025-01-08 23:43:05,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:05,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 491 [2025-01-08 23:43:05,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:05,232 INFO L225 Difference]: With dead ends: 33868 [2025-01-08 23:43:05,232 INFO L226 Difference]: Without dead ends: 20168 [2025-01-08 23:43:05,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 495 GetRequests, 489 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:43:05,244 INFO L435 NwaCegarLoop]: 38 mSDtfsCounter, 226 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1114 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 1233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 1114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:05,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 82 Invalid, 1233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 1114 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:43:05,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20168 states. [2025-01-08 23:43:05,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20168 to 15178. [2025-01-08 23:43:05,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15178 states, 15177 states have (on average 1.1325031297357844) internal successors, (17188), 15177 states have internal predecessors, (17188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:05,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15178 states to 15178 states and 17188 transitions. [2025-01-08 23:43:05,462 INFO L78 Accepts]: Start accepts. Automaton has 15178 states and 17188 transitions. Word has length 491 [2025-01-08 23:43:05,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:05,462 INFO L471 AbstractCegarLoop]: Abstraction has 15178 states and 17188 transitions. [2025-01-08 23:43:05,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 98.25) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:05,463 INFO L276 IsEmpty]: Start isEmpty. Operand 15178 states and 17188 transitions. [2025-01-08 23:43:05,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 534 [2025-01-08 23:43:05,483 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:05,483 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:05,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-08 23:43:05,688 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:43:05,688 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:05,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:05,689 INFO L85 PathProgramCache]: Analyzing trace with hash 360421010, now seen corresponding path program 1 times [2025-01-08 23:43:05,689 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:05,689 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063179547] [2025-01-08 23:43:05,689 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:05,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:05,740 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 533 statements into 1 equivalence classes. [2025-01-08 23:43:05,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 533 of 533 statements. [2025-01-08 23:43:05,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:05,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:06,042 INFO L134 CoverageAnalysis]: Checked inductivity of 810 backedges. 641 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-01-08 23:43:06,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:06,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063179547] [2025-01-08 23:43:06,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063179547] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:06,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:06,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:06,043 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860779674] [2025-01-08 23:43:06,043 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:06,043 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:06,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:06,043 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:06,044 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:06,044 INFO L87 Difference]: Start difference. First operand 15178 states and 17188 transitions. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:06,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:06,644 INFO L93 Difference]: Finished difference Result 32015 states and 36302 transitions. [2025-01-08 23:43:06,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:06,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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 533 [2025-01-08 23:43:06,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:06,659 INFO L225 Difference]: With dead ends: 32015 [2025-01-08 23:43:06,660 INFO L226 Difference]: Without dead ends: 17943 [2025-01-08 23:43:06,668 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:06,669 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 112 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 540 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:06,669 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 74 Invalid, 673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 540 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:06,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17943 states. [2025-01-08 23:43:06,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17943 to 15520. [2025-01-08 23:43:06,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15520 states, 15519 states have (on average 1.1281654745795477) internal successors, (17508), 15519 states have internal predecessors, (17508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:06,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15520 states to 15520 states and 17508 transitions. [2025-01-08 23:43:06,788 INFO L78 Accepts]: Start accepts. Automaton has 15520 states and 17508 transitions. Word has length 533 [2025-01-08 23:43:06,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:06,788 INFO L471 AbstractCegarLoop]: Abstraction has 15520 states and 17508 transitions. [2025-01-08 23:43:06,789 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:06,789 INFO L276 IsEmpty]: Start isEmpty. Operand 15520 states and 17508 transitions. [2025-01-08 23:43:06,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-01-08 23:43:06,831 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:06,831 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:06,831 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:43:06,831 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:06,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:06,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1877882950, now seen corresponding path program 1 times [2025-01-08 23:43:06,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:06,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067887385] [2025-01-08 23:43:06,833 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:06,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:06,864 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-01-08 23:43:06,889 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-01-08 23:43:06,890 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:06,890 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:07,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1091 backedges. 817 proven. 0 refuted. 0 times theorem prover too weak. 274 trivial. 0 not checked. [2025-01-08 23:43:07,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:07,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067887385] [2025-01-08 23:43:07,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067887385] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:07,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:07,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:07,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [977577119] [2025-01-08 23:43:07,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:07,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:07,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:07,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:07,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:07,164 INFO L87 Difference]: Start difference. First operand 15520 states and 17508 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:07,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:07,719 INFO L93 Difference]: Finished difference Result 30496 states and 34412 transitions. [2025-01-08 23:43:07,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:07,720 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 587 [2025-01-08 23:43:07,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:07,734 INFO L225 Difference]: With dead ends: 30496 [2025-01-08 23:43:07,734 INFO L226 Difference]: Without dead ends: 17006 [2025-01-08 23:43:07,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:07,743 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 140 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 571 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 621 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 571 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:07,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 120 Invalid, 621 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 571 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:07,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17006 states. [2025-01-08 23:43:07,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17006 to 15336. [2025-01-08 23:43:07,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15336 states, 15335 states have (on average 1.1285295076622106) internal successors, (17306), 15335 states have internal predecessors, (17306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:07,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15336 states to 15336 states and 17306 transitions. [2025-01-08 23:43:07,910 INFO L78 Accepts]: Start accepts. Automaton has 15336 states and 17306 transitions. Word has length 587 [2025-01-08 23:43:07,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:07,910 INFO L471 AbstractCegarLoop]: Abstraction has 15336 states and 17306 transitions. [2025-01-08 23:43:07,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:07,911 INFO L276 IsEmpty]: Start isEmpty. Operand 15336 states and 17306 transitions. [2025-01-08 23:43:07,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2025-01-08 23:43:07,922 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:07,922 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:07,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:43:07,923 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:07,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:07,923 INFO L85 PathProgramCache]: Analyzing trace with hash -1094889745, now seen corresponding path program 1 times [2025-01-08 23:43:07,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:07,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383690981] [2025-01-08 23:43:07,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:07,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:07,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 600 statements into 1 equivalence classes. [2025-01-08 23:43:07,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 600 of 600 statements. [2025-01-08 23:43:07,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:07,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:08,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1111 backedges. 839 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:43:08,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:08,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383690981] [2025-01-08 23:43:08,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383690981] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:08,147 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:08,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:08,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301994702] [2025-01-08 23:43:08,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:08,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:08,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:08,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:08,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:08,148 INFO L87 Difference]: Start difference. First operand 15336 states and 17306 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:08,601 INFO L93 Difference]: Finished difference Result 31222 states and 35312 transitions. [2025-01-08 23:43:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:08,601 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 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 600 [2025-01-08 23:43:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:08,615 INFO L225 Difference]: With dead ends: 31222 [2025-01-08 23:43:08,615 INFO L226 Difference]: Without dead ends: 16992 [2025-01-08 23:43:08,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:08,629 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 108 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 375 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:08,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 375 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:43:08,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16992 states. [2025-01-08 23:43:08,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16992 to 16072. [2025-01-08 23:43:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16072 states, 16071 states have (on average 1.125630016800448) internal successors, (18090), 16071 states have internal predecessors, (18090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:08,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16072 states to 16072 states and 18090 transitions. [2025-01-08 23:43:08,786 INFO L78 Accepts]: Start accepts. Automaton has 16072 states and 18090 transitions. Word has length 600 [2025-01-08 23:43:08,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:08,786 INFO L471 AbstractCegarLoop]: Abstraction has 16072 states and 18090 transitions. [2025-01-08 23:43:08,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 3 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:08,786 INFO L276 IsEmpty]: Start isEmpty. Operand 16072 states and 18090 transitions. [2025-01-08 23:43:08,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 606 [2025-01-08 23:43:08,798 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:08,798 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:08,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:43:08,799 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:08,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash -348485998, now seen corresponding path program 1 times [2025-01-08 23:43:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:08,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824746508] [2025-01-08 23:43:08,799 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:08,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:08,890 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 605 statements into 1 equivalence classes. [2025-01-08 23:43:08,916 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 605 of 605 statements. [2025-01-08 23:43:08,916 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:08,916 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 1120 backedges. 720 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2025-01-08 23:43:09,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824746508] [2025-01-08 23:43:09,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824746508] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:09,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:09,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:43:09,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42996314] [2025-01-08 23:43:09,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:09,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:09,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:09,490 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:09,490 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:09,491 INFO L87 Difference]: Start difference. First operand 16072 states and 18090 transitions. Second operand has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:10,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:10,578 INFO L93 Difference]: Finished difference Result 36938 states and 41767 transitions. [2025-01-08 23:43:10,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:10,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 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 605 [2025-01-08 23:43:10,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:10,599 INFO L225 Difference]: With dead ends: 36938 [2025-01-08 23:43:10,600 INFO L226 Difference]: Without dead ends: 21236 [2025-01-08 23:43:10,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:10,621 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 280 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 1060 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:10,621 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 83 Invalid, 1325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1060 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:43:10,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21236 states. [2025-01-08 23:43:10,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21236 to 18468. [2025-01-08 23:43:10,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18468 states, 18467 states have (on average 1.1256295012725401) internal successors, (20787), 18467 states have internal predecessors, (20787), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:10,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18468 states to 18468 states and 20787 transitions. [2025-01-08 23:43:10,814 INFO L78 Accepts]: Start accepts. Automaton has 18468 states and 20787 transitions. Word has length 605 [2025-01-08 23:43:10,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:10,814 INFO L471 AbstractCegarLoop]: Abstraction has 18468 states and 20787 transitions. [2025-01-08 23:43:10,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.25) internal successors, (289), 4 states have internal predecessors, (289), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:10,815 INFO L276 IsEmpty]: Start isEmpty. Operand 18468 states and 20787 transitions. [2025-01-08 23:43:10,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2025-01-08 23:43:10,827 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:10,827 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:10,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:43:10,828 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:10,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:10,828 INFO L85 PathProgramCache]: Analyzing trace with hash -1092049000, now seen corresponding path program 1 times [2025-01-08 23:43:10,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:10,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694036807] [2025-01-08 23:43:10,828 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:10,828 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:10,862 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-08 23:43:10,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-08 23:43:10,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:10,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:11,324 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 979 proven. 64 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-01-08 23:43:11,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:11,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694036807] [2025-01-08 23:43:11,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694036807] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:43:11,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [853338418] [2025-01-08 23:43:11,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:11,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:43:11,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:43:11,327 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:43:11,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-08 23:43:11,393 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 667 statements into 1 equivalence classes. [2025-01-08 23:43:11,482 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 667 of 667 statements. [2025-01-08 23:43:11,483 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:11,483 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:11,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 853 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:43:11,489 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:43:11,592 INFO L134 CoverageAnalysis]: Checked inductivity of 1336 backedges. 1043 proven. 0 refuted. 0 times theorem prover too weak. 293 trivial. 0 not checked. [2025-01-08 23:43:11,592 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:43:11,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [853338418] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:11,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:43:11,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:43:11,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853371133] [2025-01-08 23:43:11,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:11,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:11,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:11,593 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:11,593 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:43:11,593 INFO L87 Difference]: Start difference. First operand 18468 states and 20787 transitions. Second operand has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:12,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:12,138 INFO L93 Difference]: Finished difference Result 37497 states and 42153 transitions. [2025-01-08 23:43:12,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:12,139 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 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 667 [2025-01-08 23:43:12,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:12,157 INFO L225 Difference]: With dead ends: 37497 [2025-01-08 23:43:12,157 INFO L226 Difference]: Without dead ends: 20691 [2025-01-08 23:43:12,168 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 670 GetRequests, 666 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:43:12,169 INFO L435 NwaCegarLoop]: 325 mSDtfsCounter, 80 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 538 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 538 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:12,169 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 345 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 538 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:12,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20691 states. [2025-01-08 23:43:12,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20691 to 17732. [2025-01-08 23:43:12,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17732 states, 17731 states have (on average 1.1210309627206587) internal successors, (19877), 17731 states have internal predecessors, (19877), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:12,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17732 states to 17732 states and 19877 transitions. [2025-01-08 23:43:12,325 INFO L78 Accepts]: Start accepts. Automaton has 17732 states and 19877 transitions. Word has length 667 [2025-01-08 23:43:12,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:12,326 INFO L471 AbstractCegarLoop]: Abstraction has 17732 states and 19877 transitions. [2025-01-08 23:43:12,326 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:12,326 INFO L276 IsEmpty]: Start isEmpty. Operand 17732 states and 19877 transitions. [2025-01-08 23:43:12,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 722 [2025-01-08 23:43:12,339 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:12,340 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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] [2025-01-08 23:43:12,350 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-08 23:43:12,541 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:43:12,542 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:12,542 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:12,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1368420590, now seen corresponding path program 1 times [2025-01-08 23:43:12,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:12,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53419551] [2025-01-08 23:43:12,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:12,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:12,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 721 statements into 1 equivalence classes. [2025-01-08 23:43:12,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 721 of 721 statements. [2025-01-08 23:43:12,628 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:12,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:12,929 INFO L134 CoverageAnalysis]: Checked inductivity of 1368 backedges. 1057 proven. 0 refuted. 0 times theorem prover too weak. 311 trivial. 0 not checked. [2025-01-08 23:43:12,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:12,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53419551] [2025-01-08 23:43:12,929 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53419551] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:12,929 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:12,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:12,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870076010] [2025-01-08 23:43:12,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:12,930 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:12,930 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:12,931 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:12,931 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:12,931 INFO L87 Difference]: Start difference. First operand 17732 states and 19877 transitions. Second operand has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:13,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:13,531 INFO L93 Difference]: Finished difference Result 37489 states and 42105 transitions. [2025-01-08 23:43:13,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:13,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 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 721 [2025-01-08 23:43:13,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:13,551 INFO L225 Difference]: With dead ends: 37489 [2025-01-08 23:43:13,551 INFO L226 Difference]: Without dead ends: 20495 [2025-01-08 23:43:13,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:13,563 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 112 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 530 mSolverCounterSat, 131 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 131 IncrementalHoareTripleChecker+Valid, 530 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:13,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 66 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [131 Valid, 530 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:13,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20495 states. [2025-01-08 23:43:13,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20495 to 17916. [2025-01-08 23:43:13,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17916 states, 17915 states have (on average 1.1211833658945018) internal successors, (20086), 17915 states have internal predecessors, (20086), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:13,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17916 states to 17916 states and 20086 transitions. [2025-01-08 23:43:13,712 INFO L78 Accepts]: Start accepts. Automaton has 17916 states and 20086 transitions. Word has length 721 [2025-01-08 23:43:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:13,713 INFO L471 AbstractCegarLoop]: Abstraction has 17916 states and 20086 transitions. [2025-01-08 23:43:13,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 144.0) internal successors, (432), 3 states have internal predecessors, (432), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:13,713 INFO L276 IsEmpty]: Start isEmpty. Operand 17916 states and 20086 transitions. [2025-01-08 23:43:13,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 813 [2025-01-08 23:43:13,726 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:13,726 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:13,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 23:43:13,727 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:13,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:13,727 INFO L85 PathProgramCache]: Analyzing trace with hash -808465802, now seen corresponding path program 1 times [2025-01-08 23:43:13,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:13,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2003740108] [2025-01-08 23:43:13,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:13,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:13,772 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 812 statements into 1 equivalence classes. [2025-01-08 23:43:13,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 812 of 812 statements. [2025-01-08 23:43:13,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:13,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:13,961 INFO L134 CoverageAnalysis]: Checked inductivity of 1936 backedges. 1061 proven. 0 refuted. 0 times theorem prover too weak. 875 trivial. 0 not checked. [2025-01-08 23:43:13,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:13,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2003740108] [2025-01-08 23:43:13,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2003740108] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:13,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:13,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:43:13,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081300246] [2025-01-08 23:43:13,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:13,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:13,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:13,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:13,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:13,963 INFO L87 Difference]: Start difference. First operand 17916 states and 20086 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:14,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:14,329 INFO L93 Difference]: Finished difference Result 33801 states and 37949 transitions. [2025-01-08 23:43:14,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:14,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 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 812 [2025-01-08 23:43:14,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:14,344 INFO L225 Difference]: With dead ends: 33801 [2025-01-08 23:43:14,344 INFO L226 Difference]: Without dead ends: 17727 [2025-01-08 23:43:14,348 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:14,349 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 176 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 301 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:14,349 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 42 Invalid, 301 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:43:14,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17727 states. [2025-01-08 23:43:14,445 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17727 to 17724. [2025-01-08 23:43:14,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17724 states, 17723 states have (on average 1.1208598995655363) internal successors, (19865), 17723 states have internal predecessors, (19865), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:14,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17724 states to 17724 states and 19865 transitions. [2025-01-08 23:43:14,472 INFO L78 Accepts]: Start accepts. Automaton has 17724 states and 19865 transitions. Word has length 812 [2025-01-08 23:43:14,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:14,472 INFO L471 AbstractCegarLoop]: Abstraction has 17724 states and 19865 transitions. [2025-01-08 23:43:14,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:14,472 INFO L276 IsEmpty]: Start isEmpty. Operand 17724 states and 19865 transitions. [2025-01-08 23:43:14,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 956 [2025-01-08 23:43:14,487 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:14,487 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:14,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 23:43:14,487 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:14,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:14,488 INFO L85 PathProgramCache]: Analyzing trace with hash 52817555, now seen corresponding path program 1 times [2025-01-08 23:43:14,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:14,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135744646] [2025-01-08 23:43:14,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:14,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:14,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 955 statements into 1 equivalence classes. [2025-01-08 23:43:14,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 955 of 955 statements. [2025-01-08 23:43:14,566 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:14,566 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:15,240 INFO L134 CoverageAnalysis]: Checked inductivity of 3075 backedges. 2234 proven. 0 refuted. 0 times theorem prover too weak. 841 trivial. 0 not checked. [2025-01-08 23:43:15,241 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:15,241 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135744646] [2025-01-08 23:43:15,241 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135744646] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:15,241 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:15,241 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:43:15,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447555898] [2025-01-08 23:43:15,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:15,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:15,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:15,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:15,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:15,243 INFO L87 Difference]: Start difference. First operand 17724 states and 19865 transitions. Second operand has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:16,262 INFO L93 Difference]: Finished difference Result 40434 states and 45301 transitions. [2025-01-08 23:43:16,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:16,268 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 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 955 [2025-01-08 23:43:16,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:16,289 INFO L225 Difference]: With dead ends: 40434 [2025-01-08 23:43:16,289 INFO L226 Difference]: Without dead ends: 24922 [2025-01-08 23:43:16,301 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:16,302 INFO L435 NwaCegarLoop]: 52 mSDtfsCounter, 231 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1074 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 1252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 1074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:16,302 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 87 Invalid, 1252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 1074 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:43:16,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24922 states. [2025-01-08 23:43:16,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24922 to 19025. [2025-01-08 23:43:16,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19025 states, 19024 states have (on average 1.1149074852817493) internal successors, (21210), 19024 states have internal predecessors, (21210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:16,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19025 states to 19025 states and 21210 transitions. [2025-01-08 23:43:16,462 INFO L78 Accepts]: Start accepts. Automaton has 19025 states and 21210 transitions. Word has length 955 [2025-01-08 23:43:16,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:16,463 INFO L471 AbstractCegarLoop]: Abstraction has 19025 states and 21210 transitions. [2025-01-08 23:43:16,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.75) internal successors, (487), 4 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:16,463 INFO L276 IsEmpty]: Start isEmpty. Operand 19025 states and 21210 transitions. [2025-01-08 23:43:16,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 993 [2025-01-08 23:43:16,478 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:16,478 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-01-08 23:43:16,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-01-08 23:43:16,479 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:16,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:16,479 INFO L85 PathProgramCache]: Analyzing trace with hash 1049751319, now seen corresponding path program 1 times [2025-01-08 23:43:16,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:16,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469540027] [2025-01-08 23:43:16,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:16,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:16,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 992 statements into 1 equivalence classes. [2025-01-08 23:43:16,561 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 992 of 992 statements. [2025-01-08 23:43:16,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:16,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3120 backedges. 1460 proven. 0 refuted. 0 times theorem prover too weak. 1660 trivial. 0 not checked. [2025-01-08 23:43:17,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:17,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469540027] [2025-01-08 23:43:17,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469540027] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:17,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:17,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:43:17,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689039747] [2025-01-08 23:43:17,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:17,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:43:17,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:17,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:43:17,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:43:17,770 INFO L87 Difference]: Start difference. First operand 19025 states and 21210 transitions. Second operand has 7 states, 7 states have (on average 59.57142857142857) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:18,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:18,925 INFO L93 Difference]: Finished difference Result 39528 states and 44090 transitions. [2025-01-08 23:43:18,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 23:43:18,926 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 59.57142857142857) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 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 992 [2025-01-08 23:43:18,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:18,941 INFO L225 Difference]: With dead ends: 39528 [2025-01-08 23:43:18,941 INFO L226 Difference]: Without dead ends: 21057 [2025-01-08 23:43:18,952 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:43:18,952 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 237 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 1942 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 1971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:18,952 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 212 Invalid, 1971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1942 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-08 23:43:18,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21057 states. [2025-01-08 23:43:19,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21057 to 19209. [2025-01-08 23:43:19,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19209 states, 19208 states have (on average 1.114119117034569) internal successors, (21400), 19208 states have internal predecessors, (21400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:19,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19209 states to 19209 states and 21400 transitions. [2025-01-08 23:43:19,089 INFO L78 Accepts]: Start accepts. Automaton has 19209 states and 21400 transitions. Word has length 992 [2025-01-08 23:43:19,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:19,089 INFO L471 AbstractCegarLoop]: Abstraction has 19209 states and 21400 transitions. [2025-01-08 23:43:19,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.57142857142857) internal successors, (417), 6 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:19,089 INFO L276 IsEmpty]: Start isEmpty. Operand 19209 states and 21400 transitions. [2025-01-08 23:43:19,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1003 [2025-01-08 23:43:19,103 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:19,104 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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-01-08 23:43:19,104 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 23:43:19,105 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:19,105 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:19,106 INFO L85 PathProgramCache]: Analyzing trace with hash -534774082, now seen corresponding path program 1 times [2025-01-08 23:43:19,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:19,106 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001039516] [2025-01-08 23:43:19,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:19,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:19,154 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1002 statements into 1 equivalence classes. [2025-01-08 23:43:19,194 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1002 of 1002 statements. [2025-01-08 23:43:19,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:19,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:20,374 INFO L134 CoverageAnalysis]: Checked inductivity of 3167 backedges. 1499 proven. 8 refuted. 0 times theorem prover too weak. 1660 trivial. 0 not checked. [2025-01-08 23:43:20,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001039516] [2025-01-08 23:43:20,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001039516] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:43:20,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1354831921] [2025-01-08 23:43:20,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:20,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:43:20,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:43:20,376 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:43:20,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 23:43:20,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1002 statements into 1 equivalence classes. [2025-01-08 23:43:20,675 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1002 of 1002 statements. [2025-01-08 23:43:20,675 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:20,675 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:20,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 1263 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 23:43:20,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:43:21,653 INFO L134 CoverageAnalysis]: Checked inductivity of 3167 backedges. 1386 proven. 121 refuted. 0 times theorem prover too weak. 1660 trivial. 0 not checked. [2025-01-08 23:43:21,653 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:43:24,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3167 backedges. 1386 proven. 121 refuted. 0 times theorem prover too weak. 1660 trivial. 0 not checked. [2025-01-08 23:43:24,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1354831921] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:43:24,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:43:24,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-01-08 23:43:24,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385691972] [2025-01-08 23:43:24,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:43:24,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 23:43:24,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:24,124 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 23:43:24,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-08 23:43:24,124 INFO L87 Difference]: Start difference. First operand 19209 states and 21400 transitions. Second operand has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 10 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:27,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:27,553 INFO L93 Difference]: Finished difference Result 41924 states and 46704 transitions. [2025-01-08 23:43:27,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-08 23:43:27,553 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 10 states have internal predecessors, (995), 0 states have call successors, (0), 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 1002 [2025-01-08 23:43:27,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:27,574 INFO L225 Difference]: With dead ends: 41924 [2025-01-08 23:43:27,575 INFO L226 Difference]: Without dead ends: 21794 [2025-01-08 23:43:27,588 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2026 GetRequests, 2001 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 151 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2025-01-08 23:43:27,589 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 1301 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 4930 mSolverCounterSat, 469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1301 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 5399 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 469 IncrementalHoareTripleChecker+Valid, 4930 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:27,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1301 Valid, 228 Invalid, 5399 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [469 Valid, 4930 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2025-01-08 23:43:27,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21794 states. [2025-01-08 23:43:27,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21794 to 15525. [2025-01-08 23:43:27,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15525 states, 15524 states have (on average 1.076526668384437) internal successors, (16712), 15524 states have internal predecessors, (16712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:27,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15525 states to 15525 states and 16712 transitions. [2025-01-08 23:43:27,762 INFO L78 Accepts]: Start accepts. Automaton has 15525 states and 16712 transitions. Word has length 1002 [2025-01-08 23:43:27,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:27,762 INFO L471 AbstractCegarLoop]: Abstraction has 15525 states and 16712 transitions. [2025-01-08 23:43:27,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 90.45454545454545) internal successors, (995), 10 states have internal predecessors, (995), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:27,763 INFO L276 IsEmpty]: Start isEmpty. Operand 15525 states and 16712 transitions. [2025-01-08 23:43:27,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1097 [2025-01-08 23:43:27,777 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:27,777 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:27,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 23:43:27,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-01-08 23:43:27,978 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:27,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:27,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1697022257, now seen corresponding path program 1 times [2025-01-08 23:43:27,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:27,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1432963400] [2025-01-08 23:43:27,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:27,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:28,034 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1096 statements into 1 equivalence classes. [2025-01-08 23:43:28,054 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1096 of 1096 statements. [2025-01-08 23:43:28,054 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:28,054 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:28,267 INFO L134 CoverageAnalysis]: Checked inductivity of 4071 backedges. 2485 proven. 0 refuted. 0 times theorem prover too weak. 1586 trivial. 0 not checked. [2025-01-08 23:43:28,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:28,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1432963400] [2025-01-08 23:43:28,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1432963400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:28,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:28,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:43:28,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375161858] [2025-01-08 23:43:28,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:28,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:43:28,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:28,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:43:28,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:28,269 INFO L87 Difference]: Start difference. First operand 15525 states and 16712 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:28,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:28,778 INFO L93 Difference]: Finished difference Result 32152 states and 34598 transitions. [2025-01-08 23:43:28,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:43:28,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 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 1096 [2025-01-08 23:43:28,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:28,789 INFO L225 Difference]: With dead ends: 32152 [2025-01-08 23:43:28,789 INFO L226 Difference]: Without dead ends: 16813 [2025-01-08 23:43:28,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:43:28,796 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 131 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:28,797 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 95 Invalid, 577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16813 states. [2025-01-08 23:43:28,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16813 to 14964. [2025-01-08 23:43:28,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14964 states, 14963 states have (on average 1.0765220878166144) internal successors, (16108), 14963 states have internal predecessors, (16108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14964 states to 14964 states and 16108 transitions. [2025-01-08 23:43:28,910 INFO L78 Accepts]: Start accepts. Automaton has 14964 states and 16108 transitions. Word has length 1096 [2025-01-08 23:43:28,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:28,910 INFO L471 AbstractCegarLoop]: Abstraction has 14964 states and 16108 transitions. [2025-01-08 23:43:28,911 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:28,911 INFO L276 IsEmpty]: Start isEmpty. Operand 14964 states and 16108 transitions. [2025-01-08 23:43:28,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1117 [2025-01-08 23:43:28,923 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:43:28,924 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 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] [2025-01-08 23:43:28,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2025-01-08 23:43:28,924 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:43:28,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:43:28,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1997587198, now seen corresponding path program 1 times [2025-01-08 23:43:28,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:43:28,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225795954] [2025-01-08 23:43:28,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:43:28,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:43:28,978 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1116 statements into 1 equivalence classes. [2025-01-08 23:43:29,023 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1116 of 1116 statements. [2025-01-08 23:43:29,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:43:29,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:43:29,677 INFO L134 CoverageAnalysis]: Checked inductivity of 4017 backedges. 2945 proven. 0 refuted. 0 times theorem prover too weak. 1072 trivial. 0 not checked. [2025-01-08 23:43:29,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:43:29,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225795954] [2025-01-08 23:43:29,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225795954] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:43:29,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:43:29,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:43:29,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921697616] [2025-01-08 23:43:29,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:43:29,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:43:29,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:43:29,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:43:29,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:29,679 INFO L87 Difference]: Start difference. First operand 14964 states and 16108 transitions. Second operand has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:43:30,258 INFO L93 Difference]: Finished difference Result 28449 states and 30497 transitions. [2025-01-08 23:43:30,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:43:30,259 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 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 1116 [2025-01-08 23:43:30,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:43:30,260 INFO L225 Difference]: With dead ends: 28449 [2025-01-08 23:43:30,260 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:43:30,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:43:30,267 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 217 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 983 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:43:30,267 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 41 Invalid, 983 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:43:30,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:43:30,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:43:30,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:30,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:43:30,268 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1116 [2025-01-08 23:43:30,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:43:30,268 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:43:30,269 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 131.0) internal successors, (524), 4 states have internal predecessors, (524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:43:30,269 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:43:30,269 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:43:30,271 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:43:30,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-08 23:43:30,273 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:43:30,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:43:50,644 WARN L286 SmtUtils]: Spent 20.37s on a formula simplification. DAG size of input: 630 DAG size of output: 832 (called from [L 212] de.uni_freiburg.informatik.ultimate.lib.proofs.floydhoare.HoareAnnotationComposer.or) [2025-01-08 23:43:53,195 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:43:53,210 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:43:53 BoogieIcfgContainer [2025-01-08 23:43:53,210 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:43:53,212 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:43:53,213 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:43:53,213 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:43:53,214 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:42:48" (3/4) ... [2025-01-08 23:43:53,215 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:43:53,234 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:43:53,235 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:43:53,236 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:43:53,240 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:43:53,366 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:43:53,366 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:43:53,366 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:43:53,367 INFO L158 Benchmark]: Toolchain (without parser) took 67181.38ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 130.6MB in the beginning and 949.6MB in the end (delta: -819.0MB). Peak memory consumption was 369.7MB. Max. memory is 16.1GB. [2025-01-08 23:43:53,367 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 226.5MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:43:53,367 INFO L158 Benchmark]: CACSL2BoogieTranslator took 437.55ms. Allocated memory is still 167.8MB. Free memory was 130.6MB in the beginning and 88.0MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2025-01-08 23:43:53,368 INFO L158 Benchmark]: Boogie Procedure Inliner took 111.67ms. Allocated memory is still 167.8MB. Free memory was 88.0MB in the beginning and 71.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:43:53,368 INFO L158 Benchmark]: Boogie Preprocessor took 153.19ms. Allocated memory is still 167.8MB. Free memory was 71.2MB in the beginning and 46.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-01-08 23:43:53,368 INFO L158 Benchmark]: RCFGBuilder took 1513.21ms. Allocated memory is still 167.8MB. Free memory was 46.4MB in the beginning and 103.3MB in the end (delta: -56.9MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2025-01-08 23:43:53,369 INFO L158 Benchmark]: TraceAbstraction took 64804.90ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 103.3MB in the beginning and 966.3MB in the end (delta: -863.1MB). Peak memory consumption was 868.1MB. Max. memory is 16.1GB. [2025-01-08 23:43:53,369 INFO L158 Benchmark]: Witness Printer took 153.62ms. Allocated memory is still 1.4GB. Free memory was 966.3MB in the beginning and 949.6MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:43:53,372 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.18ms. Allocated memory is still 226.5MB. Free memory is still 140.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 437.55ms. Allocated memory is still 167.8MB. Free memory was 130.6MB in the beginning and 88.0MB in the end (delta: 42.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 111.67ms. Allocated memory is still 167.8MB. Free memory was 88.0MB in the beginning and 71.2MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 153.19ms. Allocated memory is still 167.8MB. Free memory was 71.2MB in the beginning and 46.4MB in the end (delta: 24.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1513.21ms. Allocated memory is still 167.8MB. Free memory was 46.4MB in the beginning and 103.3MB in the end (delta: -56.9MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 64804.90ms. Allocated memory was 167.8MB in the beginning and 1.4GB in the end (delta: 1.2GB). Free memory was 103.3MB in the beginning and 966.3MB in the end (delta: -863.1MB). Peak memory consumption was 868.1MB. Max. memory is 16.1GB. * Witness Printer took 153.62ms. Allocated memory is still 1.4GB. Free memory was 966.3MB in the beginning and 949.6MB in the end (delta: 16.8MB). 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: 79]: 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, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 41.8s, OverallIterations: 26, TraceHistogramMax: 10, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 21.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5431 SdHoareTripleChecker+Valid, 18.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5431 mSDsluCounter, 4855 SdHoareTripleChecker+Invalid, 15.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 801 mSDsCounter, 3018 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 22251 IncrementalHoareTripleChecker+Invalid, 25269 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3018 mSolverCounterUnsat, 4054 mSDtfsCounter, 22251 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3747 GetRequests, 3675 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19209occurred in iteration=23, InterpolantAutomatonStates: 105, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 36997 StatesRemovedByMinimization, 23 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 13.8s InterpolantComputationTime, 16199 NumberOfCodeBlocks, 16199 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 17170 ConstructedInterpolants, 0 QuantifiedInterpolants, 53276 SizeOfPredicates, 1 NumberOfNonLiveVariables, 3415 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 31 InterpolantComputations, 25 PerfectInterpolantSequences, 38213/38957 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: 1044]: Loop Invariant Derived loop invariant: (((((((((((((((((((a25 == 13) && (a23 <= 599997)) && (a3 == 1)) && (a4 == 1)) && (0 <= ((long long) a23 + 42))) || ((((((a25 == 13) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a29 <= 274)) && (141 <= a29)) && (a3 == 1))) || (((((0 <= ((long long) a29 + 580294)) && (a4 == 1)) && (a23 <= 312)) && (a25 <= 9)) && (a29 <= 130))) || ((((((a25 == 13) && (a29 <= 245)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((a29 <= 275) && (a25 <= 10)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1))) || ((((a23 <= 599997) && (a3 == 1)) && (a4 == 1)) && (a25 == 10))) || (((a23 <= 138) && (a4 == 1)) && (a29 <= 130))) || (((((a25 == 13) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a29 <= 232))) || (((((((long long) a23 + 55) <= 0) && (0 <= ((long long) a29 + 580294))) && (a4 == 0)) && (a3 == 1)) && (a29 <= 220))) || (((((a25 <= 10) && (a3 == 1)) && (a23 <= 138)) && (a4 == 1)) && (a25 != 9))) || (((((((long long) a23 + 43) <= 0) && (0 <= ((long long) a29 + 580294))) && (a4 == 0)) && (a3 == 1)) && (a25 <= 9))) || ((((((a23 <= 600000) && (((a23 < 307) || (a25 != 12)) || (a29 < 278))) && (((a25 != 13) || (a23 < 307)) || (a29 < 278))) && (141 <= a29)) && (a3 == 1)) && (a4 == 1))) || (((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (141 <= a29)) && (a3 == 1))) || (((((a3 == 1) && (a4 == 1)) && (a23 <= 312)) && (a25 <= 9)) && (0 <= ((long long) a23 + 42)))) || ((((((a25 == 12) && (a3 == 1)) && (a29 < 278)) && (a4 == 1)) && (a23 <= 312)) && (0 <= ((long long) a23 + 42)))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:43:53,398 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