./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label17.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 e8f177d03f4f60423a896dbe491efae793eb2062a8d25f45f05aed5ed36051f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 11:42:55,885 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 11:42:55,942 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 11:42:55,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 11:42:55,952 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 11:42:55,971 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 11:42:55,973 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 11:42:55,973 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 11:42:55,973 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 11:42:55,973 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 11:42:55,974 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 11:42:55,974 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 11:42:55,974 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 11:42:55,974 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 11:42:55,975 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 11:42:55,975 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 11:42:55,975 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 11:42:55,975 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 11:42:55,975 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 11:42:55,975 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 11:42:55,975 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 11:42:55,976 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 11:42:55,976 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 11:42:55,976 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 11:42:55,976 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 11:42:55,976 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 11:42:55,976 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 11:42:55,976 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 11:42:55,976 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 11:42:55,976 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 11:42:55,976 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 11:42:55,976 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 11:42:55,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:42:55,977 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 11:42:55,977 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 11:42:55,977 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 11:42:55,977 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 11:42:55,977 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 11:42:55,977 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 11:42:55,977 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 11:42:55,978 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 11:42:55,978 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 11:42:55,978 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 11:42:55,978 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 -> e8f177d03f4f60423a896dbe491efae793eb2062a8d25f45f05aed5ed36051f8 [2025-02-05 11:42:56,218 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 11:42:56,226 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 11:42:56,228 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 11:42:56,229 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 11:42:56,229 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 11:42:56,230 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label17.c [2025-02-05 11:42:57,444 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73e84a3a3/0181ec7d76574087a067856e75ff1977/FLAGf4f96b89a [2025-02-05 11:42:57,937 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 11:42:57,939 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label17.c [2025-02-05 11:42:57,971 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73e84a3a3/0181ec7d76574087a067856e75ff1977/FLAGf4f96b89a [2025-02-05 11:42:58,005 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/73e84a3a3/0181ec7d76574087a067856e75ff1977 [2025-02-05 11:42:58,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 11:42:58,008 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 11:42:58,010 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 11:42:58,011 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 11:42:58,014 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 11:42:58,014 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:42:58" (1/1) ... [2025-02-05 11:42:58,015 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30eddcbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:58, skipping insertion in model container [2025-02-05 11:42:58,015 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 11:42:58" (1/1) ... [2025-02-05 11:42:58,104 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 11:42:58,334 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/Problem13_label17.c[4917,4930] [2025-02-05 11:42:59,049 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:42:59,055 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 11:42:59,070 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/Problem13_label17.c[4917,4930] [2025-02-05 11:42:59,419 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 11:42:59,436 INFO L204 MainTranslator]: Completed translation [2025-02-05 11:42:59,437 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59 WrapperNode [2025-02-05 11:42:59,438 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 11:42:59,439 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 11:42:59,439 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 11:42:59,439 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 11:42:59,443 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (1/1) ... [2025-02-05 11:42:59,486 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (1/1) ... [2025-02-05 11:42:59,944 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-02-05 11:42:59,944 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 11:42:59,945 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 11:42:59,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 11:42:59,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 11:42:59,952 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (1/1) ... [2025-02-05 11:42:59,952 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (1/1) ... [2025-02-05 11:43:00,020 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (1/1) ... [2025-02-05 11:43:00,238 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-05 11:43:00,239 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (1/1) ... [2025-02-05 11:43:00,239 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (1/1) ... [2025-02-05 11:43:00,363 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (1/1) ... [2025-02-05 11:43:00,386 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (1/1) ... [2025-02-05 11:43:00,404 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (1/1) ... [2025-02-05 11:43:00,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (1/1) ... [2025-02-05 11:43:00,462 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 11:43:00,463 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 11:43:00,463 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 11:43:00,464 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 11:43:00,465 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (1/1) ... [2025-02-05 11:43:00,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 11:43:00,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:43:00,490 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 11:43:00,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 11:43:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 11:43:00,513 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 11:43:00,514 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 11:43:00,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 11:43:00,561 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 11:43:00,563 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 11:43:04,726 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L1894: havoc calculate_output_#t~ret9#1; [2025-02-05 11:43:04,727 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L3629: havoc calculate_output2_#t~ret10#1; [2025-02-05 11:43:04,727 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L5351: havoc calculate_output3_#t~ret11#1; [2025-02-05 11:43:04,929 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-02-05 11:43:04,930 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 11:43:04,962 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 11:43:04,966 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 11:43:04,967 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:43:04 BoogieIcfgContainer [2025-02-05 11:43:04,967 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 11:43:04,968 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 11:43:04,968 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 11:43:04,975 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 11:43:04,975 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 11:42:58" (1/3) ... [2025-02-05 11:43:04,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd5186c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:43:04, skipping insertion in model container [2025-02-05 11:43:04,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 11:42:59" (2/3) ... [2025-02-05 11:43:04,979 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dd5186c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 11:43:04, skipping insertion in model container [2025-02-05 11:43:04,979 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 11:43:04" (3/3) ... [2025-02-05 11:43:04,980 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label17.c [2025-02-05 11:43:05,001 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 11:43:05,002 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label17.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 11:43:05,068 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 11:43:05,075 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;@776607d6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 11:43:05,076 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 11:43:05,082 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:05,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 11:43:05,087 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:05,087 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:05,088 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:05,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:05,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1667374622, now seen corresponding path program 1 times [2025-02-05 11:43:05,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:05,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [24015464] [2025-02-05 11:43:05,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:05,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:05,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 11:43:05,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 11:43:05,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:05,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:05,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:05,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:05,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [24015464] [2025-02-05 11:43:05,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [24015464] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:05,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:05,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854352437] [2025-02-05 11:43:05,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:05,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:43:05,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:05,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:43:05,495 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:43:05,500 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:10,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:10,896 INFO L93 Difference]: Finished difference Result 3829 states and 7202 transitions. [2025-02-05 11:43:10,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:43:10,898 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2025-02-05 11:43:10,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:10,915 INFO L225 Difference]: With dead ends: 3829 [2025-02-05 11:43:10,916 INFO L226 Difference]: Without dead ends: 2664 [2025-02-05 11:43:10,921 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 11:43:10,922 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 2727 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 4246 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2727 SdHoareTripleChecker+Valid, 1051 SdHoareTripleChecker+Invalid, 5853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 4246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:10,923 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2727 Valid, 1051 Invalid, 5853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 4246 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2025-02-05 11:43:10,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-02-05 11:43:11,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2663. [2025-02-05 11:43:11,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.460931630353118) internal successors, (3889), 2662 states have internal predecessors, (3889), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:11,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3889 transitions. [2025-02-05 11:43:11,036 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3889 transitions. Word has length 33 [2025-02-05 11:43:11,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:11,036 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3889 transitions. [2025-02-05 11:43:11,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 3 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:11,037 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3889 transitions. [2025-02-05 11:43:11,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2025-02-05 11:43:11,040 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:11,040 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:43:11,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 11:43:11,040 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:11,042 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:11,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1243732753, now seen corresponding path program 1 times [2025-02-05 11:43:11,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:11,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [188719706] [2025-02-05 11:43:11,043 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:11,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:11,070 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 11:43:11,096 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 11:43:11,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:11,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:12,019 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 11:43:12,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:12,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [188719706] [2025-02-05 11:43:12,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [188719706] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:43:12,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1018452490] [2025-02-05 11:43:12,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:12,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:43:12,021 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:43:12,024 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 11:43:12,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 11:43:12,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 158 statements into 1 equivalence classes. [2025-02-05 11:43:12,126 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 158 of 158 statements. [2025-02-05 11:43:12,127 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:12,127 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:12,129 INFO L256 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:43:12,137 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:43:12,315 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-02-05 11:43:12,316 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:43:12,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1018452490] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:12,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:43:12,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2025-02-05 11:43:12,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [341430919] [2025-02-05 11:43:12,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:12,319 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:12,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:12,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:12,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:43:12,319 INFO L87 Difference]: Start difference. First operand 2663 states and 3889 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:15,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:15,304 INFO L93 Difference]: Finished difference Result 6142 states and 9712 transitions. [2025-02-05 11:43:15,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:15,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 158 [2025-02-05 11:43:15,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:15,322 INFO L225 Difference]: With dead ends: 6142 [2025-02-05 11:43:15,322 INFO L226 Difference]: Without dead ends: 4268 [2025-02-05 11:43:15,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 157 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:43:15,325 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 743 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 2508 mSolverCounterSat, 778 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1187 SdHoareTripleChecker+Invalid, 3286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 778 IncrementalHoareTripleChecker+Valid, 2508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:15,325 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1187 Invalid, 3286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [778 Valid, 2508 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:43:15,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4268 states. [2025-02-05 11:43:15,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4268 to 4254. [2025-02-05 11:43:15,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4254 states, 4253 states have (on average 1.3515165765342112) internal successors, (5748), 4253 states have internal predecessors, (5748), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:15,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4254 states to 4254 states and 5748 transitions. [2025-02-05 11:43:15,380 INFO L78 Accepts]: Start accepts. Automaton has 4254 states and 5748 transitions. Word has length 158 [2025-02-05 11:43:15,381 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:15,381 INFO L471 AbstractCegarLoop]: Abstraction has 4254 states and 5748 transitions. [2025-02-05 11:43:15,381 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:15,381 INFO L276 IsEmpty]: Start isEmpty. Operand 4254 states and 5748 transitions. [2025-02-05 11:43:15,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2025-02-05 11:43:15,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:15,385 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:43:15,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 11:43:15,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:43:15,589 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:15,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:15,590 INFO L85 PathProgramCache]: Analyzing trace with hash 2009645263, now seen corresponding path program 1 times [2025-02-05 11:43:15,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:15,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929833306] [2025-02-05 11:43:15,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:15,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:15,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 200 statements into 1 equivalence classes. [2025-02-05 11:43:15,630 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 200 of 200 statements. [2025-02-05 11:43:15,631 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:15,631 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:15,751 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-02-05 11:43:15,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:15,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929833306] [2025-02-05 11:43:15,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929833306] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:15,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:15,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:43:15,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319441350] [2025-02-05 11:43:15,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:15,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:15,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:15,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:15,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:15,756 INFO L87 Difference]: Start difference. First operand 4254 states and 5748 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:18,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:18,941 INFO L93 Difference]: Finished difference Result 10897 states and 15274 transitions. [2025-02-05 11:43:18,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:18,941 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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 200 [2025-02-05 11:43:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:18,965 INFO L225 Difference]: With dead ends: 10897 [2025-02-05 11:43:18,965 INFO L226 Difference]: Without dead ends: 7432 [2025-02-05 11:43:18,971 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:18,973 INFO L435 NwaCegarLoop]: 824 mSDtfsCounter, 905 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2567 mSolverCounterSat, 755 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 905 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 3322 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 755 IncrementalHoareTripleChecker+Valid, 2567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:18,974 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [905 Valid, 955 Invalid, 3322 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [755 Valid, 2567 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:43:18,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7432 states. [2025-02-05 11:43:19,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7432 to 7426. [2025-02-05 11:43:19,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7426 states, 7425 states have (on average 1.288888888888889) internal successors, (9570), 7425 states have internal predecessors, (9570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:19,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7426 states to 7426 states and 9570 transitions. [2025-02-05 11:43:19,075 INFO L78 Accepts]: Start accepts. Automaton has 7426 states and 9570 transitions. Word has length 200 [2025-02-05 11:43:19,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:19,076 INFO L471 AbstractCegarLoop]: Abstraction has 7426 states and 9570 transitions. [2025-02-05 11:43:19,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:19,076 INFO L276 IsEmpty]: Start isEmpty. Operand 7426 states and 9570 transitions. [2025-02-05 11:43:19,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2025-02-05 11:43:19,080 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:19,080 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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-02-05 11:43:19,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 11:43:19,080 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:19,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:19,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1446249142, now seen corresponding path program 1 times [2025-02-05 11:43:19,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:19,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763655872] [2025-02-05 11:43:19,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:19,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:19,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 214 statements into 1 equivalence classes. [2025-02-05 11:43:19,109 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 214 of 214 statements. [2025-02-05 11:43:19,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:19,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:19,274 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-02-05 11:43:19,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:19,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763655872] [2025-02-05 11:43:19,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763655872] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:19,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:19,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:43:19,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765256930] [2025-02-05 11:43:19,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:19,276 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:19,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:19,276 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:19,276 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:19,276 INFO L87 Difference]: Start difference. First operand 7426 states and 9570 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:22,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:22,566 INFO L93 Difference]: Finished difference Result 19619 states and 25904 transitions. [2025-02-05 11:43:22,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:22,566 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 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-02-05 11:43:22,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:22,607 INFO L225 Difference]: With dead ends: 19619 [2025-02-05 11:43:22,607 INFO L226 Difference]: Without dead ends: 12982 [2025-02-05 11:43:22,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:22,621 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 907 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 2889 mSolverCounterSat, 540 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 907 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 3429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 540 IncrementalHoareTripleChecker+Valid, 2889 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:22,622 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [907 Valid, 639 Invalid, 3429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [540 Valid, 2889 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2025-02-05 11:43:22,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12982 states. [2025-02-05 11:43:22,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12982 to 12975. [2025-02-05 11:43:22,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12975 states, 12974 states have (on average 1.2719284723292739) internal successors, (16502), 12974 states have internal predecessors, (16502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:22,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12975 states to 12975 states and 16502 transitions. [2025-02-05 11:43:22,898 INFO L78 Accepts]: Start accepts. Automaton has 12975 states and 16502 transitions. Word has length 214 [2025-02-05 11:43:22,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:22,898 INFO L471 AbstractCegarLoop]: Abstraction has 12975 states and 16502 transitions. [2025-02-05 11:43:22,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:22,898 INFO L276 IsEmpty]: Start isEmpty. Operand 12975 states and 16502 transitions. [2025-02-05 11:43:22,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2025-02-05 11:43:22,900 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:22,900 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-02-05 11:43:22,900 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 11:43:22,900 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:22,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:22,902 INFO L85 PathProgramCache]: Analyzing trace with hash -2087922791, now seen corresponding path program 1 times [2025-02-05 11:43:22,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:22,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828481622] [2025-02-05 11:43:22,903 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:22,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:22,918 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 230 statements into 1 equivalence classes. [2025-02-05 11:43:22,931 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 230 of 230 statements. [2025-02-05 11:43:22,931 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:22,931 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:23,060 INFO L134 CoverageAnalysis]: Checked inductivity of 132 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2025-02-05 11:43:23,060 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:23,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828481622] [2025-02-05 11:43:23,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828481622] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:23,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:23,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-05 11:43:23,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347458752] [2025-02-05 11:43:23,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:23,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:23,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:23,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:23,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:23,061 INFO L87 Difference]: Start difference. First operand 12975 states and 16502 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:26,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:26,126 INFO L93 Difference]: Finished difference Result 36180 states and 46592 transitions. [2025-02-05 11:43:26,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:26,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 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 230 [2025-02-05 11:43:26,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:26,164 INFO L225 Difference]: With dead ends: 36180 [2025-02-05 11:43:26,164 INFO L226 Difference]: Without dead ends: 23994 [2025-02-05 11:43:26,173 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:26,175 INFO L435 NwaCegarLoop]: 837 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 984 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:26,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 984 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:43:26,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23994 states. [2025-02-05 11:43:26,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23994 to 22416. [2025-02-05 11:43:26,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22416 states, 22415 states have (on average 1.211153245594468) internal successors, (27148), 22415 states have internal predecessors, (27148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:26,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22416 states to 22416 states and 27148 transitions. [2025-02-05 11:43:26,457 INFO L78 Accepts]: Start accepts. Automaton has 22416 states and 27148 transitions. Word has length 230 [2025-02-05 11:43:26,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:26,458 INFO L471 AbstractCegarLoop]: Abstraction has 22416 states and 27148 transitions. [2025-02-05 11:43:26,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 2 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 22416 states and 27148 transitions. [2025-02-05 11:43:26,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2025-02-05 11:43:26,464 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:26,464 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:26,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 11:43:26,465 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:26,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:26,467 INFO L85 PathProgramCache]: Analyzing trace with hash 1944011209, now seen corresponding path program 1 times [2025-02-05 11:43:26,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:26,467 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950313235] [2025-02-05 11:43:26,467 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:26,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:26,486 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 273 statements into 1 equivalence classes. [2025-02-05 11:43:26,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 273 of 273 statements. [2025-02-05 11:43:26,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:26,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:26,648 INFO L134 CoverageAnalysis]: Checked inductivity of 305 backedges. 274 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 11:43:26,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:26,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950313235] [2025-02-05 11:43:26,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950313235] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:26,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:26,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:26,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226037110] [2025-02-05 11:43:26,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:26,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:43:26,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:26,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:43:26,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:43:26,650 INFO L87 Difference]: Start difference. First operand 22416 states and 27148 transitions. Second operand has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:32,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:32,711 INFO L93 Difference]: Finished difference Result 81258 states and 99282 transitions. [2025-02-05 11:43:32,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:43:32,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 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 273 [2025-02-05 11:43:32,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:32,798 INFO L225 Difference]: With dead ends: 81258 [2025-02-05 11:43:32,799 INFO L226 Difference]: Without dead ends: 59631 [2025-02-05 11:43:32,820 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-02-05 11:43:32,821 INFO L435 NwaCegarLoop]: 637 mSDtfsCounter, 1749 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 6812 mSolverCounterSat, 1077 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1749 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 7889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1077 IncrementalHoareTripleChecker+Valid, 6812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:32,821 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1749 Valid, 887 Invalid, 7889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1077 Valid, 6812 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2025-02-05 11:43:32,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59631 states. [2025-02-05 11:43:33,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59631 to 58716. [2025-02-05 11:43:33,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58716 states, 58715 states have (on average 1.188810355105169) internal successors, (69801), 58715 states have internal predecessors, (69801), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:33,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58716 states to 58716 states and 69801 transitions. [2025-02-05 11:43:33,398 INFO L78 Accepts]: Start accepts. Automaton has 58716 states and 69801 transitions. Word has length 273 [2025-02-05 11:43:33,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:33,399 INFO L471 AbstractCegarLoop]: Abstraction has 58716 states and 69801 transitions. [2025-02-05 11:43:33,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 60.75) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:33,399 INFO L276 IsEmpty]: Start isEmpty. Operand 58716 states and 69801 transitions. [2025-02-05 11:43:33,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2025-02-05 11:43:33,404 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:33,404 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:33,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 11:43:33,404 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:33,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:33,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1516861253, now seen corresponding path program 1 times [2025-02-05 11:43:33,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:33,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204591248] [2025-02-05 11:43:33,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:33,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:33,427 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 330 statements into 1 equivalence classes. [2025-02-05 11:43:33,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 330 of 330 statements. [2025-02-05 11:43:33,440 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:33,440 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:33,822 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 11:43:33,822 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:33,822 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204591248] [2025-02-05 11:43:33,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204591248] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:33,822 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:33,822 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:33,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93772600] [2025-02-05 11:43:33,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:33,823 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:33,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:33,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:33,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:33,823 INFO L87 Difference]: Start difference. First operand 58716 states and 69801 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:37,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:37,404 INFO L93 Difference]: Finished difference Result 143437 states and 173481 transitions. [2025-02-05 11:43:37,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:37,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 330 [2025-02-05 11:43:37,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:37,523 INFO L225 Difference]: With dead ends: 143437 [2025-02-05 11:43:37,524 INFO L226 Difference]: Without dead ends: 85510 [2025-02-05 11:43:37,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:37,561 INFO L435 NwaCegarLoop]: 1851 mSDtfsCounter, 753 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2597 mSolverCounterSat, 716 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 753 SdHoareTripleChecker+Valid, 1993 SdHoareTripleChecker+Invalid, 3313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 716 IncrementalHoareTripleChecker+Valid, 2597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:37,562 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [753 Valid, 1993 Invalid, 3313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [716 Valid, 2597 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2025-02-05 11:43:37,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85510 states. [2025-02-05 11:43:38,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85510 to 83901. [2025-02-05 11:43:38,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83901 states, 83900 states have (on average 1.1574016686531585) internal successors, (97106), 83900 states have internal predecessors, (97106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:38,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83901 states to 83901 states and 97106 transitions. [2025-02-05 11:43:38,666 INFO L78 Accepts]: Start accepts. Automaton has 83901 states and 97106 transitions. Word has length 330 [2025-02-05 11:43:38,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:38,667 INFO L471 AbstractCegarLoop]: Abstraction has 83901 states and 97106 transitions. [2025-02-05 11:43:38,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 83901 states and 97106 transitions. [2025-02-05 11:43:38,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-02-05 11:43:38,673 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:38,674 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:38,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 11:43:38,674 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:38,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:38,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1863707844, now seen corresponding path program 1 times [2025-02-05 11:43:38,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:38,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951508860] [2025-02-05 11:43:38,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:38,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:38,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-02-05 11:43:38,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-02-05 11:43:38,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:38,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:39,726 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 233 proven. 110 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-02-05 11:43:39,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:39,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951508860] [2025-02-05 11:43:39,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951508860] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 11:43:39,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1331595854] [2025-02-05 11:43:39,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:39,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:43:39,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 11:43:39,729 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-02-05 11:43:39,730 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-02-05 11:43:39,781 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-02-05 11:43:39,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-02-05 11:43:39,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:39,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:39,839 INFO L256 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-02-05 11:43:39,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 11:43:39,981 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2025-02-05 11:43:39,981 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 11:43:39,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1331595854] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:39,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 11:43:39,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-02-05 11:43:39,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616520454] [2025-02-05 11:43:39,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:39,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:39,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:39,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:39,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:43:39,982 INFO L87 Difference]: Start difference. First operand 83901 states and 97106 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:42,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:42,949 INFO L93 Difference]: Finished difference Result 167011 states and 193417 transitions. [2025-02-05 11:43:42,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:42,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359 [2025-02-05 11:43:42,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:43,091 INFO L225 Difference]: With dead ends: 167011 [2025-02-05 11:43:43,093 INFO L226 Difference]: Without dead ends: 83899 [2025-02-05 11:43:43,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 363 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 11:43:43,183 INFO L435 NwaCegarLoop]: 1367 mSDtfsCounter, 1123 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1449 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:43,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1449 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-02-05 11:43:43,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83899 states. [2025-02-05 11:43:44,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83899 to 83898. [2025-02-05 11:43:44,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83898 states, 83897 states have (on average 1.1157848314004077) internal successors, (93611), 83897 states have internal predecessors, (93611), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:44,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83898 states to 83898 states and 93611 transitions. [2025-02-05 11:43:44,367 INFO L78 Accepts]: Start accepts. Automaton has 83898 states and 93611 transitions. Word has length 359 [2025-02-05 11:43:44,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:44,368 INFO L471 AbstractCegarLoop]: Abstraction has 83898 states and 93611 transitions. [2025-02-05 11:43:44,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:44,368 INFO L276 IsEmpty]: Start isEmpty. Operand 83898 states and 93611 transitions. [2025-02-05 11:43:44,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2025-02-05 11:43:44,372 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:44,373 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:44,378 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 11:43:44,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 11:43:44,573 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:44,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:44,574 INFO L85 PathProgramCache]: Analyzing trace with hash -1976656973, now seen corresponding path program 1 times [2025-02-05 11:43:44,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:44,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540082538] [2025-02-05 11:43:44,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:44,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:44,607 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 389 statements into 1 equivalence classes. [2025-02-05 11:43:44,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 389 of 389 statements. [2025-02-05 11:43:44,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:44,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:44,753 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 452 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2025-02-05 11:43:44,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:44,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540082538] [2025-02-05 11:43:44,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540082538] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:44,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:44,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:44,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884655443] [2025-02-05 11:43:44,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:44,754 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:44,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:44,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:44,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:44,755 INFO L87 Difference]: Start difference. First operand 83898 states and 93611 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:47,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:47,965 INFO L93 Difference]: Finished difference Result 192987 states and 218149 transitions. [2025-02-05 11:43:47,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:47,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 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 389 [2025-02-05 11:43:47,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:48,093 INFO L225 Difference]: With dead ends: 192987 [2025-02-05 11:43:48,093 INFO L226 Difference]: Without dead ends: 109878 [2025-02-05 11:43:48,147 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:48,151 INFO L435 NwaCegarLoop]: 867 mSDtfsCounter, 885 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2424 mSolverCounterSat, 931 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 885 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 3355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 931 IncrementalHoareTripleChecker+Valid, 2424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:48,151 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [885 Valid, 952 Invalid, 3355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [931 Valid, 2424 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:43:48,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109878 states. [2025-02-05 11:43:49,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109878 to 108284. [2025-02-05 11:43:49,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108284 states, 108283 states have (on average 1.12302023401642) internal successors, (121604), 108283 states have internal predecessors, (121604), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:49,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108284 states to 108284 states and 121604 transitions. [2025-02-05 11:43:49,480 INFO L78 Accepts]: Start accepts. Automaton has 108284 states and 121604 transitions. Word has length 389 [2025-02-05 11:43:49,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:49,481 INFO L471 AbstractCegarLoop]: Abstraction has 108284 states and 121604 transitions. [2025-02-05 11:43:49,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:49,481 INFO L276 IsEmpty]: Start isEmpty. Operand 108284 states and 121604 transitions. [2025-02-05 11:43:49,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2025-02-05 11:43:49,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:49,500 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 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] [2025-02-05 11:43:49,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 11:43:49,500 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:49,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:49,500 INFO L85 PathProgramCache]: Analyzing trace with hash -524138495, now seen corresponding path program 1 times [2025-02-05 11:43:49,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:49,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140811855] [2025-02-05 11:43:49,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:49,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:49,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 427 statements into 1 equivalence classes. [2025-02-05 11:43:49,547 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 427 of 427 statements. [2025-02-05 11:43:49,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:49,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:49,743 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-02-05 11:43:49,744 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:49,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140811855] [2025-02-05 11:43:49,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140811855] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:49,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:49,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:49,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422254483] [2025-02-05 11:43:49,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:49,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:49,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:49,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:49,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:49,745 INFO L87 Difference]: Start difference. First operand 108284 states and 121604 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:53,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:53,631 INFO L93 Difference]: Finished difference Result 240978 states and 273398 transitions. [2025-02-05 11:43:53,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:53,631 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 427 [2025-02-05 11:43:53,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:53,777 INFO L225 Difference]: With dead ends: 240978 [2025-02-05 11:43:53,777 INFO L226 Difference]: Without dead ends: 133483 [2025-02-05 11:43:53,831 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:53,833 INFO L435 NwaCegarLoop]: 1788 mSDtfsCounter, 779 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1940 SdHoareTripleChecker+Invalid, 3270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:53,834 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1940 Invalid, 3270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:43:53,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133483 states. [2025-02-05 11:43:55,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133483 to 131892. [2025-02-05 11:43:55,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131892 states, 131891 states have (on average 1.109795209680721) internal successors, (146372), 131891 states have internal predecessors, (146372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131892 states to 131892 states and 146372 transitions. [2025-02-05 11:43:55,355 INFO L78 Accepts]: Start accepts. Automaton has 131892 states and 146372 transitions. Word has length 427 [2025-02-05 11:43:55,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:43:55,356 INFO L471 AbstractCegarLoop]: Abstraction has 131892 states and 146372 transitions. [2025-02-05 11:43:55,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:55,356 INFO L276 IsEmpty]: Start isEmpty. Operand 131892 states and 146372 transitions. [2025-02-05 11:43:55,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2025-02-05 11:43:55,378 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:43:55,378 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:43:55,380 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 11:43:55,381 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:43:55,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:43:55,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1794268407, now seen corresponding path program 1 times [2025-02-05 11:43:55,381 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:43:55,381 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079603662] [2025-02-05 11:43:55,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:43:55,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:43:55,443 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 546 statements into 1 equivalence classes. [2025-02-05 11:43:55,508 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 546 of 546 statements. [2025-02-05 11:43:55,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:43:55,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:43:55,898 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 831 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2025-02-05 11:43:55,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:43:55,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079603662] [2025-02-05 11:43:55,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079603662] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:43:55,898 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:43:55,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:43:55,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1509940176] [2025-02-05 11:43:55,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:43:55,899 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:43:55,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:43:55,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:43:55,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:55,899 INFO L87 Difference]: Start difference. First operand 131892 states and 146372 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:43:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:43:59,372 INFO L93 Difference]: Finished difference Result 263000 states and 291961 transitions. [2025-02-05 11:43:59,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:43:59,372 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 546 [2025-02-05 11:43:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:43:59,524 INFO L225 Difference]: With dead ends: 263000 [2025-02-05 11:43:59,524 INFO L226 Difference]: Without dead ends: 131897 [2025-02-05 11:43:59,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:43:59,588 INFO L435 NwaCegarLoop]: 1398 mSDtfsCounter, 938 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2488 mSolverCounterSat, 613 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 938 SdHoareTripleChecker+Valid, 1490 SdHoareTripleChecker+Invalid, 3101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 613 IncrementalHoareTripleChecker+Valid, 2488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-02-05 11:43:59,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [938 Valid, 1490 Invalid, 3101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [613 Valid, 2488 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-02-05 11:43:59,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131897 states. [2025-02-05 11:44:00,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131897 to 131883. [2025-02-05 11:44:00,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131883 states, 131882 states have (on average 1.0805037836854157) internal successors, (142499), 131882 states have internal predecessors, (142499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:00,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131883 states to 131883 states and 142499 transitions. [2025-02-05 11:44:00,877 INFO L78 Accepts]: Start accepts. Automaton has 131883 states and 142499 transitions. Word has length 546 [2025-02-05 11:44:00,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:00,877 INFO L471 AbstractCegarLoop]: Abstraction has 131883 states and 142499 transitions. [2025-02-05 11:44:00,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:00,877 INFO L276 IsEmpty]: Start isEmpty. Operand 131883 states and 142499 transitions. [2025-02-05 11:44:00,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 558 [2025-02-05 11:44:00,893 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:00,893 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:00,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 11:44:00,894 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:00,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:00,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1167307943, now seen corresponding path program 1 times [2025-02-05 11:44:00,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:00,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311816852] [2025-02-05 11:44:00,894 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:00,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:00,922 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 557 statements into 1 equivalence classes. [2025-02-05 11:44:00,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 557 of 557 statements. [2025-02-05 11:44:00,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:00,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:01,095 INFO L134 CoverageAnalysis]: Checked inductivity of 1026 backedges. 723 proven. 0 refuted. 0 times theorem prover too weak. 303 trivial. 0 not checked. [2025-02-05 11:44:01,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:01,095 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311816852] [2025-02-05 11:44:01,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311816852] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:01,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:01,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:01,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336287986] [2025-02-05 11:44:01,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:01,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:01,095 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:01,096 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:01,096 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:01,096 INFO L87 Difference]: Start difference. First operand 131883 states and 142499 transitions. Second operand has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:05,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:05,291 INFO L93 Difference]: Finished difference Result 247240 states and 267961 transitions. [2025-02-05 11:44:05,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:05,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 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 557 [2025-02-05 11:44:05,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:05,437 INFO L225 Difference]: With dead ends: 247240 [2025-02-05 11:44:05,437 INFO L226 Difference]: Without dead ends: 132681 [2025-02-05 11:44:05,470 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:05,471 INFO L435 NwaCegarLoop]: 1814 mSDtfsCounter, 727 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2578 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 727 SdHoareTripleChecker+Valid, 1949 SdHoareTripleChecker+Invalid, 2598 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2578 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:05,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [727 Valid, 1949 Invalid, 2598 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2578 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-02-05 11:44:05,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132681 states. [2025-02-05 11:44:06,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132681 to 132671. [2025-02-05 11:44:06,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132671 states, 132670 states have (on average 1.0804025024496873) internal successors, (143337), 132670 states have internal predecessors, (143337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132671 states to 132671 states and 143337 transitions. [2025-02-05 11:44:07,011 INFO L78 Accepts]: Start accepts. Automaton has 132671 states and 143337 transitions. Word has length 557 [2025-02-05 11:44:07,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:07,011 INFO L471 AbstractCegarLoop]: Abstraction has 132671 states and 143337 transitions. [2025-02-05 11:44:07,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:07,012 INFO L276 IsEmpty]: Start isEmpty. Operand 132671 states and 143337 transitions. [2025-02-05 11:44:07,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2025-02-05 11:44:07,030 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:07,030 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:07,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 11:44:07,033 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:07,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:07,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1507914844, now seen corresponding path program 1 times [2025-02-05 11:44:07,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:07,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049588977] [2025-02-05 11:44:07,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:07,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:07,071 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 582 statements into 1 equivalence classes. [2025-02-05 11:44:07,081 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 582 of 582 statements. [2025-02-05 11:44:07,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:07,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:07,177 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2025-02-05 11:44:07,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:07,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049588977] [2025-02-05 11:44:07,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049588977] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:07,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:07,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:07,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239115853] [2025-02-05 11:44:07,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:07,178 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:07,178 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:07,179 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:07,179 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:07,179 INFO L87 Difference]: Start difference. First operand 132671 states and 143337 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:10,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:10,534 INFO L93 Difference]: Finished difference Result 273184 states and 294592 transitions. [2025-02-05 11:44:10,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:10,534 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 582 [2025-02-05 11:44:10,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:10,700 INFO L225 Difference]: With dead ends: 273184 [2025-02-05 11:44:10,700 INFO L226 Difference]: Without dead ends: 135788 [2025-02-05 11:44:10,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:10,770 INFO L435 NwaCegarLoop]: 1496 mSDtfsCounter, 1019 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1629 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:10,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1629 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-05 11:44:10,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135788 states. [2025-02-05 11:44:12,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135788 to 128692. [2025-02-05 11:44:12,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128692 states, 128691 states have (on average 1.0560179033498847) internal successors, (135900), 128691 states have internal predecessors, (135900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:12,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128692 states to 128692 states and 135900 transitions. [2025-02-05 11:44:12,392 INFO L78 Accepts]: Start accepts. Automaton has 128692 states and 135900 transitions. Word has length 582 [2025-02-05 11:44:12,392 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:12,392 INFO L471 AbstractCegarLoop]: Abstraction has 128692 states and 135900 transitions. [2025-02-05 11:44:12,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:12,392 INFO L276 IsEmpty]: Start isEmpty. Operand 128692 states and 135900 transitions. [2025-02-05 11:44:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2025-02-05 11:44:12,406 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:12,406 INFO L218 NwaCegarLoop]: trace histogram [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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:12,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 11:44:12,406 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:12,407 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:12,407 INFO L85 PathProgramCache]: Analyzing trace with hash -1165955871, now seen corresponding path program 1 times [2025-02-05 11:44:12,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:12,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920021340] [2025-02-05 11:44:12,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:12,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:12,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 587 statements into 1 equivalence classes. [2025-02-05 11:44:12,456 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 587 of 587 statements. [2025-02-05 11:44:12,456 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:12,456 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:12,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2025-02-05 11:44:12,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:12,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920021340] [2025-02-05 11:44:12,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1920021340] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:12,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:12,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 11:44:12,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520724491] [2025-02-05 11:44:12,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:12,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 11:44:12,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:12,634 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 11:44:12,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:12,634 INFO L87 Difference]: Start difference. First operand 128692 states and 135900 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:16,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:16,348 INFO L93 Difference]: Finished difference Result 250253 states and 264935 transitions. [2025-02-05 11:44:16,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 11:44:16,349 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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-02-05 11:44:16,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:16,500 INFO L225 Difference]: With dead ends: 250253 [2025-02-05 11:44:16,500 INFO L226 Difference]: Without dead ends: 138096 [2025-02-05 11:44:16,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 11:44:16,525 INFO L435 NwaCegarLoop]: 1384 mSDtfsCounter, 1010 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 416 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1010 SdHoareTripleChecker+Valid, 1459 SdHoareTripleChecker+Invalid, 2764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 416 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:16,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1010 Valid, 1459 Invalid, 2764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [416 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-02-05 11:44:16,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138096 states. [2025-02-05 11:44:17,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138096 to 138095. [2025-02-05 11:44:17,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138095 states, 138094 states have (on average 1.0526308166900806) internal successors, (145362), 138094 states have internal predecessors, (145362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:17,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138095 states to 138095 states and 145362 transitions. [2025-02-05 11:44:17,941 INFO L78 Accepts]: Start accepts. Automaton has 138095 states and 145362 transitions. Word has length 587 [2025-02-05 11:44:17,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 11:44:17,943 INFO L471 AbstractCegarLoop]: Abstraction has 138095 states and 145362 transitions. [2025-02-05 11:44:17,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:17,943 INFO L276 IsEmpty]: Start isEmpty. Operand 138095 states and 145362 transitions. [2025-02-05 11:44:17,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2025-02-05 11:44:17,966 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 11:44:17,966 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 11:44:17,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 11:44:17,966 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 11:44:17,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 11:44:17,967 INFO L85 PathProgramCache]: Analyzing trace with hash -634666629, now seen corresponding path program 1 times [2025-02-05 11:44:17,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 11:44:17,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454425349] [2025-02-05 11:44:17,968 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 11:44:17,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 11:44:18,023 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 637 statements into 1 equivalence classes. [2025-02-05 11:44:18,062 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 637 of 637 statements. [2025-02-05 11:44:18,065 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 11:44:18,065 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 11:44:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-02-05 11:44:18,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 11:44:18,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454425349] [2025-02-05 11:44:18,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454425349] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 11:44:18,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 11:44:18,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 11:44:18,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006241842] [2025-02-05 11:44:18,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 11:44:18,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 11:44:18,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 11:44:18,622 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 11:44:18,622 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:44:18,622 INFO L87 Difference]: Start difference. First operand 138095 states and 145362 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 11:44:24,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 11:44:24,557 INFO L93 Difference]: Finished difference Result 388925 states and 409936 transitions. [2025-02-05 11:44:24,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 11:44:24,558 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 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 637 [2025-02-05 11:44:24,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 11:44:24,819 INFO L225 Difference]: With dead ends: 388925 [2025-02-05 11:44:24,819 INFO L226 Difference]: Without dead ends: 251619 [2025-02-05 11:44:24,861 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 11:44:24,862 INFO L435 NwaCegarLoop]: 632 mSDtfsCounter, 1703 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 6262 mSolverCounterSat, 1087 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1703 SdHoareTripleChecker+Valid, 876 SdHoareTripleChecker+Invalid, 7349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1087 IncrementalHoareTripleChecker+Valid, 6262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-02-05 11:44:24,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1703 Valid, 876 Invalid, 7349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1087 Valid, 6262 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-02-05 11:44:25,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251619 states.