./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label17.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/eca-rers2012/Problem17_label17.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 ae22f3f06aabed24b98a90f87729aaa6479f5932deb24c738c216ff13229105f --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:17:27,959 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:17:28,014 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:17:28,021 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:17:28,021 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:17:28,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:17:28,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:17:28,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:17:28,035 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:17:28,035 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:17:28,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:17:28,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:17:28,036 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:17:28,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:17:28,036 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:17:28,036 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:17:28,037 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:17:28,037 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:17:28,037 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 -> ae22f3f06aabed24b98a90f87729aaa6479f5932deb24c738c216ff13229105f [2025-03-16 15:17:28,264 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:17:28,270 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:17:28,271 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:17:28,273 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:17:28,273 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:17:28,275 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label17.c [2025-03-16 15:17:29,377 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c00d3ad3/ad691fd0eeeb496dbed79cbe3123b193/FLAG817391716 [2025-03-16 15:17:29,700 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:17:29,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label17.c [2025-03-16 15:17:29,721 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c00d3ad3/ad691fd0eeeb496dbed79cbe3123b193/FLAG817391716 [2025-03-16 15:17:29,938 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c00d3ad3/ad691fd0eeeb496dbed79cbe3123b193 [2025-03-16 15:17:29,940 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:17:29,941 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:17:29,942 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:17:29,942 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:17:29,945 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:17:29,946 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:17:29" (1/1) ... [2025-03-16 15:17:29,946 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e094c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:29, skipping insertion in model container [2025-03-16 15:17:29,946 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:17:29" (1/1) ... [2025-03-16 15:17:30,004 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:17:30,143 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/eca-rers2012/Problem17_label17.c[5781,5794] [2025-03-16 15:17:30,451 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:17:30,460 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:17:30,494 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/eca-rers2012/Problem17_label17.c[5781,5794] [2025-03-16 15:17:30,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:17:30,670 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:17:30,671 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30 WrapperNode [2025-03-16 15:17:30,672 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:17:30,672 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:17:30,672 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:17:30,673 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:17:30,676 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (1/1) ... [2025-03-16 15:17:30,704 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (1/1) ... [2025-03-16 15:17:30,875 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-16 15:17:30,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:17:30,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:17:30,876 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:17:30,876 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:17:30,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (1/1) ... [2025-03-16 15:17:30,884 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (1/1) ... [2025-03-16 15:17:30,954 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (1/1) ... [2025-03-16 15:17:31,069 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 15:17:31,070 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (1/1) ... [2025-03-16 15:17:31,070 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (1/1) ... [2025-03-16 15:17:31,145 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (1/1) ... [2025-03-16 15:17:31,162 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (1/1) ... [2025-03-16 15:17:31,182 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (1/1) ... [2025-03-16 15:17:31,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (1/1) ... [2025-03-16 15:17:31,223 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:17:31,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:17:31,225 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:17:31,225 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:17:31,226 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (1/1) ... [2025-03-16 15:17:31,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:17:31,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:31,254 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 15:17:31,257 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 15:17:31,273 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:17:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:17:31,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:17:31,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:17:31,315 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:17:31,316 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:17:33,604 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-16 15:17:33,727 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-16 15:17:33,727 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:17:33,754 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:17:33,755 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:17:33,755 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:17:33 BoogieIcfgContainer [2025-03-16 15:17:33,755 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:17:33,756 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:17:33,757 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:17:33,763 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:17:33,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:17:29" (1/3) ... [2025-03-16 15:17:33,763 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b5818c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:17:33, skipping insertion in model container [2025-03-16 15:17:33,763 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:17:30" (2/3) ... [2025-03-16 15:17:33,764 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36b5818c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:17:33, skipping insertion in model container [2025-03-16 15:17:33,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:17:33" (3/3) ... [2025-03-16 15:17:33,765 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label17.c [2025-03-16 15:17:33,777 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:17:33,778 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label17.c that has 1 procedures, 529 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:17:33,836 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:17:33,846 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;@7b3b4a89, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:17:33,846 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:17:33,851 INFO L276 IsEmpty]: Start isEmpty. Operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 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 15:17:33,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 15:17:33,856 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:33,857 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] [2025-03-16 15:17:33,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:33,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:33,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1031390001, now seen corresponding path program 1 times [2025-03-16 15:17:33,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:33,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470136410] [2025-03-16 15:17:33,867 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:33,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:33,910 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 15:17:33,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 15:17:33,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:33,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:33,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 15:17:33,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:33,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470136410] [2025-03-16 15:17:33,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470136410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:33,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:33,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:17:33,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110404985] [2025-03-16 15:17:33,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:33,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:17:33,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:33,978 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:17:33,978 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:17:33,980 INFO L87 Difference]: Start difference. First operand has 529 states, 527 states have (on average 1.8975332068311195) internal successors, (1000), 528 states have internal predecessors, (1000), 0 states have call successors, (0), 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 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 15:17:34,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:34,027 INFO L93 Difference]: Finished difference Result 1057 states and 1999 transitions. [2025-03-16 15:17:34,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:17:34,029 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-16 15:17:34,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:34,036 INFO L225 Difference]: With dead ends: 1057 [2025-03-16 15:17:34,036 INFO L226 Difference]: Without dead ends: 526 [2025-03-16 15:17:34,039 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 15:17:34,041 INFO L435 NwaCegarLoop]: 938 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, 938 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 15:17:34,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 938 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:17:34,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 526 states. [2025-03-16 15:17:34,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 526 to 526. [2025-03-16 15:17:34,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 525 states have (on average 1.7809523809523808) internal successors, (935), 525 states have internal predecessors, (935), 0 states have call successors, (0), 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 15:17:34,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 935 transitions. [2025-03-16 15:17:34,079 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 935 transitions. Word has length 37 [2025-03-16 15:17:34,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:34,079 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 935 transitions. [2025-03-16 15:17:34,079 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 18.5) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 15:17:34,080 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 935 transitions. [2025-03-16 15:17:34,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 15:17:34,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:34,080 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] [2025-03-16 15:17:34,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:17:34,080 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:34,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:34,081 INFO L85 PathProgramCache]: Analyzing trace with hash -348841291, now seen corresponding path program 1 times [2025-03-16 15:17:34,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:34,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085219047] [2025-03-16 15:17:34,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:34,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:34,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 37 statements into 1 equivalence classes. [2025-03-16 15:17:34,106 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 15:17:34,106 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:34,106 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:34,220 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 15:17:34,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:34,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085219047] [2025-03-16 15:17:34,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2085219047] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:34,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:34,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:17:34,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809359604] [2025-03-16 15:17:34,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:34,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:34,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:34,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:34,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:34,223 INFO L87 Difference]: Start difference. First operand 526 states and 935 transitions. Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 15:17:35,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:35,960 INFO L93 Difference]: Finished difference Result 1501 states and 2698 transitions. [2025-03-16 15:17:35,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:35,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 37 [2025-03-16 15:17:35,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:35,963 INFO L225 Difference]: With dead ends: 1501 [2025-03-16 15:17:35,963 INFO L226 Difference]: Without dead ends: 976 [2025-03-16 15:17:35,964 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:35,965 INFO L435 NwaCegarLoop]: 374 mSDtfsCounter, 434 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1397 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 1397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:35,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 449 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 1397 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:17:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2025-03-16 15:17:35,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 970. [2025-03-16 15:17:35,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 969 states have (on average 1.5541795665634675) internal successors, (1506), 969 states have internal predecessors, (1506), 0 states have call successors, (0), 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 15:17:35,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1506 transitions. [2025-03-16 15:17:35,996 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1506 transitions. Word has length 37 [2025-03-16 15:17:35,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:35,996 INFO L471 AbstractCegarLoop]: Abstraction has 970 states and 1506 transitions. [2025-03-16 15:17:35,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 2 states have internal predecessors, (37), 0 states have call successors, (0), 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 15:17:35,996 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1506 transitions. [2025-03-16 15:17:35,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2025-03-16 15:17:35,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:35,998 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 15:17:35,998 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:17:35,998 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:35,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:35,999 INFO L85 PathProgramCache]: Analyzing trace with hash 209922411, now seen corresponding path program 1 times [2025-03-16 15:17:35,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:35,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524125748] [2025-03-16 15:17:35,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:35,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:36,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 104 statements into 1 equivalence classes. [2025-03-16 15:17:36,052 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 104 of 104 statements. [2025-03-16 15:17:36,053 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:36,053 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:36,202 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:17:36,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:36,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524125748] [2025-03-16 15:17:36,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524125748] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:36,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:36,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:17:36,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112874520] [2025-03-16 15:17:36,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:36,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:36,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:36,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:36,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:36,203 INFO L87 Difference]: Start difference. First operand 970 states and 1506 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 15:17:38,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:38,000 INFO L93 Difference]: Finished difference Result 2812 states and 4380 transitions. [2025-03-16 15:17:38,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:38,002 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 104 [2025-03-16 15:17:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:38,008 INFO L225 Difference]: With dead ends: 2812 [2025-03-16 15:17:38,008 INFO L226 Difference]: Without dead ends: 1843 [2025-03-16 15:17:38,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:38,013 INFO L435 NwaCegarLoop]: 506 mSDtfsCounter, 405 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1381 mSolverCounterSat, 325 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 325 IncrementalHoareTripleChecker+Valid, 1381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:38,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 579 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [325 Valid, 1381 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:17:38,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1843 states. [2025-03-16 15:17:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1843 to 1840. [2025-03-16 15:17:38,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1840 states, 1839 states have (on average 1.3501903208265362) internal successors, (2483), 1839 states have internal predecessors, (2483), 0 states have call successors, (0), 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 15:17:38,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1840 states to 1840 states and 2483 transitions. [2025-03-16 15:17:38,055 INFO L78 Accepts]: Start accepts. Automaton has 1840 states and 2483 transitions. Word has length 104 [2025-03-16 15:17:38,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:38,057 INFO L471 AbstractCegarLoop]: Abstraction has 1840 states and 2483 transitions. [2025-03-16 15:17:38,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 2 states have internal predecessors, (104), 0 states have call successors, (0), 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 15:17:38,057 INFO L276 IsEmpty]: Start isEmpty. Operand 1840 states and 2483 transitions. [2025-03-16 15:17:38,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2025-03-16 15:17:38,061 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:38,061 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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 15:17:38,061 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:17:38,061 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:38,062 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:38,062 INFO L85 PathProgramCache]: Analyzing trace with hash 1583671707, now seen corresponding path program 1 times [2025-03-16 15:17:38,062 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:38,062 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128475608] [2025-03-16 15:17:38,063 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:38,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:38,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 107 statements into 1 equivalence classes. [2025-03-16 15:17:38,117 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 107 of 107 statements. [2025-03-16 15:17:38,118 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:38,118 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:17:38,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:38,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128475608] [2025-03-16 15:17:38,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128475608] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:38,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:38,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:38,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503879037] [2025-03-16 15:17:38,397 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:38,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:38,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:38,397 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:38,397 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:17:38,398 INFO L87 Difference]: Start difference. First operand 1840 states and 2483 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 15:17:40,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:40,993 INFO L93 Difference]: Finished difference Result 6764 states and 9257 transitions. [2025-03-16 15:17:40,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:40,994 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 107 [2025-03-16 15:17:40,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:41,008 INFO L225 Difference]: With dead ends: 6764 [2025-03-16 15:17:41,008 INFO L226 Difference]: Without dead ends: 4925 [2025-03-16 15:17:41,011 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:17:41,014 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 874 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 2789 mSolverCounterSat, 594 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 874 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 3383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 594 IncrementalHoareTripleChecker+Valid, 2789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:41,015 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [874 Valid, 326 Invalid, 3383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [594 Valid, 2789 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 15:17:41,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4925 states. [2025-03-16 15:17:41,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4925 to 4874. [2025-03-16 15:17:41,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4874 states, 4873 states have (on average 1.286476503180792) internal successors, (6269), 4873 states have internal predecessors, (6269), 0 states have call successors, (0), 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 15:17:41,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4874 states to 4874 states and 6269 transitions. [2025-03-16 15:17:41,090 INFO L78 Accepts]: Start accepts. Automaton has 4874 states and 6269 transitions. Word has length 107 [2025-03-16 15:17:41,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:41,092 INFO L471 AbstractCegarLoop]: Abstraction has 4874 states and 6269 transitions. [2025-03-16 15:17:41,092 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 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 15:17:41,092 INFO L276 IsEmpty]: Start isEmpty. Operand 4874 states and 6269 transitions. [2025-03-16 15:17:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2025-03-16 15:17:41,096 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:41,097 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:41,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:17:41,097 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:41,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:41,098 INFO L85 PathProgramCache]: Analyzing trace with hash 1559593979, now seen corresponding path program 1 times [2025-03-16 15:17:41,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:41,098 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905446613] [2025-03-16 15:17:41,098 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:41,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:41,123 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 178 statements into 1 equivalence classes. [2025-03-16 15:17:41,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 178 of 178 statements. [2025-03-16 15:17:41,136 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:41,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:41,300 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-03-16 15:17:41,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:41,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905446613] [2025-03-16 15:17:41,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905446613] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:41,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:41,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:17:41,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146295205] [2025-03-16 15:17:41,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:41,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:41,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:41,302 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:41,302 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:41,303 INFO L87 Difference]: Start difference. First operand 4874 states and 6269 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:42,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:42,599 INFO L93 Difference]: Finished difference Result 14435 states and 18540 transitions. [2025-03-16 15:17:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:42,599 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 178 [2025-03-16 15:17:42,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:42,618 INFO L225 Difference]: With dead ends: 14435 [2025-03-16 15:17:42,618 INFO L226 Difference]: Without dead ends: 8276 [2025-03-16 15:17:42,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:42,625 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 386 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 588 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:42,625 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 588 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:17:42,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8276 states. [2025-03-16 15:17:42,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8276 to 6146. [2025-03-16 15:17:42,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6146 states, 6145 states have (on average 1.1907241659886085) internal successors, (7317), 6145 states have internal predecessors, (7317), 0 states have call successors, (0), 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 15:17:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6146 states to 6146 states and 7317 transitions. [2025-03-16 15:17:42,713 INFO L78 Accepts]: Start accepts. Automaton has 6146 states and 7317 transitions. Word has length 178 [2025-03-16 15:17:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:42,713 INFO L471 AbstractCegarLoop]: Abstraction has 6146 states and 7317 transitions. [2025-03-16 15:17:42,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 2 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:17:42,714 INFO L276 IsEmpty]: Start isEmpty. Operand 6146 states and 7317 transitions. [2025-03-16 15:17:42,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-03-16 15:17:42,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:42,717 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:42,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 15:17:42,718 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:42,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:42,718 INFO L85 PathProgramCache]: Analyzing trace with hash -773277771, now seen corresponding path program 1 times [2025-03-16 15:17:42,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:42,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1340552797] [2025-03-16 15:17:42,718 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:42,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:42,739 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-03-16 15:17:42,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-03-16 15:17:42,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:42,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:42,856 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 71 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-16 15:17:42,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:42,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1340552797] [2025-03-16 15:17:42,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1340552797] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:42,857 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:42,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:42,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819696348] [2025-03-16 15:17:42,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:42,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:42,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:42,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:42,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:42,858 INFO L87 Difference]: Start difference. First operand 6146 states and 7317 transitions. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 15:17:44,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:44,261 INFO L93 Difference]: Finished difference Result 15691 states and 18896 transitions. [2025-03-16 15:17:44,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:44,262 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 191 [2025-03-16 15:17:44,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:44,281 INFO L225 Difference]: With dead ends: 15691 [2025-03-16 15:17:44,281 INFO L226 Difference]: Without dead ends: 9546 [2025-03-16 15:17:44,287 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 15:17:44,287 INFO L435 NwaCegarLoop]: 412 mSDtfsCounter, 421 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1274 mSolverCounterSat, 318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 318 IncrementalHoareTripleChecker+Valid, 1274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:44,287 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 476 Invalid, 1592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [318 Valid, 1274 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:17:44,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9546 states. [2025-03-16 15:17:44,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9546 to 6123. [2025-03-16 15:17:44,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6123 states, 6122 states have (on average 1.1894805619078732) internal successors, (7282), 6122 states have internal predecessors, (7282), 0 states have call successors, (0), 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 15:17:44,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6123 states to 6123 states and 7282 transitions. [2025-03-16 15:17:44,381 INFO L78 Accepts]: Start accepts. Automaton has 6123 states and 7282 transitions. Word has length 191 [2025-03-16 15:17:44,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:44,382 INFO L471 AbstractCegarLoop]: Abstraction has 6123 states and 7282 transitions. [2025-03-16 15:17:44,382 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 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 15:17:44,382 INFO L276 IsEmpty]: Start isEmpty. Operand 6123 states and 7282 transitions. [2025-03-16 15:17:44,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-03-16 15:17:44,384 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:44,384 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:44,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:17:44,384 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:44,384 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:44,385 INFO L85 PathProgramCache]: Analyzing trace with hash 2009727509, now seen corresponding path program 1 times [2025-03-16 15:17:44,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:44,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445109690] [2025-03-16 15:17:44,385 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:44,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:44,399 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-03-16 15:17:44,411 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-03-16 15:17:44,411 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:44,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:44,558 INFO L134 CoverageAnalysis]: Checked inductivity of 146 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:17:44,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:44,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445109690] [2025-03-16 15:17:44,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445109690] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:44,559 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:44,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:44,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981971956] [2025-03-16 15:17:44,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:44,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:44,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:44,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:44,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:44,560 INFO L87 Difference]: Start difference. First operand 6123 states and 7282 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 15:17:45,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:45,842 INFO L93 Difference]: Finished difference Result 16077 states and 19443 transitions. [2025-03-16 15:17:45,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:45,843 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 198 [2025-03-16 15:17:45,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:45,865 INFO L225 Difference]: With dead ends: 16077 [2025-03-16 15:17:45,866 INFO L226 Difference]: Without dead ends: 9955 [2025-03-16 15:17:45,872 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 15:17:45,873 INFO L435 NwaCegarLoop]: 733 mSDtfsCounter, 487 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1224 mSolverCounterSat, 320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 1544 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 320 IncrementalHoareTripleChecker+Valid, 1224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:45,874 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 786 Invalid, 1544 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [320 Valid, 1224 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:17:45,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9955 states. [2025-03-16 15:17:45,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9955 to 9955. [2025-03-16 15:17:45,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9955 states, 9954 states have (on average 1.1716897729555957) internal successors, (11663), 9954 states have internal predecessors, (11663), 0 states have call successors, (0), 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 15:17:45,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9955 states to 9955 states and 11663 transitions. [2025-03-16 15:17:45,995 INFO L78 Accepts]: Start accepts. Automaton has 9955 states and 11663 transitions. Word has length 198 [2025-03-16 15:17:45,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:45,995 INFO L471 AbstractCegarLoop]: Abstraction has 9955 states and 11663 transitions. [2025-03-16 15:17:45,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 3 states have internal predecessors, (198), 0 states have call successors, (0), 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 15:17:45,996 INFO L276 IsEmpty]: Start isEmpty. Operand 9955 states and 11663 transitions. [2025-03-16 15:17:45,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2025-03-16 15:17:45,998 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:45,999 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:45,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:17:45,999 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:45,999 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:45,999 INFO L85 PathProgramCache]: Analyzing trace with hash -406403429, now seen corresponding path program 1 times [2025-03-16 15:17:45,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:45,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265091701] [2025-03-16 15:17:45,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:45,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:46,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 15:17:46,051 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 15:17:46,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:46,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:46,287 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 210 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 15:17:46,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:46,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265091701] [2025-03-16 15:17:46,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265091701] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:46,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1632221256] [2025-03-16 15:17:46,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:46,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:46,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:46,289 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 15:17:46,291 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 15:17:46,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 261 statements into 1 equivalence classes. [2025-03-16 15:17:46,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 261 of 261 statements. [2025-03-16 15:17:46,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:46,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:46,417 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:17:46,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 210 proven. 70 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 15:17:46,607 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:17:46,834 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 280 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 15:17:46,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1632221256] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:46,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:17:46,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-16 15:17:46,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1227591426] [2025-03-16 15:17:46,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:46,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:46,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:46,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:46,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:17:46,836 INFO L87 Difference]: Start difference. First operand 9955 states and 11663 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 15:17:49,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:49,166 INFO L93 Difference]: Finished difference Result 30574 states and 36166 transitions. [2025-03-16 15:17:49,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:49,168 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 261 [2025-03-16 15:17:49,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:49,199 INFO L225 Difference]: With dead ends: 30574 [2025-03-16 15:17:49,199 INFO L226 Difference]: Without dead ends: 19762 [2025-03-16 15:17:49,210 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 523 GetRequests, 519 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:17:49,211 INFO L435 NwaCegarLoop]: 83 mSDtfsCounter, 1071 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 2242 mSolverCounterSat, 1228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1071 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 3470 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1228 IncrementalHoareTripleChecker+Valid, 2242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:49,211 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1071 Valid, 144 Invalid, 3470 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1228 Valid, 2242 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:17:49,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19762 states. [2025-03-16 15:17:49,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19762 to 19759. [2025-03-16 15:17:49,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19759 states, 19758 states have (on average 1.1599858285251543) internal successors, (22919), 19758 states have internal predecessors, (22919), 0 states have call successors, (0), 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 15:17:49,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19759 states to 19759 states and 22919 transitions. [2025-03-16 15:17:49,432 INFO L78 Accepts]: Start accepts. Automaton has 19759 states and 22919 transitions. Word has length 261 [2025-03-16 15:17:49,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:49,433 INFO L471 AbstractCegarLoop]: Abstraction has 19759 states and 22919 transitions. [2025-03-16 15:17:49,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 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 15:17:49,434 INFO L276 IsEmpty]: Start isEmpty. Operand 19759 states and 22919 transitions. [2025-03-16 15:17:49,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-03-16 15:17:49,436 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:49,437 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:49,444 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 15:17:49,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:49,638 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:49,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1799419705, now seen corresponding path program 1 times [2025-03-16 15:17:49,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:49,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655418765] [2025-03-16 15:17:49,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:49,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:49,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-03-16 15:17:49,670 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-03-16 15:17:49,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:49,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:49,773 INFO L134 CoverageAnalysis]: Checked inductivity of 331 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-16 15:17:49,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:49,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655418765] [2025-03-16 15:17:49,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655418765] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:49,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:49,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:49,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966530582] [2025-03-16 15:17:49,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:49,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:49,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:49,774 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:49,774 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:49,774 INFO L87 Difference]: Start difference. First operand 19759 states and 22919 transitions. Second operand has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 15:17:51,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:51,088 INFO L93 Difference]: Finished difference Result 42908 states and 49988 transitions. [2025-03-16 15:17:51,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:51,088 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 274 [2025-03-16 15:17:51,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:51,124 INFO L225 Difference]: With dead ends: 42908 [2025-03-16 15:17:51,124 INFO L226 Difference]: Without dead ends: 22724 [2025-03-16 15:17:51,142 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 15:17:51,143 INFO L435 NwaCegarLoop]: 826 mSDtfsCounter, 372 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 1237 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 896 SdHoareTripleChecker+Invalid, 1457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:51,143 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 896 Invalid, 1457 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1237 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:17:51,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22724 states. [2025-03-16 15:17:51,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22724 to 22724. [2025-03-16 15:17:51,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22724 states, 22723 states have (on average 1.1364696562953835) internal successors, (25824), 22723 states have internal predecessors, (25824), 0 states have call successors, (0), 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 15:17:51,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22724 states to 22724 states and 25824 transitions. [2025-03-16 15:17:51,393 INFO L78 Accepts]: Start accepts. Automaton has 22724 states and 25824 transitions. Word has length 274 [2025-03-16 15:17:51,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:51,394 INFO L471 AbstractCegarLoop]: Abstraction has 22724 states and 25824 transitions. [2025-03-16 15:17:51,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.66666666666667) internal successors, (194), 3 states have internal predecessors, (194), 0 states have call successors, (0), 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 15:17:51,394 INFO L276 IsEmpty]: Start isEmpty. Operand 22724 states and 25824 transitions. [2025-03-16 15:17:51,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2025-03-16 15:17:51,397 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:51,398 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:51,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:17:51,398 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:51,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:51,399 INFO L85 PathProgramCache]: Analyzing trace with hash 988782009, now seen corresponding path program 1 times [2025-03-16 15:17:51,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:51,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614980906] [2025-03-16 15:17:51,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:51,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:51,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 309 statements into 1 equivalence classes. [2025-03-16 15:17:51,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 309 of 309 statements. [2025-03-16 15:17:51,434 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:51,434 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:51,557 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-16 15:17:51,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:51,558 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614980906] [2025-03-16 15:17:51,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614980906] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:51,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:51,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:51,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243549300] [2025-03-16 15:17:51,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:51,558 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:51,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:51,559 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:51,559 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:51,559 INFO L87 Difference]: Start difference. First operand 22724 states and 25824 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 15:17:52,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:52,970 INFO L93 Difference]: Finished difference Result 56078 states and 63634 transitions. [2025-03-16 15:17:52,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:52,970 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 309 [2025-03-16 15:17:52,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:53,007 INFO L225 Difference]: With dead ends: 56078 [2025-03-16 15:17:53,007 INFO L226 Difference]: Without dead ends: 32922 [2025-03-16 15:17:53,026 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 15:17:53,027 INFO L435 NwaCegarLoop]: 361 mSDtfsCounter, 430 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1253 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 1490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:53,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 417 Invalid, 1490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1253 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:17:53,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32922 states. [2025-03-16 15:17:53,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32922 to 30367. [2025-03-16 15:17:53,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30367 states, 30366 states have (on average 1.1221102548903379) internal successors, (34074), 30366 states have internal predecessors, (34074), 0 states have call successors, (0), 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 15:17:53,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30367 states to 30367 states and 34074 transitions. [2025-03-16 15:17:53,474 INFO L78 Accepts]: Start accepts. Automaton has 30367 states and 34074 transitions. Word has length 309 [2025-03-16 15:17:53,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:53,475 INFO L471 AbstractCegarLoop]: Abstraction has 30367 states and 34074 transitions. [2025-03-16 15:17:53,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 15:17:53,475 INFO L276 IsEmpty]: Start isEmpty. Operand 30367 states and 34074 transitions. [2025-03-16 15:17:53,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-03-16 15:17:53,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:53,482 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:53,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-16 15:17:53,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:53,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:53,483 INFO L85 PathProgramCache]: Analyzing trace with hash 518011243, now seen corresponding path program 1 times [2025-03-16 15:17:53,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:53,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127756522] [2025-03-16 15:17:53,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:53,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:53,524 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-03-16 15:17:53,544 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-03-16 15:17:53,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:53,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 336 backedges. 263 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-16 15:17:53,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:53,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127756522] [2025-03-16 15:17:53,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127756522] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:53,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:53,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:53,656 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043390382] [2025-03-16 15:17:53,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:53,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:53,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:53,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:53,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:53,657 INFO L87 Difference]: Start difference. First operand 30367 states and 34074 transitions. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 15:17:54,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:54,917 INFO L93 Difference]: Finished difference Result 70519 states and 79489 transitions. [2025-03-16 15:17:54,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:17:54,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 327 [2025-03-16 15:17:54,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:54,954 INFO L225 Difference]: With dead ends: 70519 [2025-03-16 15:17:54,955 INFO L226 Difference]: Without dead ends: 38876 [2025-03-16 15:17:55,063 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 15:17:55,064 INFO L435 NwaCegarLoop]: 716 mSDtfsCounter, 342 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1158 mSolverCounterSat, 265 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 774 SdHoareTripleChecker+Invalid, 1423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 265 IncrementalHoareTripleChecker+Valid, 1158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:55,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 774 Invalid, 1423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [265 Valid, 1158 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:17:55,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38876 states. [2025-03-16 15:17:55,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38876 to 37599. [2025-03-16 15:17:55,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37599 states, 37598 states have (on average 1.106362040534071) internal successors, (41597), 37598 states have internal predecessors, (41597), 0 states have call successors, (0), 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 15:17:55,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37599 states to 37599 states and 41597 transitions. [2025-03-16 15:17:55,346 INFO L78 Accepts]: Start accepts. Automaton has 37599 states and 41597 transitions. Word has length 327 [2025-03-16 15:17:55,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:55,346 INFO L471 AbstractCegarLoop]: Abstraction has 37599 states and 41597 transitions. [2025-03-16 15:17:55,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 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 15:17:55,346 INFO L276 IsEmpty]: Start isEmpty. Operand 37599 states and 41597 transitions. [2025-03-16 15:17:55,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 336 [2025-03-16 15:17:55,349 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:55,349 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:55,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:17:55,350 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:55,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:55,350 INFO L85 PathProgramCache]: Analyzing trace with hash -443596865, now seen corresponding path program 1 times [2025-03-16 15:17:55,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:55,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912060391] [2025-03-16 15:17:55,350 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:55,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:55,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-16 15:17:55,397 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-16 15:17:55,397 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:55,397 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:55,608 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 351 proven. 73 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-16 15:17:55,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912060391] [2025-03-16 15:17:55,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912060391] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:55,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117887337] [2025-03-16 15:17:55,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:55,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:17:55,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:17:55,611 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 15:17:55,612 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 15:17:55,653 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 335 statements into 1 equivalence classes. [2025-03-16 15:17:55,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 335 of 335 statements. [2025-03-16 15:17:55,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:55,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:55,702 INFO L256 TraceCheckSpWp]: Trace formula consists of 483 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:17:55,711 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:17:55,893 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 351 proven. 73 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-16 15:17:55,895 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:17:56,104 INFO L134 CoverageAnalysis]: Checked inductivity of 566 backedges. 424 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-03-16 15:17:56,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117887337] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:17:56,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:17:56,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-16 15:17:56,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675155352] [2025-03-16 15:17:56,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:56,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:17:56,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:56,105 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:17:56,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:17:56,106 INFO L87 Difference]: Start difference. First operand 37599 states and 41597 transitions. Second operand has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 15:17:58,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:17:58,279 INFO L93 Difference]: Finished difference Result 90534 states and 100268 transitions. [2025-03-16 15:17:58,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:17:58,280 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 335 [2025-03-16 15:17:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:17:58,341 INFO L225 Difference]: With dead ends: 90534 [2025-03-16 15:17:58,341 INFO L226 Difference]: Without dead ends: 52509 [2025-03-16 15:17:58,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 667 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:17:58,372 INFO L435 NwaCegarLoop]: 77 mSDtfsCounter, 879 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 2290 mSolverCounterSat, 581 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 2871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 581 IncrementalHoareTripleChecker+Valid, 2290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:17:58,372 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 171 Invalid, 2871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [581 Valid, 2290 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:17:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52509 states. [2025-03-16 15:17:58,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52509 to 49956. [2025-03-16 15:17:58,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49956 states, 49955 states have (on average 1.1099189270343308) internal successors, (55446), 49955 states have internal predecessors, (55446), 0 states have call successors, (0), 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 15:17:58,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49956 states to 49956 states and 55446 transitions. [2025-03-16 15:17:58,865 INFO L78 Accepts]: Start accepts. Automaton has 49956 states and 55446 transitions. Word has length 335 [2025-03-16 15:17:58,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:17:58,865 INFO L471 AbstractCegarLoop]: Abstraction has 49956 states and 55446 transitions. [2025-03-16 15:17:58,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 57.75) internal successors, (231), 3 states have internal predecessors, (231), 0 states have call successors, (0), 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 15:17:58,865 INFO L276 IsEmpty]: Start isEmpty. Operand 49956 states and 55446 transitions. [2025-03-16 15:17:58,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-03-16 15:17:58,872 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:17:58,872 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:17:58,878 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 15:17:59,076 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,SelfDestructingSolverStorable11 [2025-03-16 15:17:59,076 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:17:59,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:17:59,076 INFO L85 PathProgramCache]: Analyzing trace with hash 453420618, now seen corresponding path program 1 times [2025-03-16 15:17:59,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:17:59,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861755068] [2025-03-16 15:17:59,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:17:59,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:17:59,106 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-03-16 15:17:59,128 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-03-16 15:17:59,128 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:17:59,128 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:17:59,303 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-16 15:17:59,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:17:59,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861755068] [2025-03-16 15:17:59,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861755068] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:17:59,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:17:59,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:17:59,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400338802] [2025-03-16 15:17:59,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:17:59,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:17:59,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:17:59,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:17:59,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:17:59,307 INFO L87 Difference]: Start difference. First operand 49956 states and 55446 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 15:18:00,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:00,946 INFO L93 Difference]: Finished difference Result 120385 states and 133257 transitions. [2025-03-16 15:18:00,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:00,946 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 433 [2025-03-16 15:18:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:01,025 INFO L225 Difference]: With dead ends: 120385 [2025-03-16 15:18:01,025 INFO L226 Difference]: Without dead ends: 70004 [2025-03-16 15:18:01,063 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 15:18:01,063 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 452 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1362 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 1535 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:01,063 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 347 Invalid, 1535 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1362 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:18:01,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70004 states. [2025-03-16 15:18:01,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70004 to 68688. [2025-03-16 15:18:01,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68688 states, 68687 states have (on average 1.1018387758964578) internal successors, (75682), 68687 states have internal predecessors, (75682), 0 states have call successors, (0), 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 15:18:01,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68688 states to 68688 states and 75682 transitions. [2025-03-16 15:18:01,836 INFO L78 Accepts]: Start accepts. Automaton has 68688 states and 75682 transitions. Word has length 433 [2025-03-16 15:18:01,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:01,837 INFO L471 AbstractCegarLoop]: Abstraction has 68688 states and 75682 transitions. [2025-03-16 15:18:01,837 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 15:18:01,837 INFO L276 IsEmpty]: Start isEmpty. Operand 68688 states and 75682 transitions. [2025-03-16 15:18:01,848 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2025-03-16 15:18:01,849 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:01,849 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:18:01,849 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:18:01,849 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:01,849 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:01,849 INFO L85 PathProgramCache]: Analyzing trace with hash -187118334, now seen corresponding path program 1 times [2025-03-16 15:18:01,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:01,850 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039984691] [2025-03-16 15:18:01,850 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:01,850 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:01,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 460 statements into 1 equivalence classes. [2025-03-16 15:18:01,895 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 460 of 460 statements. [2025-03-16 15:18:01,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:01,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:02,004 INFO L134 CoverageAnalysis]: Checked inductivity of 633 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 490 trivial. 0 not checked. [2025-03-16 15:18:02,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:02,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039984691] [2025-03-16 15:18:02,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039984691] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:02,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:02,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:02,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034345007] [2025-03-16 15:18:02,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:02,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:02,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:02,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:02,006 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:02,006 INFO L87 Difference]: Start difference. First operand 68688 states and 75682 transitions. Second operand has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 15:18:03,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:03,544 INFO L93 Difference]: Finished difference Result 150578 states and 166091 transitions. [2025-03-16 15:18:03,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:03,545 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 460 [2025-03-16 15:18:03,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:03,624 INFO L225 Difference]: With dead ends: 150578 [2025-03-16 15:18:03,624 INFO L226 Difference]: Without dead ends: 81465 [2025-03-16 15:18:03,664 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 15:18:03,665 INFO L435 NwaCegarLoop]: 255 mSDtfsCounter, 488 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 209 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 488 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 1521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 209 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:03,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [488 Valid, 300 Invalid, 1521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [209 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:18:03,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81465 states. [2025-03-16 15:18:04,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81465 to 62282. [2025-03-16 15:18:04,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62282 states, 62281 states have (on average 1.1047189351487612) internal successors, (68803), 62281 states have internal predecessors, (68803), 0 states have call successors, (0), 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 15:18:04,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62282 states to 62282 states and 68803 transitions. [2025-03-16 15:18:04,207 INFO L78 Accepts]: Start accepts. Automaton has 62282 states and 68803 transitions. Word has length 460 [2025-03-16 15:18:04,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:04,207 INFO L471 AbstractCegarLoop]: Abstraction has 62282 states and 68803 transitions. [2025-03-16 15:18:04,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.33333333333333) internal successors, (202), 3 states have internal predecessors, (202), 0 states have call successors, (0), 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 15:18:04,208 INFO L276 IsEmpty]: Start isEmpty. Operand 62282 states and 68803 transitions. [2025-03-16 15:18:04,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2025-03-16 15:18:04,215 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:04,215 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:04,215 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:18:04,215 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:04,216 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:04,216 INFO L85 PathProgramCache]: Analyzing trace with hash -2095620564, now seen corresponding path program 1 times [2025-03-16 15:18:04,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:04,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984524704] [2025-03-16 15:18:04,216 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:04,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:04,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 472 statements into 1 equivalence classes. [2025-03-16 15:18:04,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 472 of 472 statements. [2025-03-16 15:18:04,268 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:04,268 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:04,660 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:18:04,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:04,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984524704] [2025-03-16 15:18:04,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984524704] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:04,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:04,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:18:04,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [68139818] [2025-03-16 15:18:04,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:04,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:18:04,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:04,661 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:18:04,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:18:04,661 INFO L87 Difference]: Start difference. First operand 62282 states and 68803 transitions. Second operand has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 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 15:18:06,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:06,564 INFO L93 Difference]: Finished difference Result 143292 states and 158064 transitions. [2025-03-16 15:18:06,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:18:06,564 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 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 472 [2025-03-16 15:18:06,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:06,659 INFO L225 Difference]: With dead ends: 143292 [2025-03-16 15:18:06,659 INFO L226 Difference]: Without dead ends: 80586 [2025-03-16 15:18:06,702 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:18:06,702 INFO L435 NwaCegarLoop]: 238 mSDtfsCounter, 661 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 2456 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 661 SdHoareTripleChecker+Valid, 343 SdHoareTripleChecker+Invalid, 2728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 2456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:06,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [661 Valid, 343 Invalid, 2728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 2456 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 15:18:06,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80586 states. [2025-03-16 15:18:07,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80586 to 75894. [2025-03-16 15:18:07,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75894 states, 75893 states have (on average 1.0980591095357939) internal successors, (83335), 75893 states have internal predecessors, (83335), 0 states have call successors, (0), 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 15:18:07,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75894 states to 75894 states and 83335 transitions. [2025-03-16 15:18:07,485 INFO L78 Accepts]: Start accepts. Automaton has 75894 states and 83335 transitions. Word has length 472 [2025-03-16 15:18:07,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:07,486 INFO L471 AbstractCegarLoop]: Abstraction has 75894 states and 83335 transitions. [2025-03-16 15:18:07,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 97.75) internal successors, (391), 4 states have internal predecessors, (391), 0 states have call successors, (0), 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 15:18:07,486 INFO L276 IsEmpty]: Start isEmpty. Operand 75894 states and 83335 transitions. [2025-03-16 15:18:07,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-03-16 15:18:07,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:07,495 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:07,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 15:18:07,495 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:07,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:07,495 INFO L85 PathProgramCache]: Analyzing trace with hash -1633711116, now seen corresponding path program 1 times [2025-03-16 15:18:07,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:07,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48096078] [2025-03-16 15:18:07,496 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:07,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:07,526 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-03-16 15:18:07,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-03-16 15:18:07,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:07,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:07,631 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-16 15:18:07,632 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:07,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48096078] [2025-03-16 15:18:07,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48096078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:07,632 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:07,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:07,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548955757] [2025-03-16 15:18:07,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:07,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:07,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:07,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:07,633 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:07,633 INFO L87 Difference]: Start difference. First operand 75894 states and 83335 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 15:18:09,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:09,195 INFO L93 Difference]: Finished difference Result 158164 states and 173868 transitions. [2025-03-16 15:18:09,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:09,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 480 [2025-03-16 15:18:09,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:09,298 INFO L225 Difference]: With dead ends: 158164 [2025-03-16 15:18:09,298 INFO L226 Difference]: Without dead ends: 81845 [2025-03-16 15:18:09,336 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 15:18:09,337 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 474 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 1225 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 474 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:09,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [474 Valid, 254 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1225 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:18:09,389 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81845 states. [2025-03-16 15:18:10,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81845 to 78433. [2025-03-16 15:18:10,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78433 states, 78432 states have (on average 1.0967079763361893) internal successors, (86017), 78432 states have internal predecessors, (86017), 0 states have call successors, (0), 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 15:18:10,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78433 states to 78433 states and 86017 transitions. [2025-03-16 15:18:10,337 INFO L78 Accepts]: Start accepts. Automaton has 78433 states and 86017 transitions. Word has length 480 [2025-03-16 15:18:10,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:10,337 INFO L471 AbstractCegarLoop]: Abstraction has 78433 states and 86017 transitions. [2025-03-16 15:18:10,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 0 states have call successors, (0), 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 15:18:10,338 INFO L276 IsEmpty]: Start isEmpty. Operand 78433 states and 86017 transitions. [2025-03-16 15:18:10,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-03-16 15:18:10,346 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:10,346 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:10,346 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 15:18:10,346 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:10,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:10,346 INFO L85 PathProgramCache]: Analyzing trace with hash 889150811, now seen corresponding path program 1 times [2025-03-16 15:18:10,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:10,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1977150924] [2025-03-16 15:18:10,347 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:10,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:10,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-03-16 15:18:10,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-03-16 15:18:10,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:10,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:10,864 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 405 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-16 15:18:10,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:10,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1977150924] [2025-03-16 15:18:10,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1977150924] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:10,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:10,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:18:10,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600344060] [2025-03-16 15:18:10,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:10,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:18:10,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:10,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:18:10,866 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:18:10,866 INFO L87 Difference]: Start difference. First operand 78433 states and 86017 transitions. Second operand has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 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 15:18:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:13,130 INFO L93 Difference]: Finished difference Result 188410 states and 205789 transitions. [2025-03-16 15:18:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:18:13,131 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 481 [2025-03-16 15:18:13,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:13,252 INFO L225 Difference]: With dead ends: 188410 [2025-03-16 15:18:13,253 INFO L226 Difference]: Without dead ends: 104869 [2025-03-16 15:18:13,298 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:18:13,298 INFO L435 NwaCegarLoop]: 167 mSDtfsCounter, 746 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 2684 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 3038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 2684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:13,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 278 Invalid, 3038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 2684 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:18:13,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104869 states. [2025-03-16 15:18:14,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104869 to 99291. [2025-03-16 15:18:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99291 states, 99290 states have (on average 1.0917212206667337) internal successors, (108397), 99290 states have internal predecessors, (108397), 0 states have call successors, (0), 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 15:18:14,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99291 states to 99291 states and 108397 transitions. [2025-03-16 15:18:14,435 INFO L78 Accepts]: Start accepts. Automaton has 99291 states and 108397 transitions. Word has length 481 [2025-03-16 15:18:14,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:14,435 INFO L471 AbstractCegarLoop]: Abstraction has 99291 states and 108397 transitions. [2025-03-16 15:18:14,435 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 79.75) internal successors, (319), 4 states have internal predecessors, (319), 0 states have call successors, (0), 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 15:18:14,435 INFO L276 IsEmpty]: Start isEmpty. Operand 99291 states and 108397 transitions. [2025-03-16 15:18:14,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 486 [2025-03-16 15:18:14,447 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:14,447 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:14,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-16 15:18:14,447 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:14,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:14,448 INFO L85 PathProgramCache]: Analyzing trace with hash 466229380, now seen corresponding path program 1 times [2025-03-16 15:18:14,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:14,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814777905] [2025-03-16 15:18:14,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:14,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:14,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 485 statements into 1 equivalence classes. [2025-03-16 15:18:14,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 485 of 485 statements. [2025-03-16 15:18:14,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:14,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:15,217 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 294 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:18:15,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:15,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814777905] [2025-03-16 15:18:15,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814777905] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:15,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:15,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:18:15,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992307680] [2025-03-16 15:18:15,218 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:15,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:18:15,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:15,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:18:15,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:18:15,219 INFO L87 Difference]: Start difference. First operand 99291 states and 108397 transitions. Second operand has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 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 15:18:17,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:17,158 INFO L93 Difference]: Finished difference Result 209649 states and 228390 transitions. [2025-03-16 15:18:17,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:18:17,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 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 485 [2025-03-16 15:18:17,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:17,290 INFO L225 Difference]: With dead ends: 209649 [2025-03-16 15:18:17,290 INFO L226 Difference]: Without dead ends: 109934 [2025-03-16 15:18:17,354 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:18:17,354 INFO L435 NwaCegarLoop]: 241 mSDtfsCounter, 847 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1827 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 847 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 2132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:17,354 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [847 Valid, 306 Invalid, 2132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1827 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:18:17,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109934 states. [2025-03-16 15:18:18,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109934 to 102266. [2025-03-16 15:18:18,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102266 states, 102265 states have (on average 1.090079694910282) internal successors, (111477), 102265 states have internal predecessors, (111477), 0 states have call successors, (0), 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 15:18:18,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102266 states to 102266 states and 111477 transitions. [2025-03-16 15:18:18,675 INFO L78 Accepts]: Start accepts. Automaton has 102266 states and 111477 transitions. Word has length 485 [2025-03-16 15:18:18,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:18,676 INFO L471 AbstractCegarLoop]: Abstraction has 102266 states and 111477 transitions. [2025-03-16 15:18:18,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 101.0) internal successors, (404), 4 states have internal predecessors, (404), 0 states have call successors, (0), 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 15:18:18,676 INFO L276 IsEmpty]: Start isEmpty. Operand 102266 states and 111477 transitions. [2025-03-16 15:18:18,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 494 [2025-03-16 15:18:18,689 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:18,690 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:18,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 15:18:18,690 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:18,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:18,690 INFO L85 PathProgramCache]: Analyzing trace with hash -166097168, now seen corresponding path program 1 times [2025-03-16 15:18:18,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:18,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709264634] [2025-03-16 15:18:18,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:18,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:18,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 493 statements into 1 equivalence classes. [2025-03-16 15:18:18,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 493 of 493 statements. [2025-03-16 15:18:18,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:18,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:19,190 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:18:19,191 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:19,191 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709264634] [2025-03-16 15:18:19,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709264634] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:19,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:19,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:18:19,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775410045] [2025-03-16 15:18:19,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:19,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:18:19,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:19,192 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:18:19,192 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:18:19,192 INFO L87 Difference]: Start difference. First operand 102266 states and 111477 transitions. Second operand has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 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 15:18:21,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:21,357 INFO L93 Difference]: Finished difference Result 234794 states and 255670 transitions. [2025-03-16 15:18:21,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:18:21,358 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 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 493 [2025-03-16 15:18:21,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:21,520 INFO L225 Difference]: With dead ends: 234794 [2025-03-16 15:18:21,520 INFO L226 Difference]: Without dead ends: 132529 [2025-03-16 15:18:21,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:18:21,585 INFO L435 NwaCegarLoop]: 78 mSDtfsCounter, 645 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2320 mSolverCounterSat, 461 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 2781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 461 IncrementalHoareTripleChecker+Valid, 2320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:21,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 167 Invalid, 2781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [461 Valid, 2320 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:18:21,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132529 states. [2025-03-16 15:18:22,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132529 to 123157. [2025-03-16 15:18:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123157 states, 123156 states have (on average 1.089950956510442) internal successors, (134234), 123156 states have internal predecessors, (134234), 0 states have call successors, (0), 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 15:18:23,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123157 states to 123157 states and 134234 transitions. [2025-03-16 15:18:23,045 INFO L78 Accepts]: Start accepts. Automaton has 123157 states and 134234 transitions. Word has length 493 [2025-03-16 15:18:23,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:23,046 INFO L471 AbstractCegarLoop]: Abstraction has 123157 states and 134234 transitions. [2025-03-16 15:18:23,046 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.25) internal successors, (493), 4 states have internal predecessors, (493), 0 states have call successors, (0), 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 15:18:23,046 INFO L276 IsEmpty]: Start isEmpty. Operand 123157 states and 134234 transitions. [2025-03-16 15:18:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-03-16 15:18:23,054 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:23,054 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:23,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:18:23,054 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:23,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:23,055 INFO L85 PathProgramCache]: Analyzing trace with hash 920444974, now seen corresponding path program 1 times [2025-03-16 15:18:23,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:23,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [686499474] [2025-03-16 15:18:23,055 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:23,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:23,085 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-03-16 15:18:23,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-03-16 15:18:23,109 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:23,109 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-16 15:18:23,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:23,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [686499474] [2025-03-16 15:18:23,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [686499474] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:23,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:23,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:18:23,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562752047] [2025-03-16 15:18:23,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:23,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:18:23,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:23,888 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:18:23,888 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:18:23,888 INFO L87 Difference]: Start difference. First operand 123157 states and 134234 transitions. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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 15:18:26,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:26,182 INFO L93 Difference]: Finished difference Result 268456 states and 292244 transitions. [2025-03-16 15:18:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:18:26,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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 528 [2025-03-16 15:18:26,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:26,371 INFO L225 Difference]: With dead ends: 268456 [2025-03-16 15:18:26,372 INFO L226 Difference]: Without dead ends: 144875 [2025-03-16 15:18:26,457 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:18:26,457 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 666 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2364 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 666 SdHoareTripleChecker+Valid, 303 SdHoareTripleChecker+Invalid, 2654 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 2364 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:26,457 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [666 Valid, 303 Invalid, 2654 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 2364 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:18:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144875 states. [2025-03-16 15:18:27,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144875 to 126566. [2025-03-16 15:18:27,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126566 states, 126565 states have (on average 1.0891399676055782) internal successors, (137847), 126565 states have internal predecessors, (137847), 0 states have call successors, (0), 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 15:18:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126566 states to 126566 states and 137847 transitions. [2025-03-16 15:18:27,933 INFO L78 Accepts]: Start accepts. Automaton has 126566 states and 137847 transitions. Word has length 528 [2025-03-16 15:18:27,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:27,933 INFO L471 AbstractCegarLoop]: Abstraction has 126566 states and 137847 transitions. [2025-03-16 15:18:27,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 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 15:18:27,934 INFO L276 IsEmpty]: Start isEmpty. Operand 126566 states and 137847 transitions. [2025-03-16 15:18:27,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 537 [2025-03-16 15:18:27,942 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:27,942 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:27,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 15:18:27,943 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:27,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:27,943 INFO L85 PathProgramCache]: Analyzing trace with hash -2031678310, now seen corresponding path program 1 times [2025-03-16 15:18:27,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:27,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948810904] [2025-03-16 15:18:27,943 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:27,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:27,974 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 536 statements into 1 equivalence classes. [2025-03-16 15:18:27,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 536 of 536 statements. [2025-03-16 15:18:27,994 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:27,994 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:28,426 INFO L134 CoverageAnalysis]: Checked inductivity of 419 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2025-03-16 15:18:28,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:28,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948810904] [2025-03-16 15:18:28,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1948810904] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:28,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:28,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:28,426 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343263403] [2025-03-16 15:18:28,426 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:28,427 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:28,427 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:28,427 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:28,427 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:28,427 INFO L87 Difference]: Start difference. First operand 126566 states and 137847 transitions. Second operand has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 15:18:30,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:30,027 INFO L93 Difference]: Finished difference Result 266318 states and 289316 transitions. [2025-03-16 15:18:30,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:30,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 536 [2025-03-16 15:18:30,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:30,178 INFO L225 Difference]: With dead ends: 266318 [2025-03-16 15:18:30,178 INFO L226 Difference]: Without dead ends: 139327 [2025-03-16 15:18:30,244 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 15:18:30,244 INFO L435 NwaCegarLoop]: 303 mSDtfsCounter, 436 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1173 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 1289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 1173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:30,244 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 357 Invalid, 1289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 1173 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:18:30,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139327 states. [2025-03-16 15:18:31,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139327 to 124438. [2025-03-16 15:18:31,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124438 states, 124437 states have (on average 1.0876909600842193) internal successors, (135349), 124437 states have internal predecessors, (135349), 0 states have call successors, (0), 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 15:18:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124438 states to 124438 states and 135349 transitions. [2025-03-16 15:18:31,871 INFO L78 Accepts]: Start accepts. Automaton has 124438 states and 135349 transitions. Word has length 536 [2025-03-16 15:18:31,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:31,871 INFO L471 AbstractCegarLoop]: Abstraction has 124438 states and 135349 transitions. [2025-03-16 15:18:31,871 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.66666666666667) internal successors, (308), 3 states have internal predecessors, (308), 0 states have call successors, (0), 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 15:18:31,871 INFO L276 IsEmpty]: Start isEmpty. Operand 124438 states and 135349 transitions. [2025-03-16 15:18:31,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-16 15:18:31,881 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:31,881 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 15:18:31,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 15:18:31,881 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:31,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:31,882 INFO L85 PathProgramCache]: Analyzing trace with hash -793996255, now seen corresponding path program 1 times [2025-03-16 15:18:31,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:31,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480707344] [2025-03-16 15:18:31,882 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:31,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:31,912 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-16 15:18:31,930 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-16 15:18:31,930 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:31,930 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:32,079 INFO L134 CoverageAnalysis]: Checked inductivity of 376 backedges. 107 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-16 15:18:32,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:32,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480707344] [2025-03-16 15:18:32,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480707344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:32,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:32,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:18:32,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1109925051] [2025-03-16 15:18:32,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:32,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:32,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:32,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:32,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:32,081 INFO L87 Difference]: Start difference. First operand 124438 states and 135349 transitions. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 15:18:33,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:33,517 INFO L93 Difference]: Finished difference Result 247590 states and 269239 transitions. [2025-03-16 15:18:33,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:33,520 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 541 [2025-03-16 15:18:33,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:33,646 INFO L225 Difference]: With dead ends: 247590 [2025-03-16 15:18:33,646 INFO L226 Difference]: Without dead ends: 123152 [2025-03-16 15:18:33,710 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 15:18:33,712 INFO L435 NwaCegarLoop]: 653 mSDtfsCounter, 462 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 1171 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 1171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:33,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 714 Invalid, 1304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 1171 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-16 15:18:33,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123152 states. [2025-03-16 15:18:34,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123152 to 121448. [2025-03-16 15:18:35,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121448 states, 121447 states have (on average 1.0728959957841693) internal successors, (130300), 121447 states have internal predecessors, (130300), 0 states have call successors, (0), 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 15:18:35,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121448 states to 121448 states and 130300 transitions. [2025-03-16 15:18:35,453 INFO L78 Accepts]: Start accepts. Automaton has 121448 states and 130300 transitions. Word has length 541 [2025-03-16 15:18:35,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:35,453 INFO L471 AbstractCegarLoop]: Abstraction has 121448 states and 130300 transitions. [2025-03-16 15:18:35,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 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 15:18:35,453 INFO L276 IsEmpty]: Start isEmpty. Operand 121448 states and 130300 transitions. [2025-03-16 15:18:35,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2025-03-16 15:18:35,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:35,463 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:35,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-16 15:18:35,463 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:35,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:35,464 INFO L85 PathProgramCache]: Analyzing trace with hash 265929041, now seen corresponding path program 1 times [2025-03-16 15:18:35,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:35,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [406311049] [2025-03-16 15:18:35,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:35,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:35,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 552 statements into 1 equivalence classes. [2025-03-16 15:18:35,513 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 552 of 552 statements. [2025-03-16 15:18:35,513 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:35,513 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:35,763 INFO L134 CoverageAnalysis]: Checked inductivity of 975 backedges. 600 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-16 15:18:35,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:35,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [406311049] [2025-03-16 15:18:35,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [406311049] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:35,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:35,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-16 15:18:35,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017288620] [2025-03-16 15:18:35,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:35,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:18:35,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:35,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:18:35,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:18:35,769 INFO L87 Difference]: Start difference. First operand 121448 states and 130300 transitions. Second operand has 5 states, 5 states have (on average 52.4) internal successors, (262), 5 states have internal predecessors, (262), 0 states have call successors, (0), 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 15:18:38,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:38,591 INFO L93 Difference]: Finished difference Result 302074 states and 324402 transitions. [2025-03-16 15:18:38,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:18:38,592 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 52.4) internal successors, (262), 5 states have internal predecessors, (262), 0 states have call successors, (0), 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 552 [2025-03-16 15:18:38,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:38,783 INFO L225 Difference]: With dead ends: 302074 [2025-03-16 15:18:38,783 INFO L226 Difference]: Without dead ends: 177652 [2025-03-16 15:18:38,863 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:18:38,863 INFO L435 NwaCegarLoop]: 107 mSDtfsCounter, 1310 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 3320 mSolverCounterSat, 546 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1310 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 3866 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 546 IncrementalHoareTripleChecker+Valid, 3320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:38,863 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1310 Valid, 214 Invalid, 3866 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [546 Valid, 3320 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:18:39,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177652 states. [2025-03-16 15:18:40,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177652 to 159354. [2025-03-16 15:18:40,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159354 states, 159353 states have (on average 1.0669708132259825) internal successors, (170025), 159353 states have internal predecessors, (170025), 0 states have call successors, (0), 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 15:18:40,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159354 states to 159354 states and 170025 transitions. [2025-03-16 15:18:40,564 INFO L78 Accepts]: Start accepts. Automaton has 159354 states and 170025 transitions. Word has length 552 [2025-03-16 15:18:40,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:40,564 INFO L471 AbstractCegarLoop]: Abstraction has 159354 states and 170025 transitions. [2025-03-16 15:18:40,564 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 52.4) internal successors, (262), 5 states have internal predecessors, (262), 0 states have call successors, (0), 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 15:18:40,564 INFO L276 IsEmpty]: Start isEmpty. Operand 159354 states and 170025 transitions. [2025-03-16 15:18:40,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-16 15:18:40,575 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:40,575 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:40,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-16 15:18:40,575 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:40,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:40,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1775628721, now seen corresponding path program 1 times [2025-03-16 15:18:40,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:40,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230453259] [2025-03-16 15:18:40,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:40,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:40,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-16 15:18:40,911 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-16 15:18:40,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:40,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:41,112 INFO L134 CoverageAnalysis]: Checked inductivity of 1354 backedges. 705 proven. 0 refuted. 0 times theorem prover too weak. 649 trivial. 0 not checked. [2025-03-16 15:18:41,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:41,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230453259] [2025-03-16 15:18:41,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230453259] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:18:41,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:18:41,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:18:41,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120522195] [2025-03-16 15:18:41,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:18:41,113 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:18:41,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:18:41,113 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:18:41,114 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:41,114 INFO L87 Difference]: Start difference. First operand 159354 states and 170025 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 15:18:42,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:18:42,541 INFO L93 Difference]: Finished difference Result 314011 states and 335146 transitions. [2025-03-16 15:18:42,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:18:42,541 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 569 [2025-03-16 15:18:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:18:42,715 INFO L225 Difference]: With dead ends: 314011 [2025-03-16 15:18:42,715 INFO L226 Difference]: Without dead ends: 154658 [2025-03-16 15:18:42,779 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:18:42,783 INFO L435 NwaCegarLoop]: 99 mSDtfsCounter, 627 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 658 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 627 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:18:42,783 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [627 Valid, 99 Invalid, 663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 658 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-16 15:18:42,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154658 states. [2025-03-16 15:18:44,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154658 to 150390. [2025-03-16 15:18:44,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150390 states, 150389 states have (on average 1.068289569050928) internal successors, (160659), 150389 states have internal predecessors, (160659), 0 states have call successors, (0), 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 15:18:44,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150390 states to 150390 states and 160659 transitions. [2025-03-16 15:18:44,255 INFO L78 Accepts]: Start accepts. Automaton has 150390 states and 160659 transitions. Word has length 569 [2025-03-16 15:18:44,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:18:44,256 INFO L471 AbstractCegarLoop]: Abstraction has 150390 states and 160659 transitions. [2025-03-16 15:18:44,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 15:18:44,256 INFO L276 IsEmpty]: Start isEmpty. Operand 150390 states and 160659 transitions. [2025-03-16 15:18:44,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 598 [2025-03-16 15:18:44,267 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:18:44,267 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:18:44,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-16 15:18:44,268 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:18:44,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:18:44,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1702029371, now seen corresponding path program 1 times [2025-03-16 15:18:44,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:18:44,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557410543] [2025-03-16 15:18:44,268 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:44,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:18:44,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 597 statements into 1 equivalence classes. [2025-03-16 15:18:44,580 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 597 of 597 statements. [2025-03-16 15:18:44,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:18:44,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:18:45,323 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 483 proven. 36 refuted. 0 times theorem prover too weak. 282 trivial. 0 not checked. [2025-03-16 15:18:45,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:18:45,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557410543] [2025-03-16 15:18:45,323 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557410543] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:18:45,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524193135] [2025-03-16 15:18:45,323 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:18:45,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:18:45,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:18:45,325 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 15:18:45,327 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process