./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label14.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/Problem18_label14.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 a02231a91e38821a474a995aa0f6354f8b6e8aefa7ca1b1921ca101a19abba9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 15:23:07,310 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 15:23:07,365 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 15:23:07,371 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 15:23:07,371 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 15:23:07,391 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 15:23:07,392 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 15:23:07,392 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 15:23:07,392 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 15:23:07,392 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 15:23:07,393 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 15:23:07,393 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 15:23:07,393 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 15:23:07,393 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 15:23:07,393 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 15:23:07,393 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 15:23:07,393 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 15:23:07,394 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:23:07,394 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 15:23:07,394 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 15:23:07,395 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 15:23:07,395 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 15:23:07,395 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 15:23:07,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 15:23:07,395 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 15:23:07,395 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 15:23:07,395 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 15:23:07,395 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 15:23:07,395 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 -> a02231a91e38821a474a995aa0f6354f8b6e8aefa7ca1b1921ca101a19abba9e [2025-03-16 15:23:07,628 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 15:23:07,636 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 15:23:07,638 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 15:23:07,638 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 15:23:07,639 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 15:23:07,639 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label14.c [2025-03-16 15:23:08,715 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b75d20cc/6d787079af2a4261b43bfef792726dcd/FLAG0b5a546f5 [2025-03-16 15:23:09,102 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 15:23:09,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label14.c [2025-03-16 15:23:09,123 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b75d20cc/6d787079af2a4261b43bfef792726dcd/FLAG0b5a546f5 [2025-03-16 15:23:09,138 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b75d20cc/6d787079af2a4261b43bfef792726dcd [2025-03-16 15:23:09,140 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 15:23:09,141 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 15:23:09,142 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 15:23:09,142 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 15:23:09,145 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 15:23:09,146 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:23:09" (1/1) ... [2025-03-16 15:23:09,147 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a323342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09, skipping insertion in model container [2025-03-16 15:23:09,147 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 03:23:09" (1/1) ... [2025-03-16 15:23:09,208 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 15:23:09,367 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/Problem18_label14.c[5298,5311] [2025-03-16 15:23:09,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:23:09,789 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 15:23:09,804 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/Problem18_label14.c[5298,5311] [2025-03-16 15:23:09,978 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 15:23:09,993 INFO L204 MainTranslator]: Completed translation [2025-03-16 15:23:09,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09 WrapperNode [2025-03-16 15:23:09,995 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 15:23:09,996 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 15:23:09,996 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 15:23:09,996 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 15:23:10,000 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:23:09" (1/1) ... [2025-03-16 15:23:10,036 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:23:09" (1/1) ... [2025-03-16 15:23:10,167 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4132 [2025-03-16 15:23:10,167 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 15:23:10,168 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 15:23:10,168 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 15:23:10,168 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 15:23:10,174 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09" (1/1) ... [2025-03-16 15:23:10,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09" (1/1) ... [2025-03-16 15:23:10,202 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09" (1/1) ... [2025-03-16 15:23:10,283 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:23:10,284 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09" (1/1) ... [2025-03-16 15:23:10,284 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09" (1/1) ... [2025-03-16 15:23:10,335 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09" (1/1) ... [2025-03-16 15:23:10,345 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09" (1/1) ... [2025-03-16 15:23:10,357 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09" (1/1) ... [2025-03-16 15:23:10,368 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09" (1/1) ... [2025-03-16 15:23:10,387 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 15:23:10,389 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 15:23:10,389 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 15:23:10,389 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 15:23:10,391 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09" (1/1) ... [2025-03-16 15:23:10,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 15:23:10,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:23:10,452 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:23:10,454 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:23:10,469 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 15:23:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 15:23:10,470 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 15:23:10,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 15:23:10,512 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 15:23:10,513 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 15:23:12,963 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1647: havoc calculate_output_#t~ret8#1; [2025-03-16 15:23:12,963 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3060: havoc calculate_output2_#t~ret9#1; [2025-03-16 15:23:13,062 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2025-03-16 15:23:13,062 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 15:23:13,091 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 15:23:13,091 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 15:23:13,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:23:13 BoogieIcfgContainer [2025-03-16 15:23:13,091 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 15:23:13,095 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 15:23:13,095 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 15:23:13,098 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 15:23:13,098 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 03:23:09" (1/3) ... [2025-03-16 15:23:13,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc1a8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:23:13, skipping insertion in model container [2025-03-16 15:23:13,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 03:23:09" (2/3) ... [2025-03-16 15:23:13,099 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5fc1a8e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 03:23:13, skipping insertion in model container [2025-03-16 15:23:13,099 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 03:23:13" (3/3) ... [2025-03-16 15:23:13,100 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem18_label14.c [2025-03-16 15:23:13,109 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 15:23:13,110 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem18_label14.c that has 1 procedures, 696 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 15:23:13,163 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 15:23:13,172 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;@71a4db36, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 15:23:13,173 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 15:23:13,178 INFO L276 IsEmpty]: Start isEmpty. Operand has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 0 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:23:13,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 15:23:13,183 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:13,183 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:13,184 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:13,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:13,188 INFO L85 PathProgramCache]: Analyzing trace with hash -1778943880, now seen corresponding path program 1 times [2025-03-16 15:23:13,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:13,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595657804] [2025-03-16 15:23:13,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:13,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:13,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 15:23:13,252 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 15:23:13,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:13,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:13,305 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:23:13,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:13,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595657804] [2025-03-16 15:23:13,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595657804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:13,309 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:13,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:13,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020107969] [2025-03-16 15:23:13,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:13,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 15:23:13,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:13,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 15:23:13,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 15:23:13,333 INFO L87 Difference]: Start difference. First operand has 696 states, 694 states have (on average 1.9913544668587897) internal successors, (1382), 695 states have internal predecessors, (1382), 0 states have call successors, (0), 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 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:13,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:13,381 INFO L93 Difference]: Finished difference Result 1391 states and 2763 transitions. [2025-03-16 15:23:13,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 15:23:13,383 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-16 15:23:13,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:13,391 INFO L225 Difference]: With dead ends: 1391 [2025-03-16 15:23:13,392 INFO L226 Difference]: Without dead ends: 693 [2025-03-16 15:23:13,396 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:23:13,398 INFO L435 NwaCegarLoop]: 1320 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, 1320 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:23:13,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1320 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 15:23:13,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 693 states. [2025-03-16 15:23:13,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 693 to 693. [2025-03-16 15:23:13,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.903179190751445) internal successors, (1317), 692 states have internal predecessors, (1317), 0 states have call successors, (0), 0 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:23:13,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1317 transitions. [2025-03-16 15:23:13,451 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1317 transitions. Word has length 49 [2025-03-16 15:23:13,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:13,451 INFO L471 AbstractCegarLoop]: Abstraction has 693 states and 1317 transitions. [2025-03-16 15:23:13,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:13,451 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1317 transitions. [2025-03-16 15:23:13,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-03-16 15:23:13,452 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:13,452 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:23:13,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 15:23:13,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:13,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:13,453 INFO L85 PathProgramCache]: Analyzing trace with hash -932343245, now seen corresponding path program 1 times [2025-03-16 15:23:13,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:13,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155767304] [2025-03-16 15:23:13,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:13,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:13,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-03-16 15:23:13,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-03-16 15:23:13,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:13,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:13,715 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:23:13,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:13,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155767304] [2025-03-16 15:23:13,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155767304] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:13,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:13,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:13,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576626530] [2025-03-16 15:23:13,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:13,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:13,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:13,717 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:13,717 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:13,717 INFO L87 Difference]: Start difference. First operand 693 states and 1317 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:17,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:17,894 INFO L93 Difference]: Finished difference Result 2765 states and 5263 transitions. [2025-03-16 15:23:17,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:17,894 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 49 [2025-03-16 15:23:17,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:17,901 INFO L225 Difference]: With dead ends: 2765 [2025-03-16 15:23:17,901 INFO L226 Difference]: Without dead ends: 2073 [2025-03-16 15:23:17,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 15:23:17,903 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 2011 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 5263 mSolverCounterSat, 894 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 639 SdHoareTripleChecker+Invalid, 6157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 894 IncrementalHoareTripleChecker+Valid, 5263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:17,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 639 Invalid, 6157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [894 Valid, 5263 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2025-03-16 15:23:17,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2073 states. [2025-03-16 15:23:17,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2073 to 2073. [2025-03-16 15:23:17,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2073 states, 2072 states have (on average 1.5912162162162162) internal successors, (3297), 2072 states have internal predecessors, (3297), 0 states have call successors, (0), 0 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:23:17,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2073 states to 2073 states and 3297 transitions. [2025-03-16 15:23:17,965 INFO L78 Accepts]: Start accepts. Automaton has 2073 states and 3297 transitions. Word has length 49 [2025-03-16 15:23:17,965 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:17,965 INFO L471 AbstractCegarLoop]: Abstraction has 2073 states and 3297 transitions. [2025-03-16 15:23:17,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 3 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:17,966 INFO L276 IsEmpty]: Start isEmpty. Operand 2073 states and 3297 transitions. [2025-03-16 15:23:17,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2025-03-16 15:23:17,972 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:17,972 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, 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] [2025-03-16 15:23:17,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 15:23:17,973 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:17,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:17,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1496824163, now seen corresponding path program 1 times [2025-03-16 15:23:17,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:17,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11942630] [2025-03-16 15:23:17,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:17,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:18,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 231 statements into 1 equivalence classes. [2025-03-16 15:23:18,026 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 231 of 231 statements. [2025-03-16 15:23:18,026 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:18,026 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:18,310 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2025-03-16 15:23:18,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:18,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11942630] [2025-03-16 15:23:18,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11942630] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:18,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:18,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:18,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669743696] [2025-03-16 15:23:18,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:18,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:18,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:18,313 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:18,313 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:18,313 INFO L87 Difference]: Start difference. First operand 2073 states and 3297 transitions. Second operand has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:20,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:20,274 INFO L93 Difference]: Finished difference Result 5525 states and 9186 transitions. [2025-03-16 15:23:20,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:20,275 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 231 [2025-03-16 15:23:20,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:20,286 INFO L225 Difference]: With dead ends: 5525 [2025-03-16 15:23:20,286 INFO L226 Difference]: Without dead ends: 3453 [2025-03-16 15:23:20,289 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:23:20,289 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 590 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1993 mSolverCounterSat, 673 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 590 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 2666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 673 IncrementalHoareTripleChecker+Valid, 1993 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:20,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [590 Valid, 435 Invalid, 2666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [673 Valid, 1993 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 15:23:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3453 states. [2025-03-16 15:23:20,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3453 to 3453. [2025-03-16 15:23:20,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3453 states, 3452 states have (on average 1.4695828505214368) internal successors, (5073), 3452 states have internal predecessors, (5073), 0 states have call successors, (0), 0 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:23:20,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3453 states to 3453 states and 5073 transitions. [2025-03-16 15:23:20,337 INFO L78 Accepts]: Start accepts. Automaton has 3453 states and 5073 transitions. Word has length 231 [2025-03-16 15:23:20,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:20,339 INFO L471 AbstractCegarLoop]: Abstraction has 3453 states and 5073 transitions. [2025-03-16 15:23:20,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.666666666666664) internal successors, (185), 2 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:20,339 INFO L276 IsEmpty]: Start isEmpty. Operand 3453 states and 5073 transitions. [2025-03-16 15:23:20,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2025-03-16 15:23:20,342 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:20,342 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:20,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-16 15:23:20,343 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:20,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:20,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1972461814, now seen corresponding path program 1 times [2025-03-16 15:23:20,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:20,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354614418] [2025-03-16 15:23:20,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:20,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:20,372 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 296 statements into 1 equivalence classes. [2025-03-16 15:23:20,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 296 of 296 statements. [2025-03-16 15:23:20,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:20,401 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:20,738 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:20,738 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:20,738 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1354614418] [2025-03-16 15:23:20,738 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1354614418] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:20,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:20,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:20,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569509097] [2025-03-16 15:23:20,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:20,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:20,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:20,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:20,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:20,739 INFO L87 Difference]: Start difference. First operand 3453 states and 5073 transitions. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:23:22,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:22,537 INFO L93 Difference]: Finished difference Result 8338 states and 11974 transitions. [2025-03-16 15:23:22,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:22,538 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 296 [2025-03-16 15:23:22,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:22,551 INFO L225 Difference]: With dead ends: 8338 [2025-03-16 15:23:22,551 INFO L226 Difference]: Without dead ends: 4833 [2025-03-16 15:23:22,555 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:23:22,556 INFO L435 NwaCegarLoop]: 624 mSDtfsCounter, 513 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3037 mSolverCounterSat, 376 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 513 SdHoareTripleChecker+Valid, 638 SdHoareTripleChecker+Invalid, 3413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 376 IncrementalHoareTripleChecker+Valid, 3037 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:22,556 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [513 Valid, 638 Invalid, 3413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [376 Valid, 3037 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:23:22,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4833 states. [2025-03-16 15:23:22,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4833 to 4143. [2025-03-16 15:23:22,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4143 states, 4142 states have (on average 1.3020280057943023) internal successors, (5393), 4142 states have internal predecessors, (5393), 0 states have call successors, (0), 0 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:23:22,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4143 states to 4143 states and 5393 transitions. [2025-03-16 15:23:22,631 INFO L78 Accepts]: Start accepts. Automaton has 4143 states and 5393 transitions. Word has length 296 [2025-03-16 15:23:22,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:22,632 INFO L471 AbstractCegarLoop]: Abstraction has 4143 states and 5393 transitions. [2025-03-16 15:23:22,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 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:23:22,632 INFO L276 IsEmpty]: Start isEmpty. Operand 4143 states and 5393 transitions. [2025-03-16 15:23:22,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-03-16 15:23:22,637 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:22,637 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:22,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 15:23:22,637 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:22,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:22,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1020831440, now seen corresponding path program 1 times [2025-03-16 15:23:22,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:22,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197126631] [2025-03-16 15:23:22,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:22,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:22,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 15:23:22,691 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 15:23:22,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:22,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 118 proven. 41 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:23,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:23,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197126631] [2025-03-16 15:23:23,310 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197126631] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:23:23,310 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [863031517] [2025-03-16 15:23:23,311 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:23,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:23:23,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:23:23,313 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:23:23,315 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:23:23,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-03-16 15:23:23,419 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-03-16 15:23:23,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:23,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:23,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 516 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:23:23,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:23:23,803 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2025-03-16 15:23:23,807 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:23:23,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [863031517] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:23,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:23:23,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-16 15:23:23,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1542353237] [2025-03-16 15:23:23,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:23,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:23,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:23,809 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:23,809 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:23:23,809 INFO L87 Difference]: Start difference. First operand 4143 states and 5393 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:25,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:25,416 INFO L93 Difference]: Finished difference Result 11045 states and 14784 transitions. [2025-03-16 15:23:25,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:25,416 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 413 [2025-03-16 15:23:25,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:25,432 INFO L225 Difference]: With dead ends: 11045 [2025-03-16 15:23:25,432 INFO L226 Difference]: Without dead ends: 6903 [2025-03-16 15:23:25,435 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 416 GetRequests, 412 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:23:25,437 INFO L435 NwaCegarLoop]: 382 mSDtfsCounter, 444 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1667 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 2269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 1667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:25,437 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 387 Invalid, 2269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 1667 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:23:25,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6903 states. [2025-03-16 15:23:25,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6903 to 6213. [2025-03-16 15:23:25,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6213 states, 6212 states have (on average 1.2297166773985835) internal successors, (7639), 6212 states have internal predecessors, (7639), 0 states have call successors, (0), 0 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:23:25,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6213 states to 6213 states and 7639 transitions. [2025-03-16 15:23:25,523 INFO L78 Accepts]: Start accepts. Automaton has 6213 states and 7639 transitions. Word has length 413 [2025-03-16 15:23:25,524 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:25,526 INFO L471 AbstractCegarLoop]: Abstraction has 6213 states and 7639 transitions. [2025-03-16 15:23:25,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:25,526 INFO L276 IsEmpty]: Start isEmpty. Operand 6213 states and 7639 transitions. [2025-03-16 15:23:25,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-03-16 15:23:25,531 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:25,532 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:25,539 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:23:25,732 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:23:25,734 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:25,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:25,734 INFO L85 PathProgramCache]: Analyzing trace with hash 1221210666, now seen corresponding path program 1 times [2025-03-16 15:23:25,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:25,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65377830] [2025-03-16 15:23:25,734 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:25,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:25,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-03-16 15:23:25,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-03-16 15:23:25,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:25,784 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:26,145 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:26,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:26,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65377830] [2025-03-16 15:23:26,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65377830] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:26,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:26,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:26,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379946354] [2025-03-16 15:23:26,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:26,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:26,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:26,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:26,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:26,148 INFO L87 Difference]: Start difference. First operand 6213 states and 7639 transitions. Second operand has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 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:23:27,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:27,748 INFO L93 Difference]: Finished difference Result 15875 states and 19411 transitions. [2025-03-16 15:23:27,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:27,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 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 441 [2025-03-16 15:23:27,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:27,777 INFO L225 Difference]: With dead ends: 15875 [2025-03-16 15:23:27,780 INFO L226 Difference]: Without dead ends: 9663 [2025-03-16 15:23:27,787 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:23:27,788 INFO L435 NwaCegarLoop]: 1117 mSDtfsCounter, 598 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2079 mSolverCounterSat, 302 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1123 SdHoareTripleChecker+Invalid, 2381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 302 IncrementalHoareTripleChecker+Valid, 2079 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:27,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1123 Invalid, 2381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [302 Valid, 2079 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:23:27,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9663 states. [2025-03-16 15:23:27,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9663 to 9663. [2025-03-16 15:23:27,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9663 states, 9662 states have (on average 1.177913475470917) internal successors, (11381), 9662 states have internal predecessors, (11381), 0 states have call successors, (0), 0 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:23:27,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9663 states to 9663 states and 11381 transitions. [2025-03-16 15:23:27,918 INFO L78 Accepts]: Start accepts. Automaton has 9663 states and 11381 transitions. Word has length 441 [2025-03-16 15:23:27,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:27,919 INFO L471 AbstractCegarLoop]: Abstraction has 9663 states and 11381 transitions. [2025-03-16 15:23:27,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 147.0) internal successors, (441), 3 states have internal predecessors, (441), 0 states have call successors, (0), 0 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:23:27,919 INFO L276 IsEmpty]: Start isEmpty. Operand 9663 states and 11381 transitions. [2025-03-16 15:23:27,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 447 [2025-03-16 15:23:27,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:27,925 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:27,925 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 15:23:27,925 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:27,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:27,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2046297963, now seen corresponding path program 1 times [2025-03-16 15:23:27,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:27,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140481805] [2025-03-16 15:23:27,926 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:27,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:27,954 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 446 statements into 1 equivalence classes. [2025-03-16 15:23:27,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 446 of 446 statements. [2025-03-16 15:23:27,971 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:27,971 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:28,221 INFO L134 CoverageAnalysis]: Checked inductivity of 192 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 97 trivial. 0 not checked. [2025-03-16 15:23:28,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:28,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140481805] [2025-03-16 15:23:28,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140481805] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:28,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:28,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 15:23:28,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1778207256] [2025-03-16 15:23:28,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:28,222 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:28,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:28,223 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:28,223 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:28,223 INFO L87 Difference]: Start difference. First operand 9663 states and 11381 transitions. Second operand has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:29,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:29,775 INFO L93 Difference]: Finished difference Result 26225 states and 31183 transitions. [2025-03-16 15:23:29,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:29,776 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 446 [2025-03-16 15:23:29,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:29,801 INFO L225 Difference]: With dead ends: 26225 [2025-03-16 15:23:29,801 INFO L226 Difference]: Without dead ends: 17253 [2025-03-16 15:23:29,812 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:23:29,812 INFO L435 NwaCegarLoop]: 71 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 758 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 758 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:29,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 76 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [758 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:23:29,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17253 states. [2025-03-16 15:23:30,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17253 to 16563. [2025-03-16 15:23:30,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16563 states, 16562 states have (on average 1.176669484361792) internal successors, (19488), 16562 states have internal predecessors, (19488), 0 states have call successors, (0), 0 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:23:30,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16563 states to 16563 states and 19488 transitions. [2025-03-16 15:23:30,064 INFO L78 Accepts]: Start accepts. Automaton has 16563 states and 19488 transitions. Word has length 446 [2025-03-16 15:23:30,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:30,064 INFO L471 AbstractCegarLoop]: Abstraction has 16563 states and 19488 transitions. [2025-03-16 15:23:30,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 116.66666666666667) internal successors, (350), 2 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:30,065 INFO L276 IsEmpty]: Start isEmpty. Operand 16563 states and 19488 transitions. [2025-03-16 15:23:30,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 449 [2025-03-16 15:23:30,070 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:30,071 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:30,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 15:23:30,071 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:30,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:30,071 INFO L85 PathProgramCache]: Analyzing trace with hash 1858681065, now seen corresponding path program 1 times [2025-03-16 15:23:30,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:30,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113668157] [2025-03-16 15:23:30,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:30,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:30,108 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 448 statements into 1 equivalence classes. [2025-03-16 15:23:30,130 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 448 of 448 statements. [2025-03-16 15:23:30,130 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:30,130 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:30,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:30,461 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113668157] [2025-03-16 15:23:30,461 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113668157] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:30,461 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:30,461 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:30,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183201853] [2025-03-16 15:23:30,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:30,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:30,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:30,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:30,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:30,463 INFO L87 Difference]: Start difference. First operand 16563 states and 19488 transitions. Second operand has 4 states, 4 states have (on average 112.0) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 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:23:32,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:32,748 INFO L93 Difference]: Finished difference Result 35885 states and 42294 transitions. [2025-03-16 15:23:32,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:32,749 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 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 448 [2025-03-16 15:23:32,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:32,780 INFO L225 Difference]: With dead ends: 35885 [2025-03-16 15:23:32,780 INFO L226 Difference]: Without dead ends: 20013 [2025-03-16 15:23:32,794 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:23:32,795 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 1059 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 3111 mSolverCounterSat, 936 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 4047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 936 IncrementalHoareTripleChecker+Valid, 3111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:32,795 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 99 Invalid, 4047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [936 Valid, 3111 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:23:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20013 states. [2025-03-16 15:23:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20013 to 20013. [2025-03-16 15:23:32,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20013 states, 20012 states have (on average 1.157805316809914) internal successors, (23170), 20012 states have internal predecessors, (23170), 0 states have call successors, (0), 0 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:23:32,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20013 states to 20013 states and 23170 transitions. [2025-03-16 15:23:32,999 INFO L78 Accepts]: Start accepts. Automaton has 20013 states and 23170 transitions. Word has length 448 [2025-03-16 15:23:32,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:32,999 INFO L471 AbstractCegarLoop]: Abstraction has 20013 states and 23170 transitions. [2025-03-16 15:23:33,000 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 112.0) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 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:23:33,000 INFO L276 IsEmpty]: Start isEmpty. Operand 20013 states and 23170 transitions. [2025-03-16 15:23:33,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 978 [2025-03-16 15:23:33,013 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:33,014 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:33,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 15:23:33,015 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:33,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:33,016 INFO L85 PathProgramCache]: Analyzing trace with hash 821100037, now seen corresponding path program 1 times [2025-03-16 15:23:33,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:33,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212455742] [2025-03-16 15:23:33,016 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:33,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:33,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 977 statements into 1 equivalence classes. [2025-03-16 15:23:33,098 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 977 of 977 statements. [2025-03-16 15:23:33,098 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:33,098 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:33,482 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 371 proven. 0 refuted. 0 times theorem prover too weak. 297 trivial. 0 not checked. [2025-03-16 15:23:33,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:33,483 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212455742] [2025-03-16 15:23:33,483 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1212455742] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:33,483 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:33,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:33,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911119288] [2025-03-16 15:23:33,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:33,484 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:33,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:33,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:33,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:33,485 INFO L87 Difference]: Start difference. First operand 20013 states and 23170 transitions. Second operand has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 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:23:35,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:35,108 INFO L93 Difference]: Finished difference Result 47615 states and 55889 transitions. [2025-03-16 15:23:35,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:35,109 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 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 977 [2025-03-16 15:23:35,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:35,142 INFO L225 Difference]: With dead ends: 47615 [2025-03-16 15:23:35,142 INFO L226 Difference]: Without dead ends: 28983 [2025-03-16 15:23:35,151 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:23:35,152 INFO L435 NwaCegarLoop]: 216 mSDtfsCounter, 665 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1885 mSolverCounterSat, 466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 665 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 2351 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 466 IncrementalHoareTripleChecker+Valid, 1885 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:35,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [665 Valid, 222 Invalid, 2351 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [466 Valid, 1885 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 15:23:35,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28983 states. [2025-03-16 15:23:35,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28983 to 28293. [2025-03-16 15:23:35,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28293 states, 28292 states have (on average 1.1511734766011594) internal successors, (32569), 28292 states have internal predecessors, (32569), 0 states have call successors, (0), 0 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:23:35,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28293 states to 28293 states and 32569 transitions. [2025-03-16 15:23:35,538 INFO L78 Accepts]: Start accepts. Automaton has 28293 states and 32569 transitions. Word has length 977 [2025-03-16 15:23:35,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:35,540 INFO L471 AbstractCegarLoop]: Abstraction has 28293 states and 32569 transitions. [2025-03-16 15:23:35,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 0 states have call successors, (0), 0 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:23:35,541 INFO L276 IsEmpty]: Start isEmpty. Operand 28293 states and 32569 transitions. [2025-03-16 15:23:35,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1096 [2025-03-16 15:23:35,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:35,555 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:35,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 15:23:35,555 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:35,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:35,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1916823998, now seen corresponding path program 1 times [2025-03-16 15:23:35,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:35,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342208292] [2025-03-16 15:23:35,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:35,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:35,643 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1095 statements into 1 equivalence classes. [2025-03-16 15:23:35,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1095 of 1095 statements. [2025-03-16 15:23:35,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:35,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:36,905 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 513 proven. 531 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 15:23:36,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:36,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342208292] [2025-03-16 15:23:36,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342208292] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:23:36,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1286634412] [2025-03-16 15:23:36,906 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:36,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:23:36,906 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:23:36,908 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:23:36,909 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:23:36,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1095 statements into 1 equivalence classes. [2025-03-16 15:23:37,124 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1095 of 1095 statements. [2025-03-16 15:23:37,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:37,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:37,127 INFO L256 TraceCheckSpWp]: Trace formula consists of 1253 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-16 15:23:37,144 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:23:38,131 INFO L134 CoverageAnalysis]: Checked inductivity of 1044 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 15:23:38,131 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:23:38,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1286634412] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:38,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:23:38,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 10 [2025-03-16 15:23:38,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119670466] [2025-03-16 15:23:38,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:38,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:38,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:38,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:38,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 15:23:38,133 INFO L87 Difference]: Start difference. First operand 28293 states and 32569 transitions. Second operand has 4 states, 4 states have (on average 165.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 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:23:40,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:40,522 INFO L93 Difference]: Finished difference Result 62105 states and 71868 transitions. [2025-03-16 15:23:40,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:40,523 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 165.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 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 1095 [2025-03-16 15:23:40,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:40,562 INFO L225 Difference]: With dead ends: 62105 [2025-03-16 15:23:40,562 INFO L226 Difference]: Without dead ends: 35193 [2025-03-16 15:23:40,583 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1102 GetRequests, 1093 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-03-16 15:23:40,583 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 835 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2829 mSolverCounterSat, 964 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 835 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 3793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 964 IncrementalHoareTripleChecker+Valid, 2829 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:40,584 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [835 Valid, 114 Invalid, 3793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [964 Valid, 2829 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 15:23:40,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35193 states. [2025-03-16 15:23:40,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35193 to 33123. [2025-03-16 15:23:40,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33123 states, 33122 states have (on average 1.154066783406799) internal successors, (38225), 33122 states have internal predecessors, (38225), 0 states have call successors, (0), 0 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:23:40,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33123 states to 33123 states and 38225 transitions. [2025-03-16 15:23:40,908 INFO L78 Accepts]: Start accepts. Automaton has 33123 states and 38225 transitions. Word has length 1095 [2025-03-16 15:23:40,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:40,910 INFO L471 AbstractCegarLoop]: Abstraction has 33123 states and 38225 transitions. [2025-03-16 15:23:40,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 165.0) internal successors, (660), 3 states have internal predecessors, (660), 0 states have call successors, (0), 0 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:23:40,910 INFO L276 IsEmpty]: Start isEmpty. Operand 33123 states and 38225 transitions. [2025-03-16 15:23:40,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1189 [2025-03-16 15:23:40,919 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:40,919 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, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:40,926 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 15:23:41,120 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,SelfDestructingSolverStorable9 [2025-03-16 15:23:41,121 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:41,122 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:41,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1894501838, now seen corresponding path program 1 times [2025-03-16 15:23:41,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:41,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821301124] [2025-03-16 15:23:41,122 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:41,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:41,189 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1188 statements into 1 equivalence classes. [2025-03-16 15:23:41,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1188 of 1188 statements. [2025-03-16 15:23:41,226 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:41,226 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:41,743 INFO L134 CoverageAnalysis]: Checked inductivity of 1442 backedges. 652 proven. 0 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-03-16 15:23:41,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:41,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821301124] [2025-03-16 15:23:41,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821301124] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:41,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:41,744 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 15:23:41,744 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1432625578] [2025-03-16 15:23:41,744 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:41,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 15:23:41,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:41,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 15:23:41,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 15:23:41,746 INFO L87 Difference]: Start difference. First operand 33123 states and 38225 transitions. Second operand has 4 states, 4 states have (on average 170.5) internal successors, (682), 4 states have internal predecessors, (682), 0 states have call successors, (0), 0 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:23:44,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:44,605 INFO L93 Difference]: Finished difference Result 86257 states and 99747 transitions. [2025-03-16 15:23:44,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:23:44,606 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 170.5) internal successors, (682), 4 states have internal predecessors, (682), 0 states have call successors, (0), 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 1188 [2025-03-16 15:23:44,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:44,668 INFO L225 Difference]: With dead ends: 86257 [2025-03-16 15:23:44,668 INFO L226 Difference]: Without dead ends: 53135 [2025-03-16 15:23:44,697 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:23:44,698 INFO L435 NwaCegarLoop]: 196 mSDtfsCounter, 1434 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 3915 mSolverCounterSat, 820 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1434 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 4735 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 820 IncrementalHoareTripleChecker+Valid, 3915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:44,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1434 Valid, 208 Invalid, 4735 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [820 Valid, 3915 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 15:23:44,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53135 states. [2025-03-16 15:23:45,091 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53135 to 44163. [2025-03-16 15:23:45,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44163 states, 44162 states have (on average 1.1618586114759295) internal successors, (51310), 44162 states have internal predecessors, (51310), 0 states have call successors, (0), 0 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:23:45,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44163 states to 44163 states and 51310 transitions. [2025-03-16 15:23:45,155 INFO L78 Accepts]: Start accepts. Automaton has 44163 states and 51310 transitions. Word has length 1188 [2025-03-16 15:23:45,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:45,155 INFO L471 AbstractCegarLoop]: Abstraction has 44163 states and 51310 transitions. [2025-03-16 15:23:45,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 170.5) internal successors, (682), 4 states have internal predecessors, (682), 0 states have call successors, (0), 0 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:23:45,156 INFO L276 IsEmpty]: Start isEmpty. Operand 44163 states and 51310 transitions. [2025-03-16 15:23:45,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1203 [2025-03-16 15:23:45,165 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:45,165 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:45,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 15:23:45,165 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:45,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:45,166 INFO L85 PathProgramCache]: Analyzing trace with hash -1800217576, now seen corresponding path program 1 times [2025-03-16 15:23:45,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:45,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689234351] [2025-03-16 15:23:45,166 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:45,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:45,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1202 statements into 1 equivalence classes. [2025-03-16 15:23:45,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1202 of 1202 statements. [2025-03-16 15:23:45,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:45,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:46,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 837 proven. 93 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 15:23:46,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:46,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689234351] [2025-03-16 15:23:46,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689234351] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:23:46,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192626088] [2025-03-16 15:23:46,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:46,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:23:46,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:23:46,136 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:23:46,137 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 15:23:46,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1202 statements into 1 equivalence classes. [2025-03-16 15:23:46,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1202 of 1202 statements. [2025-03-16 15:23:46,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:46,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:46,344 INFO L256 TraceCheckSpWp]: Trace formula consists of 1382 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 15:23:46,351 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:23:46,607 INFO L134 CoverageAnalysis]: Checked inductivity of 1505 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 895 trivial. 0 not checked. [2025-03-16 15:23:46,608 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:23:46,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192626088] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:46,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:23:46,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 15:23:46,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939190920] [2025-03-16 15:23:46,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:46,609 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:46,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:46,610 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:46,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:23:46,610 INFO L87 Difference]: Start difference. First operand 44163 states and 51310 transitions. Second operand has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 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:23:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:48,268 INFO L93 Difference]: Finished difference Result 89705 states and 104135 transitions. [2025-03-16 15:23:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:48,269 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 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 1202 [2025-03-16 15:23:48,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:48,314 INFO L225 Difference]: With dead ends: 89705 [2025-03-16 15:23:48,314 INFO L226 Difference]: Without dead ends: 45543 [2025-03-16 15:23:48,340 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1206 GetRequests, 1202 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 15:23:48,341 INFO L435 NwaCegarLoop]: 1127 mSDtfsCounter, 598 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 406 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 598 SdHoareTripleChecker+Valid, 1133 SdHoareTripleChecker+Invalid, 2255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 406 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:48,341 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [598 Valid, 1133 Invalid, 2255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [406 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:23:48,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45543 states. [2025-03-16 15:23:48,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45543 to 45543. [2025-03-16 15:23:48,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45543 states, 45542 states have (on average 1.1391243247990865) internal successors, (51878), 45542 states have internal predecessors, (51878), 0 states have call successors, (0), 0 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:23:48,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45543 states to 45543 states and 51878 transitions. [2025-03-16 15:23:48,685 INFO L78 Accepts]: Start accepts. Automaton has 45543 states and 51878 transitions. Word has length 1202 [2025-03-16 15:23:48,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:48,686 INFO L471 AbstractCegarLoop]: Abstraction has 45543 states and 51878 transitions. [2025-03-16 15:23:48,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 220.33333333333334) internal successors, (661), 3 states have internal predecessors, (661), 0 states have call successors, (0), 0 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:23:48,686 INFO L276 IsEmpty]: Start isEmpty. Operand 45543 states and 51878 transitions. [2025-03-16 15:23:48,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1221 [2025-03-16 15:23:48,695 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:48,695 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, 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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:48,702 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 15:23:48,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:23:48,896 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:48,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:48,896 INFO L85 PathProgramCache]: Analyzing trace with hash 430085722, now seen corresponding path program 1 times [2025-03-16 15:23:48,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:48,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [418999766] [2025-03-16 15:23:48,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:48,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:48,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1220 statements into 1 equivalence classes. [2025-03-16 15:23:48,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1220 of 1220 statements. [2025-03-16 15:23:48,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:48,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:49,529 INFO L134 CoverageAnalysis]: Checked inductivity of 1710 backedges. 611 proven. 0 refuted. 0 times theorem prover too weak. 1099 trivial. 0 not checked. [2025-03-16 15:23:49,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:49,529 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [418999766] [2025-03-16 15:23:49,529 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [418999766] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:49,529 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:49,530 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:49,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795742140] [2025-03-16 15:23:49,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:49,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:49,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:49,531 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:49,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:49,531 INFO L87 Difference]: Start difference. First operand 45543 states and 51878 transitions. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:51,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:51,143 INFO L93 Difference]: Finished difference Result 105575 states and 122143 transitions. [2025-03-16 15:23:51,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:51,143 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1220 [2025-03-16 15:23:51,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:51,208 INFO L225 Difference]: With dead ends: 105575 [2025-03-16 15:23:51,208 INFO L226 Difference]: Without dead ends: 60033 [2025-03-16 15:23:51,241 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:23:51,241 INFO L435 NwaCegarLoop]: 1034 mSDtfsCounter, 641 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2062 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 641 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 2352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 2062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:51,241 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [641 Valid, 1040 Invalid, 2352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 2062 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-16 15:23:51,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60033 states. [2025-03-16 15:23:51,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60033 to 60033. [2025-03-16 15:23:51,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60033 states, 60032 states have (on average 1.1296808368869935) internal successors, (67817), 60032 states have internal predecessors, (67817), 0 states have call successors, (0), 0 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:23:51,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60033 states to 60033 states and 67817 transitions. [2025-03-16 15:23:51,734 INFO L78 Accepts]: Start accepts. Automaton has 60033 states and 67817 transitions. Word has length 1220 [2025-03-16 15:23:51,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:51,735 INFO L471 AbstractCegarLoop]: Abstraction has 60033 states and 67817 transitions. [2025-03-16 15:23:51,735 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 15:23:51,735 INFO L276 IsEmpty]: Start isEmpty. Operand 60033 states and 67817 transitions. [2025-03-16 15:23:51,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1280 [2025-03-16 15:23:51,745 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:51,745 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:51,745 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 15:23:51,746 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:51,746 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:51,746 INFO L85 PathProgramCache]: Analyzing trace with hash 912431168, now seen corresponding path program 1 times [2025-03-16 15:23:51,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:51,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473526091] [2025-03-16 15:23:51,747 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:51,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:51,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1279 statements into 1 equivalence classes. [2025-03-16 15:23:51,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1279 of 1279 statements. [2025-03-16 15:23:51,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:51,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 1926 backedges. 616 proven. 0 refuted. 0 times theorem prover too weak. 1310 trivial. 0 not checked. [2025-03-16 15:23:52,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:52,676 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473526091] [2025-03-16 15:23:52,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [473526091] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:52,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:23:52,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:23:52,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755013571] [2025-03-16 15:23:52,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:52,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:23:52,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:52,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:23:52,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:23:52,678 INFO L87 Difference]: Start difference. First operand 60033 states and 67817 transitions. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 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:23:54,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:54,307 INFO L93 Difference]: Finished difference Result 142145 states and 161688 transitions. [2025-03-16 15:23:54,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:23:54,308 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 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 1279 [2025-03-16 15:23:54,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:54,382 INFO L225 Difference]: With dead ends: 142145 [2025-03-16 15:23:54,382 INFO L226 Difference]: Without dead ends: 73833 [2025-03-16 15:23:54,427 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:23:54,427 INFO L435 NwaCegarLoop]: 934 mSDtfsCounter, 667 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1808 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 939 SdHoareTripleChecker+Invalid, 2379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 1808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:54,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 939 Invalid, 2379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 1808 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-16 15:23:54,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73833 states. [2025-03-16 15:23:55,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73833 to 69693. [2025-03-16 15:23:55,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69693 states, 69692 states have (on average 1.0936549388739023) internal successors, (76219), 69692 states have internal predecessors, (76219), 0 states have call successors, (0), 0 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:23:55,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69693 states to 69693 states and 76219 transitions. [2025-03-16 15:23:55,168 INFO L78 Accepts]: Start accepts. Automaton has 69693 states and 76219 transitions. Word has length 1279 [2025-03-16 15:23:55,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:23:55,169 INFO L471 AbstractCegarLoop]: Abstraction has 69693 states and 76219 transitions. [2025-03-16 15:23:55,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 0 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:23:55,170 INFO L276 IsEmpty]: Start isEmpty. Operand 69693 states and 76219 transitions. [2025-03-16 15:23:55,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1282 [2025-03-16 15:23:55,188 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:23:55,189 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, 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, 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, 3, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:23:55,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-16 15:23:55,189 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:23:55,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:23:55,190 INFO L85 PathProgramCache]: Analyzing trace with hash 394181249, now seen corresponding path program 1 times [2025-03-16 15:23:55,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:23:55,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073221075] [2025-03-16 15:23:55,190 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:55,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:23:55,277 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1281 statements into 1 equivalence classes. [2025-03-16 15:23:55,333 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1281 of 1281 statements. [2025-03-16 15:23:55,333 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:55,333 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:56,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 541 proven. 189 refuted. 0 times theorem prover too weak. 1203 trivial. 0 not checked. [2025-03-16 15:23:56,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:23:56,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073221075] [2025-03-16 15:23:56,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2073221075] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:23:56,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1848319776] [2025-03-16 15:23:56,298 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:23:56,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:23:56,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:23:56,300 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:23:56,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 15:23:56,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1281 statements into 1 equivalence classes. [2025-03-16 15:23:56,528 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1281 of 1281 statements. [2025-03-16 15:23:56,528 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:23:56,528 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:23:56,532 INFO L256 TraceCheckSpWp]: Trace formula consists of 1484 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-16 15:23:56,540 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:23:57,675 INFO L134 CoverageAnalysis]: Checked inductivity of 1933 backedges. 1143 proven. 0 refuted. 0 times theorem prover too weak. 790 trivial. 0 not checked. [2025-03-16 15:23:57,675 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:23:57,675 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1848319776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:23:57,675 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:23:57,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 7 [2025-03-16 15:23:57,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485626067] [2025-03-16 15:23:57,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:23:57,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:23:57,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:23:57,676 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:23:57,676 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:23:57,677 INFO L87 Difference]: Start difference. First operand 69693 states and 76219 transitions. Second operand has 5 states, 5 states have (on average 155.0) internal successors, (775), 4 states have internal predecessors, (775), 0 states have call successors, (0), 0 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:23:59,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:23:59,777 INFO L93 Difference]: Finished difference Result 141510 states and 154614 transitions. [2025-03-16 15:23:59,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 15:23:59,778 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 155.0) internal successors, (775), 4 states have internal predecessors, (775), 0 states have call successors, (0), 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 1281 [2025-03-16 15:23:59,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:23:59,847 INFO L225 Difference]: With dead ends: 141510 [2025-03-16 15:23:59,847 INFO L226 Difference]: Without dead ends: 72455 [2025-03-16 15:23:59,883 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1285 GetRequests, 1279 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-16 15:23:59,883 INFO L435 NwaCegarLoop]: 296 mSDtfsCounter, 968 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3501 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 314 SdHoareTripleChecker+Invalid, 3686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 3501 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 15:23:59,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 314 Invalid, 3686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 3501 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 15:23:59,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72455 states. [2025-03-16 15:24:00,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72455 to 71073. [2025-03-16 15:24:00,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71073 states, 71072 states have (on average 1.092216343989194) internal successors, (77626), 71072 states have internal predecessors, (77626), 0 states have call successors, (0), 0 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:24:00,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71073 states to 71073 states and 77626 transitions. [2025-03-16 15:24:00,453 INFO L78 Accepts]: Start accepts. Automaton has 71073 states and 77626 transitions. Word has length 1281 [2025-03-16 15:24:00,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:00,454 INFO L471 AbstractCegarLoop]: Abstraction has 71073 states and 77626 transitions. [2025-03-16 15:24:00,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 155.0) internal successors, (775), 4 states have internal predecessors, (775), 0 states have call successors, (0), 0 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:24:00,454 INFO L276 IsEmpty]: Start isEmpty. Operand 71073 states and 77626 transitions. [2025-03-16 15:24:00,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1297 [2025-03-16 15:24:00,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:00,464 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:00,471 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-16 15:24:00,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-16 15:24:00,664 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:00,665 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:00,665 INFO L85 PathProgramCache]: Analyzing trace with hash -1812152243, now seen corresponding path program 1 times [2025-03-16 15:24:00,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:00,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404392965] [2025-03-16 15:24:00,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:00,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:00,800 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1296 statements into 1 equivalence classes. [2025-03-16 15:24:00,835 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1296 of 1296 statements. [2025-03-16 15:24:00,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:00,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:01,594 INFO L134 CoverageAnalysis]: Checked inductivity of 1753 backedges. 1071 proven. 107 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 15:24:01,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:01,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404392965] [2025-03-16 15:24:01,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404392965] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:24:01,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [709476703] [2025-03-16 15:24:01,594 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:01,595 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:24:01,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:24:01,596 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:24:01,597 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 15:24:01,708 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1296 statements into 1 equivalence classes. [2025-03-16 15:24:01,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1296 of 1296 statements. [2025-03-16 15:24:01,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:01,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:01,841 INFO L256 TraceCheckSpWp]: Trace formula consists of 1479 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-16 15:24:01,850 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:24:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 1753 backedges. 1071 proven. 107 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 15:24:02,207 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:24:02,551 INFO L134 CoverageAnalysis]: Checked inductivity of 1753 backedges. 1178 proven. 0 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 15:24:02,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [709476703] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 15:24:02,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 15:24:02,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5, 5] total 10 [2025-03-16 15:24:02,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805919839] [2025-03-16 15:24:02,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:02,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 15:24:02,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:02,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 15:24:02,555 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:24:02,555 INFO L87 Difference]: Start difference. First operand 71073 states and 77626 transitions. Second operand has 5 states, 5 states have (on average 172.2) internal successors, (861), 5 states have internal predecessors, (861), 0 states have call successors, (0), 0 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:24:04,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:04,656 INFO L93 Difference]: Finished difference Result 152495 states and 167396 transitions. [2025-03-16 15:24:04,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 15:24:04,657 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 172.2) internal successors, (861), 5 states have internal predecessors, (861), 0 states have call successors, (0), 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 1296 [2025-03-16 15:24:04,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:04,752 INFO L225 Difference]: With dead ends: 152495 [2025-03-16 15:24:04,752 INFO L226 Difference]: Without dead ends: 82113 [2025-03-16 15:24:04,801 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2595 GetRequests, 2587 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2025-03-16 15:24:04,801 INFO L435 NwaCegarLoop]: 7 mSDtfsCounter, 1778 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1849 mSolverCounterSat, 906 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1778 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 2755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 906 IncrementalHoareTripleChecker+Valid, 1849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:04,801 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1778 Valid, 13 Invalid, 2755 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [906 Valid, 1849 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 15:24:04,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82113 states. [2025-03-16 15:24:05,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82113 to 76593. [2025-03-16 15:24:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76593 states, 76592 states have (on average 1.0966811155212033) internal successors, (83997), 76592 states have internal predecessors, (83997), 0 states have call successors, (0), 0 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:24:05,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76593 states to 76593 states and 83997 transitions. [2025-03-16 15:24:05,535 INFO L78 Accepts]: Start accepts. Automaton has 76593 states and 83997 transitions. Word has length 1296 [2025-03-16 15:24:05,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:05,535 INFO L471 AbstractCegarLoop]: Abstraction has 76593 states and 83997 transitions. [2025-03-16 15:24:05,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 172.2) internal successors, (861), 5 states have internal predecessors, (861), 0 states have call successors, (0), 0 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:24:05,536 INFO L276 IsEmpty]: Start isEmpty. Operand 76593 states and 83997 transitions. [2025-03-16 15:24:05,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1355 [2025-03-16 15:24:05,548 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:05,548 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:05,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-16 15:24:05,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-16 15:24:05,749 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:05,749 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:05,749 INFO L85 PathProgramCache]: Analyzing trace with hash -733259598, now seen corresponding path program 1 times [2025-03-16 15:24:05,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:05,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750658654] [2025-03-16 15:24:05,750 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:05,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:05,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1354 statements into 1 equivalence classes. [2025-03-16 15:24:05,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1354 of 1354 statements. [2025-03-16 15:24:05,936 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:05,936 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:06,832 INFO L134 CoverageAnalysis]: Checked inductivity of 2377 backedges. 1097 proven. 719 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2025-03-16 15:24:06,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:06,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750658654] [2025-03-16 15:24:06,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750658654] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:24:06,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [412341960] [2025-03-16 15:24:06,832 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:06,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:24:06,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:24:06,867 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:24:06,868 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 15:24:06,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1354 statements into 1 equivalence classes. [2025-03-16 15:24:07,087 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1354 of 1354 statements. [2025-03-16 15:24:07,087 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:07,087 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:07,091 INFO L256 TraceCheckSpWp]: Trace formula consists of 1590 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:24:07,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:24:07,304 INFO L134 CoverageAnalysis]: Checked inductivity of 2377 backedges. 1230 proven. 0 refuted. 0 times theorem prover too weak. 1147 trivial. 0 not checked. [2025-03-16 15:24:07,304 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:24:07,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [412341960] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:07,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:24:07,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-16 15:24:07,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741349917] [2025-03-16 15:24:07,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:07,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:07,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:07,306 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:07,307 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:24:07,307 INFO L87 Difference]: Start difference. First operand 76593 states and 83997 transitions. Second operand has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 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:24:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:08,791 INFO L93 Difference]: Finished difference Result 175265 states and 192848 transitions. [2025-03-16 15:24:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:08,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 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 1354 [2025-03-16 15:24:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:08,887 INFO L225 Difference]: With dead ends: 175265 [2025-03-16 15:24:08,887 INFO L226 Difference]: Without dead ends: 98673 [2025-03-16 15:24:08,936 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1359 GetRequests, 1354 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-03-16 15:24:08,936 INFO L435 NwaCegarLoop]: 892 mSDtfsCounter, 595 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1661 mSolverCounterSat, 303 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 897 SdHoareTripleChecker+Invalid, 1964 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 303 IncrementalHoareTripleChecker+Valid, 1661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:08,936 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 897 Invalid, 1964 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [303 Valid, 1661 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:24:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98673 states. [2025-03-16 15:24:09,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98673 to 97983. [2025-03-16 15:24:09,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97983 states, 97982 states have (on average 1.0857912677838786) internal successors, (106388), 97982 states have internal predecessors, (106388), 0 states have call successors, (0), 0 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:24:09,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97983 states to 97983 states and 106388 transitions. [2025-03-16 15:24:09,692 INFO L78 Accepts]: Start accepts. Automaton has 97983 states and 106388 transitions. Word has length 1354 [2025-03-16 15:24:09,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:09,693 INFO L471 AbstractCegarLoop]: Abstraction has 97983 states and 106388 transitions. [2025-03-16 15:24:09,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 240.33333333333334) internal successors, (721), 3 states have internal predecessors, (721), 0 states have call successors, (0), 0 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:24:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 97983 states and 106388 transitions. [2025-03-16 15:24:09,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1376 [2025-03-16 15:24:09,705 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:09,705 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:09,712 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 15:24:09,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-16 15:24:09,906 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:09,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:09,907 INFO L85 PathProgramCache]: Analyzing trace with hash -357211703, now seen corresponding path program 1 times [2025-03-16 15:24:09,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:09,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1645577893] [2025-03-16 15:24:09,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:09,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:09,957 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1375 statements into 1 equivalence classes. [2025-03-16 15:24:09,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1375 of 1375 statements. [2025-03-16 15:24:09,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:09,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:11,231 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 1150 proven. 1123 refuted. 0 times theorem prover too weak. 499 trivial. 0 not checked. [2025-03-16 15:24:11,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:11,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1645577893] [2025-03-16 15:24:11,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1645577893] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:24:11,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504436928] [2025-03-16 15:24:11,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:11,232 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:24:11,232 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:24:11,234 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:24:11,236 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 15:24:11,354 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1375 statements into 1 equivalence classes. [2025-03-16 15:24:11,533 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1375 of 1375 statements. [2025-03-16 15:24:11,533 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:11,533 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:11,538 INFO L256 TraceCheckSpWp]: Trace formula consists of 1633 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 15:24:11,549 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:24:11,689 INFO L134 CoverageAnalysis]: Checked inductivity of 2772 backedges. 1257 proven. 0 refuted. 0 times theorem prover too weak. 1515 trivial. 0 not checked. [2025-03-16 15:24:11,689 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 15:24:11,689 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504436928] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:11,689 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 15:24:11,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-16 15:24:11,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719877540] [2025-03-16 15:24:11,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:11,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:11,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:11,691 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:11,691 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:24:11,691 INFO L87 Difference]: Start difference. First operand 97983 states and 106388 transitions. Second operand has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 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:24:13,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:13,291 INFO L93 Difference]: Finished difference Result 193205 states and 209780 transitions. [2025-03-16 15:24:13,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:13,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 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 1375 [2025-03-16 15:24:13,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:13,396 INFO L225 Difference]: With dead ends: 193205 [2025-03-16 15:24:13,396 INFO L226 Difference]: Without dead ends: 95913 [2025-03-16 15:24:13,461 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1382 GetRequests, 1375 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-16 15:24:13,461 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 679 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1626 mSolverCounterSat, 230 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 679 SdHoareTripleChecker+Valid, 899 SdHoareTripleChecker+Invalid, 1856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 230 IncrementalHoareTripleChecker+Valid, 1626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:13,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [679 Valid, 899 Invalid, 1856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [230 Valid, 1626 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-16 15:24:13,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95913 states. [2025-03-16 15:24:14,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95913 to 80043. [2025-03-16 15:24:14,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80043 states, 80042 states have (on average 1.0538342370255616) internal successors, (84351), 80042 states have internal predecessors, (84351), 0 states have call successors, (0), 0 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:24:14,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80043 states to 80043 states and 84351 transitions. [2025-03-16 15:24:14,320 INFO L78 Accepts]: Start accepts. Automaton has 80043 states and 84351 transitions. Word has length 1375 [2025-03-16 15:24:14,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:14,321 INFO L471 AbstractCegarLoop]: Abstraction has 80043 states and 84351 transitions. [2025-03-16 15:24:14,321 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 216.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 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:24:14,321 INFO L276 IsEmpty]: Start isEmpty. Operand 80043 states and 84351 transitions. [2025-03-16 15:24:14,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1410 [2025-03-16 15:24:14,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:14,335 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, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 15:24:14,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-16 15:24:14,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:24:14,537 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:14,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:14,537 INFO L85 PathProgramCache]: Analyzing trace with hash 930572731, now seen corresponding path program 1 times [2025-03-16 15:24:14,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:14,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975816004] [2025-03-16 15:24:14,538 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:14,538 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:14,590 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1409 statements into 1 equivalence classes. [2025-03-16 15:24:14,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1409 of 1409 statements. [2025-03-16 15:24:14,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:14,628 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:15,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2248 backedges. 656 proven. 0 refuted. 0 times theorem prover too weak. 1592 trivial. 0 not checked. [2025-03-16 15:24:15,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:15,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975816004] [2025-03-16 15:24:15,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975816004] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 15:24:15,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 15:24:15,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 15:24:15,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650264932] [2025-03-16 15:24:15,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 15:24:15,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 15:24:15,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:15,024 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 15:24:15,024 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 15:24:15,024 INFO L87 Difference]: Start difference. First operand 80043 states and 84351 transitions. Second operand has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 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:24:16,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 15:24:16,464 INFO L93 Difference]: Finished difference Result 173195 states and 182550 transitions. [2025-03-16 15:24:16,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 15:24:16,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 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 1409 [2025-03-16 15:24:16,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 15:24:16,556 INFO L225 Difference]: With dead ends: 173195 [2025-03-16 15:24:16,556 INFO L226 Difference]: Without dead ends: 93153 [2025-03-16 15:24:16,601 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:24:16,601 INFO L435 NwaCegarLoop]: 948 mSDtfsCounter, 630 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1680 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 630 SdHoareTripleChecker+Valid, 954 SdHoareTripleChecker+Invalid, 1808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-16 15:24:16,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [630 Valid, 954 Invalid, 1808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1680 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-16 15:24:16,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93153 states. [2025-03-16 15:24:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93153 to 90393. [2025-03-16 15:24:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90393 states, 90392 states have (on average 1.0499159217629879) internal successors, (94904), 90392 states have internal predecessors, (94904), 0 states have call successors, (0), 0 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:24:17,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90393 states to 90393 states and 94904 transitions. [2025-03-16 15:24:17,657 INFO L78 Accepts]: Start accepts. Automaton has 90393 states and 94904 transitions. Word has length 1409 [2025-03-16 15:24:17,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 15:24:17,658 INFO L471 AbstractCegarLoop]: Abstraction has 90393 states and 94904 transitions. [2025-03-16 15:24:17,658 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 214.33333333333334) internal successors, (643), 3 states have internal predecessors, (643), 0 states have call successors, (0), 0 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:24:17,658 INFO L276 IsEmpty]: Start isEmpty. Operand 90393 states and 94904 transitions. [2025-03-16 15:24:17,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1453 [2025-03-16 15:24:17,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 15:24:17,674 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:24:17,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 15:24:17,674 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 15:24:17,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 15:24:17,675 INFO L85 PathProgramCache]: Analyzing trace with hash -832100831, now seen corresponding path program 1 times [2025-03-16 15:24:17,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 15:24:17,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241388435] [2025-03-16 15:24:17,675 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:17,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 15:24:17,736 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1452 statements into 1 equivalence classes. [2025-03-16 15:24:17,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1452 of 1452 statements. [2025-03-16 15:24:17,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:17,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:19,306 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 782 proven. 637 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 15:24:19,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 15:24:19,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241388435] [2025-03-16 15:24:19,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1241388435] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 15:24:19,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [466101659] [2025-03-16 15:24:19,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 15:24:19,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 15:24:19,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 15:24:19,309 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 15:24:19,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 15:24:19,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1452 statements into 1 equivalence classes. [2025-03-16 15:24:19,608 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1452 of 1452 statements. [2025-03-16 15:24:19,608 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 15:24:19,608 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 15:24:19,612 INFO L256 TraceCheckSpWp]: Trace formula consists of 1642 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 15:24:19,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 15:24:22,735 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 782 proven. 637 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 15:24:22,736 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 15:24:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1994 backedges. 1273 proven. 146 refuted. 0 times theorem prover too weak. 575 trivial. 0 not checked. [2025-03-16 15:24:23,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [466101659] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 15:24:23,254 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 15:24:23,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 16 [2025-03-16 15:24:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679479223] [2025-03-16 15:24:23,254 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 15:24:23,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-03-16 15:24:23,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 15:24:23,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-03-16 15:24:23,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=163, Unknown=0, NotChecked=0, Total=240 [2025-03-16 15:24:23,257 INFO L87 Difference]: Start difference. First operand 90393 states and 94904 transitions. Second operand has 16 states, 16 states have (on average 158.25) internal successors, (2532), 16 states have internal predecessors, (2532), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)