./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 64562d20261a98c4fff8930ffc2f21f6ad2db9602778187addddf7335f143802 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 20:22:03,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 20:22:03,301 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 20:22:03,307 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 20:22:03,307 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 20:22:03,328 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 20:22:03,331 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 20:22:03,331 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 20:22:03,332 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 20:22:03,332 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 20:22:03,332 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 20:22:03,332 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 20:22:03,333 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 20:22:03,333 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 20:22:03,333 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 20:22:03,333 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 20:22:03,333 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 20:22:03,333 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 20:22:03,333 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 20:22:03,334 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 20:22:03,334 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 20:22:03,334 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 20:22:03,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 20:22:03,334 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 20:22:03,334 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 20:22:03,334 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 20:22:03,334 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 20:22:03,334 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 20:22:03,334 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 20:22:03,334 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 20:22:03,335 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 20:22:03,335 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 20:22:03,335 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:22:03,335 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 20:22:03,335 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 20:22:03,335 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 20:22:03,336 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 20:22:03,336 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 20:22:03,336 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 20:22:03,336 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 20:22:03,336 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 20:22:03,336 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 20:22:03,336 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 20:22:03,336 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 64562d20261a98c4fff8930ffc2f21f6ad2db9602778187addddf7335f143802 [2025-03-16 20:22:03,575 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 20:22:03,582 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 20:22:03,584 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 20:22:03,584 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 20:22:03,585 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 20:22:03,585 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:22:04,688 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008252892/0d72157c319d427c8c0d8f405f4f9376/FLAG1483d7782 [2025-03-16 20:22:05,118 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 20:22:05,119 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:22:05,148 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008252892/0d72157c319d427c8c0d8f405f4f9376/FLAG1483d7782 [2025-03-16 20:22:05,264 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/008252892/0d72157c319d427c8c0d8f405f4f9376 [2025-03-16 20:22:05,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 20:22:05,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 20:22:05,269 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 20:22:05,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 20:22:05,273 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 20:22:05,273 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:22:05" (1/1) ... [2025-03-16 20:22:05,274 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59b0b44a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:05, skipping insertion in model container [2025-03-16 20:22:05,274 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 08:22:05" (1/1) ... [2025-03-16 20:22:05,345 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 20:22:05,584 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[6524,6537] [2025-03-16 20:22:05,630 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[13460,13473] [2025-03-16 20:22:06,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:22:06,018 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 20:22:06,047 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[6524,6537] [2025-03-16 20:22:06,056 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/combinations/pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c[13460,13473] [2025-03-16 20:22:06,303 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 20:22:06,324 INFO L204 MainTranslator]: Completed translation [2025-03-16 20:22:06,325 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06 WrapperNode [2025-03-16 20:22:06,325 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 20:22:06,326 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 20:22:06,326 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 20:22:06,326 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 20:22:06,330 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (1/1) ... [2025-03-16 20:22:06,364 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (1/1) ... [2025-03-16 20:22:06,595 INFO L138 Inliner]: procedures = 35, calls = 20, calls flagged for inlining = 15, calls inlined = 15, statements flattened = 4975 [2025-03-16 20:22:06,596 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 20:22:06,596 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 20:22:06,597 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 20:22:06,597 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 20:22:06,603 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (1/1) ... [2025-03-16 20:22:06,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (1/1) ... [2025-03-16 20:22:06,647 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (1/1) ... [2025-03-16 20:22:06,766 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-03-16 20:22:06,767 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (1/1) ... [2025-03-16 20:22:06,767 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (1/1) ... [2025-03-16 20:22:06,870 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (1/1) ... [2025-03-16 20:22:06,890 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (1/1) ... [2025-03-16 20:22:06,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (1/1) ... [2025-03-16 20:22:06,930 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (1/1) ... [2025-03-16 20:22:06,972 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 20:22:06,973 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 20:22:06,973 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 20:22:06,973 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 20:22:06,974 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (1/1) ... [2025-03-16 20:22:06,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 20:22:06,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:06,998 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-16 20:22:07,003 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-16 20:22:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 20:22:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 20:22:07,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 20:22:07,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 20:22:07,091 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 20:22:07,093 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 20:22:10,331 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4955: havoc calculate_output3_#t~ret31#1; [2025-03-16 20:22:10,331 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1986: havoc calculate_output_#t~ret29#1; [2025-03-16 20:22:10,331 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3465: havoc calculate_output2_#t~ret30#1; [2025-03-16 20:22:10,477 INFO L? ?]: Removed 730 outVars from TransFormulas that were not future-live. [2025-03-16 20:22:10,477 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 20:22:10,507 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 20:22:10,508 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 20:22:10,508 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:22:10 BoogieIcfgContainer [2025-03-16 20:22:10,508 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 20:22:10,510 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 20:22:10,513 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 20:22:10,517 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 20:22:10,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 08:22:05" (1/3) ... [2025-03-16 20:22:10,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a2821f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:22:10, skipping insertion in model container [2025-03-16 20:22:10,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 08:22:06" (2/3) ... [2025-03-16 20:22:10,517 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@59a2821f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 08:22:10, skipping insertion in model container [2025-03-16 20:22:10,517 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 08:22:10" (3/3) ... [2025-03-16 20:22:10,518 INFO L128 eAbstractionObserver]: Analyzing ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c [2025-03-16 20:22:10,528 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 20:22:10,530 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG pals_lcr.3_overflow.ufo.UNBOUNDED.pals+Problem12_label05.c that has 1 procedures, 807 locations, 1 initial locations, 2 loop locations, and 2 error locations. [2025-03-16 20:22:10,597 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 20:22:10,605 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;@6d5153cb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 20:22:10,605 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-16 20:22:10,610 INFO L276 IsEmpty]: Start isEmpty. Operand has 807 states, 804 states have (on average 1.9776119402985075) internal successors, (1590), 806 states have internal predecessors, (1590), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:10,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:22:10,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:10,614 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:10,614 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:10,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:10,618 INFO L85 PathProgramCache]: Analyzing trace with hash 768302087, now seen corresponding path program 1 times [2025-03-16 20:22:10,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:10,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300245569] [2025-03-16 20:22:10,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:10,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:10,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:22:10,712 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:22:10,712 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:10,712 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:10,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:10,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:10,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300245569] [2025-03-16 20:22:10,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300245569] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:10,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:10,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 20:22:10,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279591922] [2025-03-16 20:22:10,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:10,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 20:22:10,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:10,804 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 20:22:10,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:22:10,807 INFO L87 Difference]: Start difference. First operand has 807 states, 804 states have (on average 1.9776119402985075) internal successors, (1590), 806 states have internal predecessors, (1590), 0 states have call successors, (0), 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 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:10,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:10,873 INFO L93 Difference]: Finished difference Result 1594 states and 3142 transitions. [2025-03-16 20:22:10,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 20:22:10,875 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-16 20:22:10,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:10,890 INFO L225 Difference]: With dead ends: 1594 [2025-03-16 20:22:10,890 INFO L226 Difference]: Without dead ends: 803 [2025-03-16 20:22:10,896 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 20:22:10,899 INFO L435 NwaCegarLoop]: 1525 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:10,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1525 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:10,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-16 20:22:10,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-03-16 20:22:10,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.898876404494382) internal successors, (1521), 802 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:10,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1521 transitions. [2025-03-16 20:22:10,977 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1521 transitions. Word has length 17 [2025-03-16 20:22:10,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:10,977 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1521 transitions. [2025-03-16 20:22:10,978 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:10,978 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1521 transitions. [2025-03-16 20:22:10,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-16 20:22:10,978 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:10,979 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:10,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 20:22:10,980 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:10,980 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:10,980 INFO L85 PathProgramCache]: Analyzing trace with hash 474899080, now seen corresponding path program 1 times [2025-03-16 20:22:10,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:10,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244628309] [2025-03-16 20:22:10,981 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:10,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:10,993 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-16 20:22:11,016 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-16 20:22:11,016 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:11,016 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:11,191 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:11,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:11,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244628309] [2025-03-16 20:22:11,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244628309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:11,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:11,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 20:22:11,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085181889] [2025-03-16 20:22:11,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:11,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:22:11,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:11,193 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:22:11,193 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:22:11,193 INFO L87 Difference]: Start difference. First operand 803 states and 1521 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:11,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:11,270 INFO L93 Difference]: Finished difference Result 835 states and 1570 transitions. [2025-03-16 20:22:11,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:22:11,271 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 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 17 [2025-03-16 20:22:11,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:11,276 INFO L225 Difference]: With dead ends: 835 [2025-03-16 20:22:11,276 INFO L226 Difference]: Without dead ends: 803 [2025-03-16 20:22:11,277 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-03-16 20:22:11,278 INFO L435 NwaCegarLoop]: 1520 mSDtfsCounter, 0 mSDsluCounter, 3020 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 4540 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:11,278 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 4540 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:11,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-03-16 20:22:11,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 803. [2025-03-16 20:22:11,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 803 states, 801 states have (on average 1.8789013732833957) internal successors, (1505), 802 states have internal predecessors, (1505), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:11,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 803 states to 803 states and 1505 transitions. [2025-03-16 20:22:11,309 INFO L78 Accepts]: Start accepts. Automaton has 803 states and 1505 transitions. Word has length 17 [2025-03-16 20:22:11,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:11,309 INFO L471 AbstractCegarLoop]: Abstraction has 803 states and 1505 transitions. [2025-03-16 20:22:11,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:11,309 INFO L276 IsEmpty]: Start isEmpty. Operand 803 states and 1505 transitions. [2025-03-16 20:22:11,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-03-16 20:22:11,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:11,310 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] [2025-03-16 20:22:11,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 20:22:11,310 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:11,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:11,310 INFO L85 PathProgramCache]: Analyzing trace with hash 1346779243, now seen corresponding path program 1 times [2025-03-16 20:22:11,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:11,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613348873] [2025-03-16 20:22:11,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:11,311 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:11,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-03-16 20:22:11,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-03-16 20:22:11,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:11,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:11,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:11,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:11,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613348873] [2025-03-16 20:22:11,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [613348873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:11,471 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:11,471 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:22:11,472 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181509927] [2025-03-16 20:22:11,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:11,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:22:11,473 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:11,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:22:11,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:22:11,474 INFO L87 Difference]: Start difference. First operand 803 states and 1505 transitions. Second operand has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:11,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:11,577 INFO L93 Difference]: Finished difference Result 977 states and 1781 transitions. [2025-03-16 20:22:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 20:22:11,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2025-03-16 20:22:11,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:11,581 INFO L225 Difference]: With dead ends: 977 [2025-03-16 20:22:11,581 INFO L226 Difference]: Without dead ends: 948 [2025-03-16 20:22:11,582 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 20:22:11,582 INFO L435 NwaCegarLoop]: 1499 mSDtfsCounter, 4611 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4611 SdHoareTripleChecker+Valid, 1759 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:11,582 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4611 Valid, 1759 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:11,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-03-16 20:22:11,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 830. [2025-03-16 20:22:11,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8695652173913044) internal successors, (1548), 829 states have internal predecessors, (1548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:11,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1548 transitions. [2025-03-16 20:22:11,614 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1548 transitions. Word has length 32 [2025-03-16 20:22:11,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:11,614 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1548 transitions. [2025-03-16 20:22:11,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:11,614 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1548 transitions. [2025-03-16 20:22:11,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:22:11,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:11,617 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:11,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 20:22:11,618 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:11,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:11,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1506878637, now seen corresponding path program 1 times [2025-03-16 20:22:11,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:11,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785099607] [2025-03-16 20:22:11,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:11,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:11,627 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:22:11,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:22:11,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:11,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:11,787 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:11,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:11,787 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785099607] [2025-03-16 20:22:11,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785099607] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:11,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:11,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:22:11,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [625416961] [2025-03-16 20:22:11,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:11,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:22:11,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:11,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:22:11,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:22:11,788 INFO L87 Difference]: Start difference. First operand 830 states and 1548 transitions. Second operand has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:11,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:11,859 INFO L93 Difference]: Finished difference Result 888 states and 1638 transitions. [2025-03-16 20:22:11,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:22:11,860 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 20:22:11,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:11,863 INFO L225 Difference]: With dead ends: 888 [2025-03-16 20:22:11,863 INFO L226 Difference]: Without dead ends: 832 [2025-03-16 20:22:11,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:22:11,865 INFO L435 NwaCegarLoop]: 1500 mSDtfsCounter, 4411 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4411 SdHoareTripleChecker+Valid, 1584 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:11,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4411 Valid, 1584 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:11,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 832 states. [2025-03-16 20:22:11,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 832 to 830. [2025-03-16 20:22:11,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 830 states, 828 states have (on average 1.8683574879227054) internal successors, (1547), 829 states have internal predecessors, (1547), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:11,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 830 states to 830 states and 1547 transitions. [2025-03-16 20:22:11,884 INFO L78 Accepts]: Start accepts. Automaton has 830 states and 1547 transitions. Word has length 34 [2025-03-16 20:22:11,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:11,884 INFO L471 AbstractCegarLoop]: Abstraction has 830 states and 1547 transitions. [2025-03-16 20:22:11,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:11,885 INFO L276 IsEmpty]: Start isEmpty. Operand 830 states and 1547 transitions. [2025-03-16 20:22:11,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-16 20:22:11,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:11,887 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:11,887 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 20:22:11,887 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:11,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:11,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1505835952, now seen corresponding path program 1 times [2025-03-16 20:22:11,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:11,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812111733] [2025-03-16 20:22:11,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:11,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:11,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-16 20:22:11,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-16 20:22:11,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:11,908 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:11,959 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:11,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:11,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812111733] [2025-03-16 20:22:11,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812111733] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:11,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:11,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990738063] [2025-03-16 20:22:11,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:11,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:11,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:11,960 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:11,960 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:11,960 INFO L87 Difference]: Start difference. First operand 830 states and 1547 transitions. Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:11,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:11,986 INFO L93 Difference]: Finished difference Result 931 states and 1704 transitions. [2025-03-16 20:22:11,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:11,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2025-03-16 20:22:11,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:11,990 INFO L225 Difference]: With dead ends: 931 [2025-03-16 20:22:11,990 INFO L226 Difference]: Without dead ends: 875 [2025-03-16 20:22:11,990 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:11,991 INFO L435 NwaCegarLoop]: 1502 mSDtfsCounter, 1464 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1464 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:11,992 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1464 Valid, 1543 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2025-03-16 20:22:12,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 873. [2025-03-16 20:22:12,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 873 states, 871 states have (on average 1.8507462686567164) internal successors, (1612), 872 states have internal predecessors, (1612), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 873 states to 873 states and 1612 transitions. [2025-03-16 20:22:12,012 INFO L78 Accepts]: Start accepts. Automaton has 873 states and 1612 transitions. Word has length 34 [2025-03-16 20:22:12,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:12,013 INFO L471 AbstractCegarLoop]: Abstraction has 873 states and 1612 transitions. [2025-03-16 20:22:12,013 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,013 INFO L276 IsEmpty]: Start isEmpty. Operand 873 states and 1612 transitions. [2025-03-16 20:22:12,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-16 20:22:12,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:12,014 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:12,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 20:22:12,014 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:12,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:12,015 INFO L85 PathProgramCache]: Analyzing trace with hash -530417449, now seen corresponding path program 1 times [2025-03-16 20:22:12,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:12,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860346755] [2025-03-16 20:22:12,015 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:12,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:12,025 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-16 20:22:12,033 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-16 20:22:12,034 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:12,034 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:12,206 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:12,206 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:12,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860346755] [2025-03-16 20:22:12,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [860346755] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:12,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:12,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 20:22:12,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411095600] [2025-03-16 20:22:12,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:12,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 20:22:12,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:12,207 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 20:22:12,207 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:22:12,207 INFO L87 Difference]: Start difference. First operand 873 states and 1612 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:12,262 INFO L93 Difference]: Finished difference Result 879 states and 1619 transitions. [2025-03-16 20:22:12,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 20:22:12,262 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 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 35 [2025-03-16 20:22:12,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:12,266 INFO L225 Difference]: With dead ends: 879 [2025-03-16 20:22:12,267 INFO L226 Difference]: Without dead ends: 877 [2025-03-16 20:22:12,267 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 20:22:12,268 INFO L435 NwaCegarLoop]: 1501 mSDtfsCounter, 0 mSDsluCounter, 5993 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7494 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:12,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7494 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:12,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2025-03-16 20:22:12,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 877. [2025-03-16 20:22:12,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 875 states have (on average 1.8457142857142856) internal successors, (1615), 876 states have internal predecessors, (1615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1615 transitions. [2025-03-16 20:22:12,288 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1615 transitions. Word has length 35 [2025-03-16 20:22:12,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:12,289 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1615 transitions. [2025-03-16 20:22:12,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 6 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,290 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1615 transitions. [2025-03-16 20:22:12,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:22:12,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:12,291 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:12,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 20:22:12,291 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:12,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:12,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1988236593, now seen corresponding path program 1 times [2025-03-16 20:22:12,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:12,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068278010] [2025-03-16 20:22:12,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:12,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:12,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:22:12,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:22:12,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:12,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:12,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:12,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:12,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068278010] [2025-03-16 20:22:12,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068278010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:12,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:12,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:12,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1796443048] [2025-03-16 20:22:12,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:12,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:12,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:12,333 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:12,333 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:12,334 INFO L87 Difference]: Start difference. First operand 877 states and 1615 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:12,357 INFO L93 Difference]: Finished difference Result 1067 states and 1899 transitions. [2025-03-16 20:22:12,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:12,357 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:22:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:12,361 INFO L225 Difference]: With dead ends: 1067 [2025-03-16 20:22:12,361 INFO L226 Difference]: Without dead ends: 964 [2025-03-16 20:22:12,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:12,362 INFO L435 NwaCegarLoop]: 1530 mSDtfsCounter, 1472 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1472 SdHoareTripleChecker+Valid, 1581 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:12,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1472 Valid, 1581 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:12,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-03-16 20:22:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 962. [2025-03-16 20:22:12,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 960 states have (on average 1.8104166666666666) internal successors, (1738), 961 states have internal predecessors, (1738), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1738 transitions. [2025-03-16 20:22:12,382 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1738 transitions. Word has length 36 [2025-03-16 20:22:12,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:12,382 INFO L471 AbstractCegarLoop]: Abstraction has 962 states and 1738 transitions. [2025-03-16 20:22:12,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,382 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1738 transitions. [2025-03-16 20:22:12,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:22:12,383 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:12,383 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:12,383 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 20:22:12,383 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:12,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:12,384 INFO L85 PathProgramCache]: Analyzing trace with hash 1756941775, now seen corresponding path program 1 times [2025-03-16 20:22:12,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:12,384 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486414091] [2025-03-16 20:22:12,384 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:12,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:12,390 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:22:12,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:22:12,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:12,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:12,457 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:12,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:12,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486414091] [2025-03-16 20:22:12,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486414091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:12,457 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:12,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:12,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627697328] [2025-03-16 20:22:12,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:12,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:12,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:12,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:12,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:12,459 INFO L87 Difference]: Start difference. First operand 962 states and 1738 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:12,480 INFO L93 Difference]: Finished difference Result 1306 states and 2240 transitions. [2025-03-16 20:22:12,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:12,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:22:12,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:12,484 INFO L225 Difference]: With dead ends: 1306 [2025-03-16 20:22:12,484 INFO L226 Difference]: Without dead ends: 1118 [2025-03-16 20:22:12,484 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:12,485 INFO L435 NwaCegarLoop]: 1528 mSDtfsCounter, 1470 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1470 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:12,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1470 Valid, 1583 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:12,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1118 states. [2025-03-16 20:22:12,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1118 to 1116. [2025-03-16 20:22:12,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 1114 states have (on average 1.7522441651705565) internal successors, (1952), 1115 states have internal predecessors, (1952), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1952 transitions. [2025-03-16 20:22:12,506 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1952 transitions. Word has length 36 [2025-03-16 20:22:12,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:12,507 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1952 transitions. [2025-03-16 20:22:12,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1952 transitions. [2025-03-16 20:22:12,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-16 20:22:12,508 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:12,508 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:12,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 20:22:12,508 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:12,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:12,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1922054193, now seen corresponding path program 1 times [2025-03-16 20:22:12,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:12,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29442057] [2025-03-16 20:22:12,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:12,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:12,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-16 20:22:12,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-16 20:22:12,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:12,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:12,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:12,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:12,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29442057] [2025-03-16 20:22:12,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29442057] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:12,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:12,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:12,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765845543] [2025-03-16 20:22:12,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:12,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:12,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:12,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:12,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:12,555 INFO L87 Difference]: Start difference. First operand 1116 states and 1952 transitions. Second operand has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:12,580 INFO L93 Difference]: Finished difference Result 1490 states and 2501 transitions. [2025-03-16 20:22:12,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:12,580 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-16 20:22:12,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:12,585 INFO L225 Difference]: With dead ends: 1490 [2025-03-16 20:22:12,585 INFO L226 Difference]: Without dead ends: 1288 [2025-03-16 20:22:12,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:12,587 INFO L435 NwaCegarLoop]: 1536 mSDtfsCounter, 1474 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1474 SdHoareTripleChecker+Valid, 1583 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:12,587 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1474 Valid, 1583 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:12,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1288 states. [2025-03-16 20:22:12,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1288 to 1286. [2025-03-16 20:22:12,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1286 states, 1284 states have (on average 1.705607476635514) internal successors, (2190), 1285 states have internal predecessors, (2190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1286 states to 1286 states and 2190 transitions. [2025-03-16 20:22:12,613 INFO L78 Accepts]: Start accepts. Automaton has 1286 states and 2190 transitions. Word has length 36 [2025-03-16 20:22:12,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:12,614 INFO L471 AbstractCegarLoop]: Abstraction has 1286 states and 2190 transitions. [2025-03-16 20:22:12,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 3 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,614 INFO L276 IsEmpty]: Start isEmpty. Operand 1286 states and 2190 transitions. [2025-03-16 20:22:12,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:22:12,614 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:12,614 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:22:12,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 20:22:12,615 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:12,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:12,616 INFO L85 PathProgramCache]: Analyzing trace with hash 512007547, now seen corresponding path program 1 times [2025-03-16 20:22:12,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:12,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455308812] [2025-03-16 20:22:12,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:12,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:12,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:22:12,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:22:12,632 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:12,632 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:12,712 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 20:22:12,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:12,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455308812] [2025-03-16 20:22:12,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455308812] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:12,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:12,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:22:12,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414354177] [2025-03-16 20:22:12,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:12,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:22:12,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:12,713 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:22:12,714 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:22:12,714 INFO L87 Difference]: Start difference. First operand 1286 states and 2190 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:12,790 INFO L93 Difference]: Finished difference Result 2934 states and 4534 transitions. [2025-03-16 20:22:12,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:22:12,790 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 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 50 [2025-03-16 20:22:12,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:12,798 INFO L225 Difference]: With dead ends: 2934 [2025-03-16 20:22:12,798 INFO L226 Difference]: Without dead ends: 2424 [2025-03-16 20:22:12,799 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:22:12,800 INFO L435 NwaCegarLoop]: 1542 mSDtfsCounter, 3035 mSDsluCounter, 1593 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3035 SdHoareTripleChecker+Valid, 3135 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:12,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3035 Valid, 3135 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:12,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2424 states. [2025-03-16 20:22:12,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2424 to 1794. [2025-03-16 20:22:12,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1794 states, 1792 states have (on average 1.6216517857142858) internal successors, (2906), 1793 states have internal predecessors, (2906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1794 states to 1794 states and 2906 transitions. [2025-03-16 20:22:12,840 INFO L78 Accepts]: Start accepts. Automaton has 1794 states and 2906 transitions. Word has length 50 [2025-03-16 20:22:12,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:12,841 INFO L471 AbstractCegarLoop]: Abstraction has 1794 states and 2906 transitions. [2025-03-16 20:22:12,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:12,841 INFO L276 IsEmpty]: Start isEmpty. Operand 1794 states and 2906 transitions. [2025-03-16 20:22:12,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:22:12,842 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:12,842 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:22:12,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 20:22:12,842 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:12,842 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:12,842 INFO L85 PathProgramCache]: Analyzing trace with hash -37781381, now seen corresponding path program 1 times [2025-03-16 20:22:12,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:12,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530655606] [2025-03-16 20:22:12,842 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:12,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:12,849 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:22:12,855 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:22:12,855 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:12,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:12,923 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-03-16 20:22:12,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:12,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530655606] [2025-03-16 20:22:12,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530655606] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:12,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:12,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:22:12,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546953281] [2025-03-16 20:22:12,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:12,924 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:22:12,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:12,924 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:22:12,924 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:22:12,925 INFO L87 Difference]: Start difference. First operand 1794 states and 2906 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:13,013 INFO L93 Difference]: Finished difference Result 3442 states and 5250 transitions. [2025-03-16 20:22:13,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:22:13,013 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 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 50 [2025-03-16 20:22:13,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:13,022 INFO L225 Difference]: With dead ends: 3442 [2025-03-16 20:22:13,023 INFO L226 Difference]: Without dead ends: 2932 [2025-03-16 20:22:13,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:22:13,026 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 3039 mSDsluCounter, 1596 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3039 SdHoareTripleChecker+Valid, 3139 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:13,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3039 Valid, 3139 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:13,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2932 states. [2025-03-16 20:22:13,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2932 to 2558. [2025-03-16 20:22:13,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2558 states, 2556 states have (on average 1.55320813771518) internal successors, (3970), 2557 states have internal predecessors, (3970), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2558 states to 2558 states and 3970 transitions. [2025-03-16 20:22:13,083 INFO L78 Accepts]: Start accepts. Automaton has 2558 states and 3970 transitions. Word has length 50 [2025-03-16 20:22:13,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:13,083 INFO L471 AbstractCegarLoop]: Abstraction has 2558 states and 3970 transitions. [2025-03-16 20:22:13,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,083 INFO L276 IsEmpty]: Start isEmpty. Operand 2558 states and 3970 transitions. [2025-03-16 20:22:13,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-03-16 20:22:13,084 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:13,084 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:22:13,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 20:22:13,084 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:13,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:13,085 INFO L85 PathProgramCache]: Analyzing trace with hash 578189947, now seen corresponding path program 1 times [2025-03-16 20:22:13,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:13,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989101503] [2025-03-16 20:22:13,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:13,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:13,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-03-16 20:22:13,097 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-03-16 20:22:13,097 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:13,097 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:13,154 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:22:13,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:13,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989101503] [2025-03-16 20:22:13,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989101503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:13,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:13,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 20:22:13,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305245759] [2025-03-16 20:22:13,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:13,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 20:22:13,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:13,155 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 20:22:13,155 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 20:22:13,155 INFO L87 Difference]: Start difference. First operand 2558 states and 3970 transitions. Second operand has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:13,232 INFO L93 Difference]: Finished difference Result 3670 states and 5582 transitions. [2025-03-16 20:22:13,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 20:22:13,233 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 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 50 [2025-03-16 20:22:13,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:13,242 INFO L225 Difference]: With dead ends: 3670 [2025-03-16 20:22:13,242 INFO L226 Difference]: Without dead ends: 3300 [2025-03-16 20:22:13,243 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-16 20:22:13,244 INFO L435 NwaCegarLoop]: 1541 mSDtfsCounter, 3034 mSDsluCounter, 1606 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3034 SdHoareTripleChecker+Valid, 3147 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:13,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3034 Valid, 3147 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:13,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3300 states. [2025-03-16 20:22:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3300 to 2926. [2025-03-16 20:22:13,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2924 states have (on average 1.5383036935704515) internal successors, (4498), 2925 states have internal predecessors, (4498), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4498 transitions. [2025-03-16 20:22:13,305 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4498 transitions. Word has length 50 [2025-03-16 20:22:13,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:13,305 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4498 transitions. [2025-03-16 20:22:13,305 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.8) internal successors, (49), 5 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,305 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4498 transitions. [2025-03-16 20:22:13,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 20:22:13,306 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:13,306 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:22:13,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-16 20:22:13,306 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:13,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:13,307 INFO L85 PathProgramCache]: Analyzing trace with hash -1763746431, now seen corresponding path program 1 times [2025-03-16 20:22:13,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:13,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1944164434] [2025-03-16 20:22:13,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:13,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:13,314 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 51 statements into 1 equivalence classes. [2025-03-16 20:22:13,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 51 of 51 statements. [2025-03-16 20:22:13,326 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:13,326 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:13,379 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:13,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:13,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1944164434] [2025-03-16 20:22:13,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1944164434] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:13,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:13,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:13,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286298645] [2025-03-16 20:22:13,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:13,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:13,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:13,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:13,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:13,381 INFO L87 Difference]: Start difference. First operand 2926 states and 4498 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:13,422 INFO L93 Difference]: Finished difference Result 5078 states and 7536 transitions. [2025-03-16 20:22:13,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:13,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 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 51 [2025-03-16 20:22:13,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:13,432 INFO L225 Difference]: With dead ends: 5078 [2025-03-16 20:22:13,432 INFO L226 Difference]: Without dead ends: 2928 [2025-03-16 20:22:13,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:13,436 INFO L435 NwaCegarLoop]: 1523 mSDtfsCounter, 29 mSDsluCounter, 1493 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 3016 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:13,436 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 3016 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:13,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2928 states. [2025-03-16 20:22:13,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2928 to 2926. [2025-03-16 20:22:13,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2926 states, 2924 states have (on average 1.5212038303693571) internal successors, (4448), 2925 states have internal predecessors, (4448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2926 states to 2926 states and 4448 transitions. [2025-03-16 20:22:13,498 INFO L78 Accepts]: Start accepts. Automaton has 2926 states and 4448 transitions. Word has length 51 [2025-03-16 20:22:13,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:13,498 INFO L471 AbstractCegarLoop]: Abstraction has 2926 states and 4448 transitions. [2025-03-16 20:22:13,498 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,498 INFO L276 IsEmpty]: Start isEmpty. Operand 2926 states and 4448 transitions. [2025-03-16 20:22:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 20:22:13,499 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:13,499 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:13,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 20:22:13,500 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:13,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:13,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1844804163, now seen corresponding path program 1 times [2025-03-16 20:22:13,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:13,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016849811] [2025-03-16 20:22:13,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:13,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:13,507 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-16 20:22:13,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-16 20:22:13,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:13,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:13,561 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:13,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:13,561 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016849811] [2025-03-16 20:22:13,561 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016849811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:13,561 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:13,561 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:13,561 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070444253] [2025-03-16 20:22:13,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:13,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:13,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:13,562 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:13,562 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:13,562 INFO L87 Difference]: Start difference. First operand 2926 states and 4448 transitions. Second operand has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:13,593 INFO L93 Difference]: Finished difference Result 3772 states and 5635 transitions. [2025-03-16 20:22:13,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:13,593 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 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 52 [2025-03-16 20:22:13,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:13,598 INFO L225 Difference]: With dead ends: 3772 [2025-03-16 20:22:13,598 INFO L226 Difference]: Without dead ends: 1622 [2025-03-16 20:22:13,600 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:13,601 INFO L435 NwaCegarLoop]: 1521 mSDtfsCounter, 23 mSDsluCounter, 1492 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 3013 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:13,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 3013 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:13,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2025-03-16 20:22:13,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1615. [2025-03-16 20:22:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1615 states, 1613 states have (on average 1.6261624302541848) internal successors, (2623), 1614 states have internal predecessors, (2623), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1615 states to 1615 states and 2623 transitions. [2025-03-16 20:22:13,633 INFO L78 Accepts]: Start accepts. Automaton has 1615 states and 2623 transitions. Word has length 52 [2025-03-16 20:22:13,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:13,633 INFO L471 AbstractCegarLoop]: Abstraction has 1615 states and 2623 transitions. [2025-03-16 20:22:13,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.333333333333332) internal successors, (52), 3 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,633 INFO L276 IsEmpty]: Start isEmpty. Operand 1615 states and 2623 transitions. [2025-03-16 20:22:13,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-16 20:22:13,634 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:13,634 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:22:13,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 20:22:13,634 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:13,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:13,634 INFO L85 PathProgramCache]: Analyzing trace with hash 120675386, now seen corresponding path program 1 times [2025-03-16 20:22:13,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:13,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409373176] [2025-03-16 20:22:13,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:13,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:13,642 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-16 20:22:13,653 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-16 20:22:13,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:13,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:13,697 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:13,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:13,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409373176] [2025-03-16 20:22:13,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409373176] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:13,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:13,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:13,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [517575491] [2025-03-16 20:22:13,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:13,698 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 20:22:13,698 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:13,699 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 20:22:13,699 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:13,699 INFO L87 Difference]: Start difference. First operand 1615 states and 2623 transitions. Second operand has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:13,720 INFO L93 Difference]: Finished difference Result 2033 states and 3201 transitions. [2025-03-16 20:22:13,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 20:22:13,721 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 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 53 [2025-03-16 20:22:13,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:13,727 INFO L225 Difference]: With dead ends: 2033 [2025-03-16 20:22:13,730 INFO L226 Difference]: Without dead ends: 1203 [2025-03-16 20:22:13,731 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 20:22:13,731 INFO L435 NwaCegarLoop]: 1515 mSDtfsCounter, 25 mSDsluCounter, 1477 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 2992 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:13,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 2992 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 20:22:13,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1203 states. [2025-03-16 20:22:13,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1203 to 1201. [2025-03-16 20:22:13,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1201 states, 1199 states have (on average 1.6997497914929107) internal successors, (2038), 1200 states have internal predecessors, (2038), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1201 states to 1201 states and 2038 transitions. [2025-03-16 20:22:13,751 INFO L78 Accepts]: Start accepts. Automaton has 1201 states and 2038 transitions. Word has length 53 [2025-03-16 20:22:13,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:13,751 INFO L471 AbstractCegarLoop]: Abstraction has 1201 states and 2038 transitions. [2025-03-16 20:22:13,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 3 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:13,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1201 states and 2038 transitions. [2025-03-16 20:22:13,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-16 20:22:13,752 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:13,752 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:22:13,752 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 20:22:13,752 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:13,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:13,753 INFO L85 PathProgramCache]: Analyzing trace with hash 637021683, now seen corresponding path program 1 times [2025-03-16 20:22:13,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:13,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294512324] [2025-03-16 20:22:13,753 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:13,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:13,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:22:13,770 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:22:13,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:13,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:14,760 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:14,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:14,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294512324] [2025-03-16 20:22:14,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294512324] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:14,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1100194819] [2025-03-16 20:22:14,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:14,762 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:14,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:14,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:22:14,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 20:22:14,818 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-16 20:22:14,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-16 20:22:14,850 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:14,850 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:14,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 20:22:14,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:22:15,002 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:15,126 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-16 20:22:15,126 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1100194819] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:15,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:15,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 5, 4] total 18 [2025-03-16 20:22:15,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1345258207] [2025-03-16 20:22:15,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:15,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-16 20:22:15,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:15,127 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-16 20:22:15,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2025-03-16 20:22:15,128 INFO L87 Difference]: Start difference. First operand 1201 states and 2038 transitions. Second operand has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:17,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:17,045 INFO L93 Difference]: Finished difference Result 3410 states and 4968 transitions. [2025-03-16 20:22:17,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 47 states. [2025-03-16 20:22:17,045 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-16 20:22:17,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:17,053 INFO L225 Difference]: With dead ends: 3410 [2025-03-16 20:22:17,053 INFO L226 Difference]: Without dead ends: 2994 [2025-03-16 20:22:17,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 165 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1065 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=701, Invalid=3081, Unknown=0, NotChecked=0, Total=3782 [2025-03-16 20:22:17,058 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 20098 mSDsluCounter, 4719 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20098 SdHoareTripleChecker+Valid, 6210 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:17,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20098 Valid, 6210 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:22:17,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2994 states. [2025-03-16 20:22:17,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2994 to 2848. [2025-03-16 20:22:17,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2848 states, 2846 states have (on average 1.4462403373155306) internal successors, (4116), 2847 states have internal predecessors, (4116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:17,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2848 states to 2848 states and 4116 transitions. [2025-03-16 20:22:17,118 INFO L78 Accepts]: Start accepts. Automaton has 2848 states and 4116 transitions. Word has length 55 [2025-03-16 20:22:17,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:17,118 INFO L471 AbstractCegarLoop]: Abstraction has 2848 states and 4116 transitions. [2025-03-16 20:22:17,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 8.38888888888889) internal successors, (151), 18 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:17,119 INFO L276 IsEmpty]: Start isEmpty. Operand 2848 states and 4116 transitions. [2025-03-16 20:22:17,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 20:22:17,119 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:17,119 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:17,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 20:22:17,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 20:22:17,320 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:17,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:17,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1237352262, now seen corresponding path program 1 times [2025-03-16 20:22:17,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:17,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [655406679] [2025-03-16 20:22:17,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:17,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:17,330 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:22:17,346 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:22:17,346 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:17,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:17,564 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:17,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:17,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [655406679] [2025-03-16 20:22:17,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [655406679] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:17,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [953662111] [2025-03-16 20:22:17,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:17,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:17,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:17,566 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:22:17,568 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 20:22:17,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:22:17,642 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:22:17,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:17,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:17,643 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-03-16 20:22:17,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:18,358 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:18,359 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:19,248 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:19,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [953662111] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:19,248 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:19,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 15, 15] total 36 [2025-03-16 20:22:19,249 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2090445009] [2025-03-16 20:22:19,249 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:19,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2025-03-16 20:22:19,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:19,249 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2025-03-16 20:22:19,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1111, Unknown=0, NotChecked=0, Total=1260 [2025-03-16 20:22:19,250 INFO L87 Difference]: Start difference. First operand 2848 states and 4116 transitions. Second operand has 36 states, 36 states have (on average 4.194444444444445) internal successors, (151), 36 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:21,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:21,562 INFO L93 Difference]: Finished difference Result 6809 states and 9257 transitions. [2025-03-16 20:22:21,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 53 states. [2025-03-16 20:22:21,563 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 4.194444444444445) internal successors, (151), 36 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-16 20:22:21,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:21,573 INFO L225 Difference]: With dead ends: 6809 [2025-03-16 20:22:21,573 INFO L226 Difference]: Without dead ends: 5033 [2025-03-16 20:22:21,577 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 85 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1993 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=1428, Invalid=6054, Unknown=0, NotChecked=0, Total=7482 [2025-03-16 20:22:21,578 INFO L435 NwaCegarLoop]: 1487 mSDtfsCounter, 14257 mSDsluCounter, 16559 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14257 SdHoareTripleChecker+Valid, 18046 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:21,578 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14257 Valid, 18046 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-16 20:22:21,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5033 states. [2025-03-16 20:22:21,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5033 to 3859. [2025-03-16 20:22:21,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3859 states, 3857 states have (on average 1.3876069484054965) internal successors, (5352), 3858 states have internal predecessors, (5352), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:21,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3859 states to 3859 states and 5352 transitions. [2025-03-16 20:22:21,665 INFO L78 Accepts]: Start accepts. Automaton has 3859 states and 5352 transitions. Word has length 56 [2025-03-16 20:22:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:21,666 INFO L471 AbstractCegarLoop]: Abstraction has 3859 states and 5352 transitions. [2025-03-16 20:22:21,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 4.194444444444445) internal successors, (151), 36 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:21,666 INFO L276 IsEmpty]: Start isEmpty. Operand 3859 states and 5352 transitions. [2025-03-16 20:22:21,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2025-03-16 20:22:21,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:21,668 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:22:21,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 20:22:21,868 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 20:22:21,868 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:21,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:21,869 INFO L85 PathProgramCache]: Analyzing trace with hash 1073578251, now seen corresponding path program 1 times [2025-03-16 20:22:21,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:21,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1660006900] [2025-03-16 20:22:21,869 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:21,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:21,875 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:22:21,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:22:21,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:21,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:22,123 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:22,124 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:22,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1660006900] [2025-03-16 20:22:22,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1660006900] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:22,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1274313207] [2025-03-16 20:22:22,124 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:22,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:22,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:22,126 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:22:22,127 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 20:22:22,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 56 statements into 1 equivalence classes. [2025-03-16 20:22:22,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 56 of 56 statements. [2025-03-16 20:22:22,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:22,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:22,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:22:22,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:22,397 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:22,397 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:22,844 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:22,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1274313207] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:22,844 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:22,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-16 20:22:22,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742735175] [2025-03-16 20:22:22,844 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:22,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:22:22,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:22,845 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:22:22,845 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=337, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:22:22,845 INFO L87 Difference]: Start difference. First operand 3859 states and 5352 transitions. Second operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:23,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:23,170 INFO L93 Difference]: Finished difference Result 9071 states and 11938 transitions. [2025-03-16 20:22:23,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 20:22:23,171 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 56 [2025-03-16 20:22:23,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:23,179 INFO L225 Difference]: With dead ends: 9071 [2025-03-16 20:22:23,179 INFO L226 Difference]: Without dead ends: 6403 [2025-03-16 20:22:23,183 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 134 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=220, Invalid=650, Unknown=0, NotChecked=0, Total=870 [2025-03-16 20:22:23,183 INFO L435 NwaCegarLoop]: 1490 mSDtfsCounter, 11974 mSDsluCounter, 4651 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11974 SdHoareTripleChecker+Valid, 6141 SdHoareTripleChecker+Invalid, 296 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:23,183 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11974 Valid, 6141 Invalid, 296 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:22:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6403 states. [2025-03-16 20:22:23,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6403 to 6399. [2025-03-16 20:22:23,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6399 states, 6397 states have (on average 1.3293731436610912) internal successors, (8504), 6398 states have internal predecessors, (8504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6399 states to 6399 states and 8504 transitions. [2025-03-16 20:22:23,309 INFO L78 Accepts]: Start accepts. Automaton has 6399 states and 8504 transitions. Word has length 56 [2025-03-16 20:22:23,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:23,309 INFO L471 AbstractCegarLoop]: Abstraction has 6399 states and 8504 transitions. [2025-03-16 20:22:23,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:23,310 INFO L276 IsEmpty]: Start isEmpty. Operand 6399 states and 8504 transitions. [2025-03-16 20:22:23,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:22:23,310 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:23,310 INFO L218 NwaCegarLoop]: trace histogram [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] [2025-03-16 20:22:23,317 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 20:22:23,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-16 20:22:23,511 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:23,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:23,511 INFO L85 PathProgramCache]: Analyzing trace with hash 486333277, now seen corresponding path program 1 times [2025-03-16 20:22:23,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:23,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241229779] [2025-03-16 20:22:23,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:23,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:23,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:22:23,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:22:23,532 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:23,532 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:23,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:23,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241229779] [2025-03-16 20:22:23,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241229779] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:23,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1118328892] [2025-03-16 20:22:23,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:23,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:23,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:23,768 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:22:23,770 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 20:22:23,816 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:22:23,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:22:23,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:23,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:23,846 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 15 conjuncts are in the unsatisfiable core [2025-03-16 20:22:23,847 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:24,070 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:24,070 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:24,341 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:24,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1118328892] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:24,342 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:24,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 20 [2025-03-16 20:22:24,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974134888] [2025-03-16 20:22:24,342 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:24,342 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 20:22:24,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:24,343 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 20:22:24,343 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=328, Unknown=0, NotChecked=0, Total=420 [2025-03-16 20:22:24,343 INFO L87 Difference]: Start difference. First operand 6399 states and 8504 transitions. Second operand has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:24,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:24,659 INFO L93 Difference]: Finished difference Result 11275 states and 14629 transitions. [2025-03-16 20:22:24,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-16 20:22:24,660 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 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 57 [2025-03-16 20:22:24,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:24,671 INFO L225 Difference]: With dead ends: 11275 [2025-03-16 20:22:24,671 INFO L226 Difference]: Without dead ends: 6403 [2025-03-16 20:22:24,676 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=215, Invalid=597, Unknown=0, NotChecked=0, Total=812 [2025-03-16 20:22:24,677 INFO L435 NwaCegarLoop]: 1497 mSDtfsCounter, 10369 mSDsluCounter, 3202 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10369 SdHoareTripleChecker+Valid, 4699 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:24,677 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10369 Valid, 4699 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 20:22:24,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6403 states. [2025-03-16 20:22:24,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6403 to 6399. [2025-03-16 20:22:24,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6399 states, 6397 states have (on average 1.3159293418790057) internal successors, (8418), 6398 states have internal predecessors, (8418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:24,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6399 states to 6399 states and 8418 transitions. [2025-03-16 20:22:24,801 INFO L78 Accepts]: Start accepts. Automaton has 6399 states and 8418 transitions. Word has length 57 [2025-03-16 20:22:24,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:24,801 INFO L471 AbstractCegarLoop]: Abstraction has 6399 states and 8418 transitions. [2025-03-16 20:22:24,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.714285714285714) internal successors, (120), 20 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:24,801 INFO L276 IsEmpty]: Start isEmpty. Operand 6399 states and 8418 transitions. [2025-03-16 20:22:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-03-16 20:22:24,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:24,802 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:24,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 20:22:25,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:25,008 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:25,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:25,008 INFO L85 PathProgramCache]: Analyzing trace with hash 155340792, now seen corresponding path program 1 times [2025-03-16 20:22:25,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:25,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522802603] [2025-03-16 20:22:25,008 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:25,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:25,014 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:22:25,041 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:22:25,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:25,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:25,965 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:25,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:25,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522802603] [2025-03-16 20:22:25,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522802603] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:25,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [253919502] [2025-03-16 20:22:25,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:25,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:25,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:25,968 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:22:25,968 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 20:22:26,012 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-03-16 20:22:26,049 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-03-16 20:22:26,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:26,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:26,051 INFO L256 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-16 20:22:26,052 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:26,739 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:26,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:27,651 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:27,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [253919502] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:27,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:27,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 17, 17] total 51 [2025-03-16 20:22:27,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593772270] [2025-03-16 20:22:27,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:27,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-03-16 20:22:27,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:27,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-03-16 20:22:27,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2333, Unknown=0, NotChecked=0, Total=2550 [2025-03-16 20:22:27,653 INFO L87 Difference]: Start difference. First operand 6399 states and 8418 transitions. Second operand has 51 states, 51 states have (on average 3.0784313725490198) internal successors, (157), 51 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:40,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:40,671 INFO L93 Difference]: Finished difference Result 16337 states and 20810 transitions. [2025-03-16 20:22:40,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 101 states. [2025-03-16 20:22:40,671 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 51 states have (on average 3.0784313725490198) internal successors, (157), 51 states have internal predecessors, (157), 0 states have call successors, (0), 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 57 [2025-03-16 20:22:40,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:40,688 INFO L225 Difference]: With dead ends: 16337 [2025-03-16 20:22:40,688 INFO L226 Difference]: Without dead ends: 12959 [2025-03-16 20:22:40,694 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 232 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 147 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6489 ImplicationChecksByTransitivity, 12.3s TimeCoverageRelationStatistics Valid=4682, Invalid=17370, Unknown=0, NotChecked=0, Total=22052 [2025-03-16 20:22:40,695 INFO L435 NwaCegarLoop]: 1543 mSDtfsCounter, 22630 mSDsluCounter, 23881 mSDsCounter, 0 mSdLazyCounter, 2524 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22630 SdHoareTripleChecker+Valid, 25424 SdHoareTripleChecker+Invalid, 2634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 2524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:40,695 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22630 Valid, 25424 Invalid, 2634 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [110 Valid, 2524 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 20:22:40,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12959 states. [2025-03-16 20:22:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12959 to 6351. [2025-03-16 20:22:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6351 states, 6349 states have (on average 1.3146952275948969) internal successors, (8347), 6350 states have internal predecessors, (8347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:40,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6351 states to 6351 states and 8347 transitions. [2025-03-16 20:22:40,980 INFO L78 Accepts]: Start accepts. Automaton has 6351 states and 8347 transitions. Word has length 57 [2025-03-16 20:22:40,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:40,980 INFO L471 AbstractCegarLoop]: Abstraction has 6351 states and 8347 transitions. [2025-03-16 20:22:40,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 51 states have (on average 3.0784313725490198) internal successors, (157), 51 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:40,980 INFO L276 IsEmpty]: Start isEmpty. Operand 6351 states and 8347 transitions. [2025-03-16 20:22:40,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:22:40,981 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:40,981 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:40,992 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 20:22:41,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:41,183 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:41,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:41,184 INFO L85 PathProgramCache]: Analyzing trace with hash 304815382, now seen corresponding path program 1 times [2025-03-16 20:22:41,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:41,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910883087] [2025-03-16 20:22:41,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:41,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:41,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:22:41,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:22:41,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:41,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:41,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:41,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910883087] [2025-03-16 20:22:41,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910883087] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 20:22:41,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 20:22:41,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 20:22:41,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843882887] [2025-03-16 20:22:41,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 20:22:41,252 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 20:22:41,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:41,253 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 20:22:41,253 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 20:22:41,253 INFO L87 Difference]: Start difference. First operand 6351 states and 8347 transitions. Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:45,548 INFO L93 Difference]: Finished difference Result 8606 states and 12656 transitions. [2025-03-16 20:22:45,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 20:22:45,549 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 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 59 [2025-03-16 20:22:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:45,557 INFO L225 Difference]: With dead ends: 8606 [2025-03-16 20:22:45,557 INFO L226 Difference]: Without dead ends: 7853 [2025-03-16 20:22:45,558 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-03-16 20:22:45,558 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 2314 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 5518 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2314 SdHoareTripleChecker+Valid, 777 SdHoareTripleChecker+Invalid, 6618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 5518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:45,559 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2314 Valid, 777 Invalid, 6618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 5518 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2025-03-16 20:22:45,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7853 states. [2025-03-16 20:22:45,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7853 to 7853. [2025-03-16 20:22:45,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7853 states, 7851 states have (on average 1.3339701948796332) internal successors, (10473), 7852 states have internal predecessors, (10473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:45,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7853 states to 7853 states and 10473 transitions. [2025-03-16 20:22:45,776 INFO L78 Accepts]: Start accepts. Automaton has 7853 states and 10473 transitions. Word has length 59 [2025-03-16 20:22:45,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:45,776 INFO L471 AbstractCegarLoop]: Abstraction has 7853 states and 10473 transitions. [2025-03-16 20:22:45,776 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 3 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 7853 states and 10473 transitions. [2025-03-16 20:22:45,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-03-16 20:22:45,777 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:45,777 INFO L218 NwaCegarLoop]: trace histogram [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-03-16 20:22:45,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 20:22:45,777 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:45,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:45,778 INFO L85 PathProgramCache]: Analyzing trace with hash -16391815, now seen corresponding path program 1 times [2025-03-16 20:22:45,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:45,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811039185] [2025-03-16 20:22:45,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:45,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:45,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:22:45,820 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:22:45,820 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:45,820 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:46,239 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:46,239 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:46,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811039185] [2025-03-16 20:22:46,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811039185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:46,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [462013569] [2025-03-16 20:22:46,240 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:46,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:46,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:46,242 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:22:46,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 20:22:46,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 59 statements into 1 equivalence classes. [2025-03-16 20:22:46,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 59 of 59 statements. [2025-03-16 20:22:46,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:46,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:46,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-16 20:22:46,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:46,758 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:46,758 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:47,584 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:47,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [462013569] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:47,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:47,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 35 [2025-03-16 20:22:47,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293130537] [2025-03-16 20:22:47,585 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:47,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-16 20:22:47,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:47,586 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-16 20:22:47,586 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1047, Unknown=0, NotChecked=0, Total=1190 [2025-03-16 20:22:47,586 INFO L87 Difference]: Start difference. First operand 7853 states and 10473 transitions. Second operand has 35 states, 35 states have (on average 3.914285714285714) internal successors, (137), 35 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:48,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:22:48,986 INFO L93 Difference]: Finished difference Result 13837 states and 18017 transitions. [2025-03-16 20:22:48,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-16 20:22:48,987 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 35 states have (on average 3.914285714285714) internal successors, (137), 35 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 59 [2025-03-16 20:22:48,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:22:48,996 INFO L225 Difference]: With dead ends: 13837 [2025-03-16 20:22:48,996 INFO L226 Difference]: Without dead ends: 10331 [2025-03-16 20:22:49,000 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 661 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=630, Invalid=2676, Unknown=0, NotChecked=0, Total=3306 [2025-03-16 20:22:49,011 INFO L435 NwaCegarLoop]: 1491 mSDtfsCounter, 16732 mSDsluCounter, 13376 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16732 SdHoareTripleChecker+Valid, 14867 SdHoareTripleChecker+Invalid, 476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 20:22:49,012 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16732 Valid, 14867 Invalid, 476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 20:22:49,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10331 states. [2025-03-16 20:22:49,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10331 to 5994. [2025-03-16 20:22:49,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5994 states, 5992 states have (on average 1.365320427236315) internal successors, (8181), 5993 states have internal predecessors, (8181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:49,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5994 states to 5994 states and 8181 transitions. [2025-03-16 20:22:49,224 INFO L78 Accepts]: Start accepts. Automaton has 5994 states and 8181 transitions. Word has length 59 [2025-03-16 20:22:49,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:22:49,224 INFO L471 AbstractCegarLoop]: Abstraction has 5994 states and 8181 transitions. [2025-03-16 20:22:49,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 3.914285714285714) internal successors, (137), 35 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:22:49,224 INFO L276 IsEmpty]: Start isEmpty. Operand 5994 states and 8181 transitions. [2025-03-16 20:22:49,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2025-03-16 20:22:49,225 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:22:49,226 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1] [2025-03-16 20:22:49,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-16 20:22:49,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:49,426 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:22:49,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:22:49,427 INFO L85 PathProgramCache]: Analyzing trace with hash -1179533217, now seen corresponding path program 1 times [2025-03-16 20:22:49,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:22:49,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1260119308] [2025-03-16 20:22:49,427 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:49,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:22:49,435 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:22:49,449 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:22:49,449 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:49,449 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:49,879 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 13 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:49,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:22:49,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1260119308] [2025-03-16 20:22:49,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1260119308] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:22:49,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [786848094] [2025-03-16 20:22:49,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:22:49,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:22:49,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:22:49,882 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:22:49,884 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 20:22:49,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 93 statements into 1 equivalence classes. [2025-03-16 20:22:49,980 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 93 of 93 statements. [2025-03-16 20:22:49,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:22:49,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:22:49,988 INFO L256 TraceCheckSpWp]: Trace formula consists of 427 conjuncts, 61 conjuncts are in the unsatisfiable core [2025-03-16 20:22:49,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:22:52,129 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 30 proven. 50 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:52,129 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:22:56,834 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 13 proven. 67 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:22:56,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [786848094] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:22:56,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:22:56,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 25, 29] total 61 [2025-03-16 20:22:56,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [52993680] [2025-03-16 20:22:56,835 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:22:56,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2025-03-16 20:22:56,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:22:56,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2025-03-16 20:22:56,838 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=515, Invalid=3145, Unknown=0, NotChecked=0, Total=3660 [2025-03-16 20:22:56,838 INFO L87 Difference]: Start difference. First operand 5994 states and 8181 transitions. Second operand has 61 states, 61 states have (on average 4.262295081967213) internal successors, (260), 61 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:08,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 20:23:08,197 INFO L93 Difference]: Finished difference Result 9882 states and 13004 transitions. [2025-03-16 20:23:08,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 122 states. [2025-03-16 20:23:08,197 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 4.262295081967213) internal successors, (260), 61 states have internal predecessors, (260), 0 states have call successors, (0), 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 93 [2025-03-16 20:23:08,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 20:23:08,203 INFO L225 Difference]: With dead ends: 9882 [2025-03-16 20:23:08,203 INFO L226 Difference]: Without dead ends: 7653 [2025-03-16 20:23:08,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 318 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 179 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9725 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=5461, Invalid=27119, Unknown=0, NotChecked=0, Total=32580 [2025-03-16 20:23:08,211 INFO L435 NwaCegarLoop]: 1574 mSDtfsCounter, 33266 mSDsluCounter, 28413 mSDsCounter, 0 mSdLazyCounter, 2841 mSolverCounterSat, 252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33266 SdHoareTripleChecker+Valid, 29987 SdHoareTripleChecker+Invalid, 3093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 252 IncrementalHoareTripleChecker+Valid, 2841 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 20:23:08,214 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33266 Valid, 29987 Invalid, 3093 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [252 Valid, 2841 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 20:23:08,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7653 states. [2025-03-16 20:23:08,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7653 to 5857. [2025-03-16 20:23:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5857 states, 5855 states have (on average 1.359863364645602) internal successors, (7962), 5856 states have internal predecessors, (7962), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:08,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5857 states to 5857 states and 7962 transitions. [2025-03-16 20:23:08,497 INFO L78 Accepts]: Start accepts. Automaton has 5857 states and 7962 transitions. Word has length 93 [2025-03-16 20:23:08,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 20:23:08,497 INFO L471 AbstractCegarLoop]: Abstraction has 5857 states and 7962 transitions. [2025-03-16 20:23:08,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 4.262295081967213) internal successors, (260), 61 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 20:23:08,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5857 states and 7962 transitions. [2025-03-16 20:23:08,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-16 20:23:08,498 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 20:23:08,499 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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] [2025-03-16 20:23:08,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 20:23:08,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:08,699 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 20:23:08,700 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 20:23:08,700 INFO L85 PathProgramCache]: Analyzing trace with hash -361294049, now seen corresponding path program 1 times [2025-03-16 20:23:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 20:23:08,700 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2098307828] [2025-03-16 20:23:08,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:08,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 20:23:08,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:23:08,734 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:23:08,734 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:08,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 13 proven. 68 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:10,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 20:23:10,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2098307828] [2025-03-16 20:23:10,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2098307828] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 20:23:10,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [138437184] [2025-03-16 20:23:10,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 20:23:10,184 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 20:23:10,184 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 20:23:10,186 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 20:23:10,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 20:23:10,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 94 statements into 1 equivalence classes. [2025-03-16 20:23:10,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 94 of 94 statements. [2025-03-16 20:23:10,292 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 20:23:10,292 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 20:23:10,293 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-16 20:23:10,295 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 20:23:12,088 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:12,089 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 20:23:14,449 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 22 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 20:23:14,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [138437184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 20:23:14,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 20:23:14,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 18, 18] total 58 [2025-03-16 20:23:14,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392337673] [2025-03-16 20:23:14,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 20:23:14,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-03-16 20:23:14,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 20:23:14,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-03-16 20:23:14,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=229, Invalid=3077, Unknown=0, NotChecked=0, Total=3306 [2025-03-16 20:23:14,451 INFO L87 Difference]: Start difference. First operand 5857 states and 7962 transitions. Second operand has 58 states, 58 states have (on average 4.5344827586206895) internal successors, (263), 58 states have internal predecessors, (263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)