./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label37.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/Problem12_label37.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 216d354bd2b39cc08159a7e1d05b12b6bb34b7a88f8458e31e862be3f2691415 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 14:56:16,176 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 14:56:16,231 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 14:56:16,237 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 14:56:16,237 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 14:56:16,261 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 14:56:16,261 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 14:56:16,262 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 14:56:16,262 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 14:56:16,262 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 14:56:16,263 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 14:56:16,263 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 14:56:16,263 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 14:56:16,263 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 14:56:16,263 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 14:56:16,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 14:56:16,264 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:56:16,264 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 14:56:16,264 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 14:56:16,265 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 14:56:16,265 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 14:56:16,265 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 14:56:16,265 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 14:56:16,265 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 14:56:16,265 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 14:56:16,265 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 14:56:16,265 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 14:56:16,265 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 -> 216d354bd2b39cc08159a7e1d05b12b6bb34b7a88f8458e31e862be3f2691415 [2025-03-16 14:56:16,504 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 14:56:16,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 14:56:16,515 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 14:56:16,516 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 14:56:16,516 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 14:56:16,517 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label37.c [2025-03-16 14:56:17,598 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f3d367e/9577c674a76e48f0b53cad9395b46fc5/FLAG1c6d8765b [2025-03-16 14:56:17,966 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 14:56:17,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label37.c [2025-03-16 14:56:17,993 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f3d367e/9577c674a76e48f0b53cad9395b46fc5/FLAG1c6d8765b [2025-03-16 14:56:18,168 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c9f3d367e/9577c674a76e48f0b53cad9395b46fc5 [2025-03-16 14:56:18,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 14:56:18,170 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 14:56:18,171 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 14:56:18,172 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 14:56:18,174 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 14:56:18,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:56:18" (1/1) ... [2025-03-16 14:56:18,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@643b2753 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:18, skipping insertion in model container [2025-03-16 14:56:18,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 02:56:18" (1/1) ... [2025-03-16 14:56:18,252 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 14:56:18,413 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/Problem12_label37.c[2005,2018] [2025-03-16 14:56:18,939 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:56:18,947 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 14:56:18,957 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/Problem12_label37.c[2005,2018] [2025-03-16 14:56:19,203 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 14:56:19,219 INFO L204 MainTranslator]: Completed translation [2025-03-16 14:56:19,220 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19 WrapperNode [2025-03-16 14:56:19,221 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 14:56:19,221 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 14:56:19,221 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 14:56:19,221 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 14:56:19,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (1/1) ... [2025-03-16 14:56:19,261 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (1/1) ... [2025-03-16 14:56:19,469 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4758 [2025-03-16 14:56:19,470 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 14:56:19,470 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 14:56:19,471 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 14:56:19,471 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 14:56:19,477 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (1/1) ... [2025-03-16 14:56:19,477 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (1/1) ... [2025-03-16 14:56:19,509 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (1/1) ... [2025-03-16 14:56:19,692 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 14:56:19,693 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (1/1) ... [2025-03-16 14:56:19,693 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (1/1) ... [2025-03-16 14:56:19,805 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (1/1) ... [2025-03-16 14:56:19,821 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (1/1) ... [2025-03-16 14:56:19,841 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (1/1) ... [2025-03-16 14:56:19,862 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (1/1) ... [2025-03-16 14:56:19,899 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 14:56:19,900 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 14:56:19,900 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 14:56:19,901 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 14:56:19,901 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (1/1) ... [2025-03-16 14:56:19,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 14:56:19,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:56:19,926 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 14:56:19,928 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 14:56:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 14:56:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 14:56:19,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 14:56:19,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 14:56:19,985 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 14:56:19,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 14:56:23,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L4665: havoc calculate_output3_#t~ret11#1; [2025-03-16 14:56:23,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L1696: havoc calculate_output_#t~ret9#1; [2025-03-16 14:56:23,394 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L3175: havoc calculate_output2_#t~ret10#1; [2025-03-16 14:56:23,510 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2025-03-16 14:56:23,511 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 14:56:23,538 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 14:56:23,539 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 14:56:23,539 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:56:23 BoogieIcfgContainer [2025-03-16 14:56:23,542 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 14:56:23,544 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 14:56:23,544 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 14:56:23,549 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 14:56:23,549 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 02:56:18" (1/3) ... [2025-03-16 14:56:23,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef0936a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:56:23, skipping insertion in model container [2025-03-16 14:56:23,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 02:56:19" (2/3) ... [2025-03-16 14:56:23,552 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ef0936a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 02:56:23, skipping insertion in model container [2025-03-16 14:56:23,552 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 02:56:23" (3/3) ... [2025-03-16 14:56:23,553 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem12_label37.c [2025-03-16 14:56:23,563 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 14:56:23,564 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem12_label37.c that has 1 procedures, 757 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-16 14:56:23,634 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 14:56:23,645 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;@7ab9e7d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 14:56:23,646 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 14:56:23,652 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 0 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 14:56:23,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 14:56:23,656 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:23,657 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:23,657 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:23,661 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:23,662 INFO L85 PathProgramCache]: Analyzing trace with hash 1673956690, now seen corresponding path program 1 times [2025-03-16 14:56:23,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:23,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162006576] [2025-03-16 14:56:23,668 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:23,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:23,719 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 14:56:23,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 14:56:23,733 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:23,733 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:23,769 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 14:56:23,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:23,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162006576] [2025-03-16 14:56:23,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162006576] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:23,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:23,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:56:23,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040437984] [2025-03-16 14:56:23,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:23,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-16 14:56:23,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:23,788 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-16 14:56:23,788 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-16 14:56:23,792 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9907284768211921) internal successors, (1503), 756 states have internal predecessors, (1503), 0 states have call successors, (0), 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 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 14:56:23,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:23,866 INFO L93 Difference]: Finished difference Result 1513 states and 3005 transitions. [2025-03-16 14:56:23,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-16 14:56:23,867 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-03-16 14:56:23,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:23,876 INFO L225 Difference]: With dead ends: 1513 [2025-03-16 14:56:23,876 INFO L226 Difference]: Without dead ends: 754 [2025-03-16 14:56:23,880 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 14:56:23,882 INFO L435 NwaCegarLoop]: 1441 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, 1441 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 14:56:23,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 1441 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 14:56:23,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-03-16 14:56:23,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 754. [2025-03-16 14:56:23,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 754 states, 753 states have (on average 1.9096945551128819) internal successors, (1438), 753 states have internal predecessors, (1438), 0 states have call successors, (0), 0 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 14:56:23,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 754 states to 754 states and 1438 transitions. [2025-03-16 14:56:23,938 INFO L78 Accepts]: Start accepts. Automaton has 754 states and 1438 transitions. Word has length 12 [2025-03-16 14:56:23,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:23,938 INFO L471 AbstractCegarLoop]: Abstraction has 754 states and 1438 transitions. [2025-03-16 14:56:23,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 14:56:23,939 INFO L276 IsEmpty]: Start isEmpty. Operand 754 states and 1438 transitions. [2025-03-16 14:56:23,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2025-03-16 14:56:23,939 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:23,939 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:23,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 14:56:23,939 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:23,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:23,943 INFO L85 PathProgramCache]: Analyzing trace with hash -1768567629, now seen corresponding path program 1 times [2025-03-16 14:56:23,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:23,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122456803] [2025-03-16 14:56:23,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:23,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:23,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 12 statements into 1 equivalence classes. [2025-03-16 14:56:23,964 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 12 of 12 statements. [2025-03-16 14:56:23,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:23,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:24,034 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 14:56:24,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:24,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122456803] [2025-03-16 14:56:24,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122456803] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:24,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:24,036 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:56:24,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846695003] [2025-03-16 14:56:24,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:24,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:24,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:24,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:24,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:24,039 INFO L87 Difference]: Start difference. First operand 754 states and 1438 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 14:56:26,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:26,610 INFO L93 Difference]: Finished difference Result 2258 states and 4311 transitions. [2025-03-16 14:56:26,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:26,610 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2025-03-16 14:56:26,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:26,616 INFO L225 Difference]: With dead ends: 2258 [2025-03-16 14:56:26,616 INFO L226 Difference]: Without dead ends: 1505 [2025-03-16 14:56:26,617 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 14:56:26,618 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 805 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2274 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 805 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 2865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:26,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [805 Valid, 427 Invalid, 2865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2274 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-16 14:56:26,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1505 states. [2025-03-16 14:56:26,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1505 to 1505. [2025-03-16 14:56:26,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1505 states, 1504 states have (on average 1.6389627659574468) internal successors, (2465), 1504 states have internal predecessors, (2465), 0 states have call successors, (0), 0 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 14:56:26,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1505 states to 1505 states and 2465 transitions. [2025-03-16 14:56:26,668 INFO L78 Accepts]: Start accepts. Automaton has 1505 states and 2465 transitions. Word has length 12 [2025-03-16 14:56:26,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:26,668 INFO L471 AbstractCegarLoop]: Abstraction has 1505 states and 2465 transitions. [2025-03-16 14:56:26,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 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 14:56:26,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1505 states and 2465 transitions. [2025-03-16 14:56:26,669 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2025-03-16 14:56:26,670 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:26,670 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:56:26,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 14:56:26,670 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:26,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1382443171, now seen corresponding path program 1 times [2025-03-16 14:56:26,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:26,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1387478114] [2025-03-16 14:56:26,671 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:26,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:26,688 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 14:56:26,705 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 14:56:26,705 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:26,705 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:27,046 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:27,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:27,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1387478114] [2025-03-16 14:56:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1387478114] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:56:27,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135244367] [2025-03-16 14:56:27,048 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:27,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:56:27,048 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:56:27,050 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 14:56:27,052 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 14:56:27,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 83 statements into 1 equivalence classes. [2025-03-16 14:56:27,116 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 83 of 83 statements. [2025-03-16 14:56:27,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:27,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:27,119 INFO L256 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:56:27,124 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:56:27,165 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:27,166 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:56:27,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135244367] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:27,167 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:56:27,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:56:27,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722673245] [2025-03-16 14:56:27,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:27,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:27,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:27,168 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:27,168 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:56:27,168 INFO L87 Difference]: Start difference. First operand 1505 states and 2465 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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 14:56:29,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:29,867 INFO L93 Difference]: Finished difference Result 4511 states and 7392 transitions. [2025-03-16 14:56:29,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:29,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 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 83 [2025-03-16 14:56:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:29,876 INFO L225 Difference]: With dead ends: 4511 [2025-03-16 14:56:29,876 INFO L226 Difference]: Without dead ends: 3007 [2025-03-16 14:56:29,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:56:29,880 INFO L435 NwaCegarLoop]: 1382 mSDtfsCounter, 766 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1982 mSolverCounterSat, 885 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 766 SdHoareTripleChecker+Valid, 1389 SdHoareTripleChecker+Invalid, 2867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 885 IncrementalHoareTripleChecker+Valid, 1982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:29,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [766 Valid, 1389 Invalid, 2867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [885 Valid, 1982 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:56:29,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3007 states. [2025-03-16 14:56:29,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3007 to 3007. [2025-03-16 14:56:29,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3007 states, 3006 states have (on average 1.363606121091151) internal successors, (4099), 3006 states have internal predecessors, (4099), 0 states have call successors, (0), 0 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 14:56:29,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3007 states to 3007 states and 4099 transitions. [2025-03-16 14:56:29,929 INFO L78 Accepts]: Start accepts. Automaton has 3007 states and 4099 transitions. Word has length 83 [2025-03-16 14:56:29,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:29,930 INFO L471 AbstractCegarLoop]: Abstraction has 3007 states and 4099 transitions. [2025-03-16 14:56:29,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 3 states have internal predecessors, (83), 0 states have call successors, (0), 0 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 14:56:29,930 INFO L276 IsEmpty]: Start isEmpty. Operand 3007 states and 4099 transitions. [2025-03-16 14:56:29,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2025-03-16 14:56:29,932 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:29,932 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:56:29,939 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 14:56:30,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:56:30,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:30,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:30,134 INFO L85 PathProgramCache]: Analyzing trace with hash 573244588, now seen corresponding path program 1 times [2025-03-16 14:56:30,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:30,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107640643] [2025-03-16 14:56:30,134 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:30,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:30,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 86 statements into 1 equivalence classes. [2025-03-16 14:56:30,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 86 of 86 statements. [2025-03-16 14:56:30,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:30,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:30,246 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:30,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:30,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107640643] [2025-03-16 14:56:30,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107640643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:30,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:30,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:56:30,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652855775] [2025-03-16 14:56:30,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:30,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:30,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:30,247 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:30,247 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:30,247 INFO L87 Difference]: Start difference. First operand 3007 states and 4099 transitions. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 14:56:32,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:32,204 INFO L93 Difference]: Finished difference Result 7515 states and 10660 transitions. [2025-03-16 14:56:32,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:32,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 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 86 [2025-03-16 14:56:32,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:32,217 INFO L225 Difference]: With dead ends: 7515 [2025-03-16 14:56:32,217 INFO L226 Difference]: Without dead ends: 4509 [2025-03-16 14:56:32,221 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 14:56:32,222 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 748 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 910 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 748 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 2926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 910 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:32,223 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [748 Valid, 519 Invalid, 2926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [910 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:56:32,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4509 states. [2025-03-16 14:56:32,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4509 to 4509. [2025-03-16 14:56:32,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4509 states, 4508 states have (on average 1.3251996450754215) internal successors, (5974), 4508 states have internal predecessors, (5974), 0 states have call successors, (0), 0 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 14:56:32,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4509 states to 4509 states and 5974 transitions. [2025-03-16 14:56:32,334 INFO L78 Accepts]: Start accepts. Automaton has 4509 states and 5974 transitions. Word has length 86 [2025-03-16 14:56:32,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:32,334 INFO L471 AbstractCegarLoop]: Abstraction has 4509 states and 5974 transitions. [2025-03-16 14:56:32,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 2 states have internal predecessors, (86), 0 states have call successors, (0), 0 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 14:56:32,335 INFO L276 IsEmpty]: Start isEmpty. Operand 4509 states and 5974 transitions. [2025-03-16 14:56:32,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2025-03-16 14:56:32,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:32,336 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:56:32,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-16 14:56:32,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:32,337 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:32,337 INFO L85 PathProgramCache]: Analyzing trace with hash 1019971878, now seen corresponding path program 1 times [2025-03-16 14:56:32,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:32,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270500868] [2025-03-16 14:56:32,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:32,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:32,346 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 97 statements into 1 equivalence classes. [2025-03-16 14:56:32,352 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 97 of 97 statements. [2025-03-16 14:56:32,352 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:32,353 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:32,449 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:32,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:32,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270500868] [2025-03-16 14:56:32,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270500868] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:32,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:32,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-16 14:56:32,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920661592] [2025-03-16 14:56:32,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:32,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:32,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:32,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:32,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:32,453 INFO L87 Difference]: Start difference. First operand 4509 states and 5974 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 14:56:34,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:34,683 INFO L93 Difference]: Finished difference Result 13525 states and 17920 transitions. [2025-03-16 14:56:34,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:34,684 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2025-03-16 14:56:34,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:34,707 INFO L225 Difference]: With dead ends: 13525 [2025-03-16 14:56:34,707 INFO L226 Difference]: Without dead ends: 9017 [2025-03-16 14:56:34,712 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 14:56:34,713 INFO L435 NwaCegarLoop]: 610 mSDtfsCounter, 716 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2339 mSolverCounterSat, 629 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 716 SdHoareTripleChecker+Valid, 617 SdHoareTripleChecker+Invalid, 2968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 629 IncrementalHoareTripleChecker+Valid, 2339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:34,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [716 Valid, 617 Invalid, 2968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [629 Valid, 2339 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:56:34,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9017 states. [2025-03-16 14:56:34,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9017 to 9015. [2025-03-16 14:56:34,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9015 states, 9014 states have (on average 1.2167739072553805) internal successors, (10968), 9014 states have internal predecessors, (10968), 0 states have call successors, (0), 0 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 14:56:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9015 states to 9015 states and 10968 transitions. [2025-03-16 14:56:34,826 INFO L78 Accepts]: Start accepts. Automaton has 9015 states and 10968 transitions. Word has length 97 [2025-03-16 14:56:34,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:34,826 INFO L471 AbstractCegarLoop]: Abstraction has 9015 states and 10968 transitions. [2025-03-16 14:56:34,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 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 14:56:34,827 INFO L276 IsEmpty]: Start isEmpty. Operand 9015 states and 10968 transitions. [2025-03-16 14:56:34,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-03-16 14:56:34,828 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:34,828 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 14:56:34,828 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-16 14:56:34,828 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:34,829 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:34,829 INFO L85 PathProgramCache]: Analyzing trace with hash 1017604045, now seen corresponding path program 1 times [2025-03-16 14:56:34,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:34,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712304512] [2025-03-16 14:56:34,829 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:34,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:34,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-03-16 14:56:34,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-03-16 14:56:34,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:34,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:35,108 INFO L134 CoverageAnalysis]: Checked inductivity of 88 backedges. 88 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:35,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:35,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712304512] [2025-03-16 14:56:35,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712304512] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:35,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:35,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:35,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642471965] [2025-03-16 14:56:35,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:35,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:56:35,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:35,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:56:35,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:56:35,110 INFO L87 Difference]: Start difference. First operand 9015 states and 10968 transitions. Second operand has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:37,363 INFO L93 Difference]: Finished difference Result 22574 states and 26967 transitions. [2025-03-16 14:56:37,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:56:37,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 151 [2025-03-16 14:56:37,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:37,394 INFO L225 Difference]: With dead ends: 22574 [2025-03-16 14:56:37,394 INFO L226 Difference]: Without dead ends: 12021 [2025-03-16 14:56:37,402 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 14:56:37,403 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 705 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 3107 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 705 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 3379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 3107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:37,403 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [705 Valid, 700 Invalid, 3379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 3107 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:56:37,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12021 states. [2025-03-16 14:56:37,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12021 to 12019. [2025-03-16 14:56:37,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12019 states, 12018 states have (on average 1.1626726576801465) internal successors, (13973), 12018 states have internal predecessors, (13973), 0 states have call successors, (0), 0 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 14:56:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12019 states to 12019 states and 13973 transitions. [2025-03-16 14:56:37,547 INFO L78 Accepts]: Start accepts. Automaton has 12019 states and 13973 transitions. Word has length 151 [2025-03-16 14:56:37,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:37,547 INFO L471 AbstractCegarLoop]: Abstraction has 12019 states and 13973 transitions. [2025-03-16 14:56:37,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.75) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:37,552 INFO L276 IsEmpty]: Start isEmpty. Operand 12019 states and 13973 transitions. [2025-03-16 14:56:37,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2025-03-16 14:56:37,553 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:37,553 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:56:37,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-16 14:56:37,553 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:37,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:37,553 INFO L85 PathProgramCache]: Analyzing trace with hash 1105820187, now seen corresponding path program 1 times [2025-03-16 14:56:37,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:37,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239145343] [2025-03-16 14:56:37,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:37,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:37,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 156 statements into 1 equivalence classes. [2025-03-16 14:56:37,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 156 of 156 statements. [2025-03-16 14:56:37,582 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:37,582 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:38,090 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:38,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:38,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239145343] [2025-03-16 14:56:38,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239145343] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:38,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:38,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:56:38,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145206324] [2025-03-16 14:56:38,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:38,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-16 14:56:38,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:38,094 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-16 14:56:38,094 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:56:38,094 INFO L87 Difference]: Start difference. First operand 12019 states and 13973 transitions. Second operand has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 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 14:56:42,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:42,150 INFO L93 Difference]: Finished difference Result 30045 states and 34542 transitions. [2025-03-16 14:56:42,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-16 14:56:42,151 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 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 156 [2025-03-16 14:56:42,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:42,177 INFO L225 Difference]: With dead ends: 30045 [2025-03-16 14:56:42,177 INFO L226 Difference]: Without dead ends: 18778 [2025-03-16 14:56:42,185 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:56:42,187 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 2114 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 7395 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2114 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 7548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 7395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:42,187 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2114 Valid, 654 Invalid, 7548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 7395 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-03-16 14:56:42,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18778 states. [2025-03-16 14:56:42,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18778 to 18027. [2025-03-16 14:56:42,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18027 states, 18026 states have (on average 1.1236547209586154) internal successors, (20255), 18026 states have internal predecessors, (20255), 0 states have call successors, (0), 0 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 14:56:42,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18027 states to 18027 states and 20255 transitions. [2025-03-16 14:56:42,419 INFO L78 Accepts]: Start accepts. Automaton has 18027 states and 20255 transitions. Word has length 156 [2025-03-16 14:56:42,420 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:42,420 INFO L471 AbstractCegarLoop]: Abstraction has 18027 states and 20255 transitions. [2025-03-16 14:56:42,420 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.2) internal successors, (156), 4 states have internal predecessors, (156), 0 states have call successors, (0), 0 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 14:56:42,420 INFO L276 IsEmpty]: Start isEmpty. Operand 18027 states and 20255 transitions. [2025-03-16 14:56:42,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2025-03-16 14:56:42,422 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:42,422 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:56:42,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-16 14:56:42,430 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:42,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:42,431 INFO L85 PathProgramCache]: Analyzing trace with hash 1894584327, now seen corresponding path program 1 times [2025-03-16 14:56:42,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:42,431 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489132034] [2025-03-16 14:56:42,431 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:42,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:42,472 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 238 statements into 1 equivalence classes. [2025-03-16 14:56:42,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 238 of 238 statements. [2025-03-16 14:56:42,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:42,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:42,716 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:56:42,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:42,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489132034] [2025-03-16 14:56:42,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489132034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:42,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:42,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:42,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36766051] [2025-03-16 14:56:42,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:42,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:42,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:42,721 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:42,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:42,721 INFO L87 Difference]: Start difference. First operand 18027 states and 20255 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 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 14:56:45,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:45,137 INFO L93 Difference]: Finished difference Result 51073 states and 57667 transitions. [2025-03-16 14:56:45,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:45,137 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 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 238 [2025-03-16 14:56:45,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:45,190 INFO L225 Difference]: With dead ends: 51073 [2025-03-16 14:56:45,191 INFO L226 Difference]: Without dead ends: 33047 [2025-03-16 14:56:45,203 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 14:56:45,204 INFO L435 NwaCegarLoop]: 1336 mSDtfsCounter, 669 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2705 mSolverCounterSat, 373 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 1342 SdHoareTripleChecker+Invalid, 3078 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 373 IncrementalHoareTripleChecker+Valid, 2705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:45,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 1342 Invalid, 3078 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [373 Valid, 2705 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2025-03-16 14:56:45,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33047 states. [2025-03-16 14:56:45,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33047 to 30043. [2025-03-16 14:56:45,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30043 states, 30042 states have (on average 1.1242593702150323) internal successors, (33775), 30042 states have internal predecessors, (33775), 0 states have call successors, (0), 0 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 14:56:45,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30043 states to 30043 states and 33775 transitions. [2025-03-16 14:56:45,528 INFO L78 Accepts]: Start accepts. Automaton has 30043 states and 33775 transitions. Word has length 238 [2025-03-16 14:56:45,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:45,528 INFO L471 AbstractCegarLoop]: Abstraction has 30043 states and 33775 transitions. [2025-03-16 14:56:45,528 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 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 14:56:45,528 INFO L276 IsEmpty]: Start isEmpty. Operand 30043 states and 33775 transitions. [2025-03-16 14:56:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 243 [2025-03-16 14:56:45,530 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:45,530 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:56:45,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-16 14:56:45,531 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:45,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:45,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1251865853, now seen corresponding path program 1 times [2025-03-16 14:56:45,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:45,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057814648] [2025-03-16 14:56:45,532 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:45,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:45,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 242 statements into 1 equivalence classes. [2025-03-16 14:56:45,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 242 of 242 statements. [2025-03-16 14:56:45,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:45,563 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:45,724 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:56:45,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:45,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057814648] [2025-03-16 14:56:45,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057814648] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:45,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:45,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:45,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1985334611] [2025-03-16 14:56:45,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:45,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:45,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:45,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:45,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:45,726 INFO L87 Difference]: Start difference. First operand 30043 states and 33775 transitions. Second operand has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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 14:56:47,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:47,855 INFO L93 Difference]: Finished difference Result 60085 states and 67549 transitions. [2025-03-16 14:56:47,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:47,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 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 242 [2025-03-16 14:56:47,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:47,893 INFO L225 Difference]: With dead ends: 60085 [2025-03-16 14:56:47,893 INFO L226 Difference]: Without dead ends: 30043 [2025-03-16 14:56:47,909 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 14:56:47,910 INFO L435 NwaCegarLoop]: 989 mSDtfsCounter, 814 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2312 mSolverCounterSat, 395 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 814 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 395 IncrementalHoareTripleChecker+Valid, 2312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:47,910 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [814 Valid, 996 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [395 Valid, 2312 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-03-16 14:56:47,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30043 states. [2025-03-16 14:56:48,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30043 to 30043. [2025-03-16 14:56:48,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30043 states, 30042 states have (on average 1.0977964183476465) internal successors, (32980), 30042 states have internal predecessors, (32980), 0 states have call successors, (0), 0 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 14:56:48,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30043 states to 30043 states and 32980 transitions. [2025-03-16 14:56:48,222 INFO L78 Accepts]: Start accepts. Automaton has 30043 states and 32980 transitions. Word has length 242 [2025-03-16 14:56:48,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:48,222 INFO L471 AbstractCegarLoop]: Abstraction has 30043 states and 32980 transitions. [2025-03-16 14:56:48,222 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.0) internal successors, (159), 3 states have internal predecessors, (159), 0 states have call successors, (0), 0 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 14:56:48,223 INFO L276 IsEmpty]: Start isEmpty. Operand 30043 states and 32980 transitions. [2025-03-16 14:56:48,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 319 [2025-03-16 14:56:48,229 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:48,230 INFO L218 NwaCegarLoop]: trace histogram [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, 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] [2025-03-16 14:56:48,230 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-16 14:56:48,230 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:48,231 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:48,231 INFO L85 PathProgramCache]: Analyzing trace with hash -826698181, now seen corresponding path program 1 times [2025-03-16 14:56:48,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:48,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614699858] [2025-03-16 14:56:48,231 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:48,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:48,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-16 14:56:48,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-16 14:56:48,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:48,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:48,615 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 73 proven. 160 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 14:56:48,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614699858] [2025-03-16 14:56:48,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [614699858] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:56:48,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246257111] [2025-03-16 14:56:48,616 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:48,616 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:56:48,616 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:56:48,622 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 14:56:48,623 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 14:56:48,706 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 318 statements into 1 equivalence classes. [2025-03-16 14:56:48,771 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 318 of 318 statements. [2025-03-16 14:56:48,771 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:48,771 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:48,773 INFO L256 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:56:48,794 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:56:48,997 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-16 14:56:48,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:56:48,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [246257111] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:48,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:56:48,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-16 14:56:48,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824828446] [2025-03-16 14:56:48,998 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:48,998 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:48,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:48,998 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:48,998 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:56:48,999 INFO L87 Difference]: Start difference. First operand 30043 states and 32980 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:51,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:51,122 INFO L93 Difference]: Finished difference Result 72852 states and 80760 transitions. [2025-03-16 14:56:51,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:51,123 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 318 [2025-03-16 14:56:51,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:51,172 INFO L225 Difference]: With dead ends: 72852 [2025-03-16 14:56:51,172 INFO L226 Difference]: Without dead ends: 37553 [2025-03-16 14:56:51,188 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 317 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:56:51,188 INFO L435 NwaCegarLoop]: 302 mSDtfsCounter, 902 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2072 mSolverCounterSat, 701 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 902 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 2773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 701 IncrementalHoareTripleChecker+Valid, 2072 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:51,188 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [902 Valid, 308 Invalid, 2773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [701 Valid, 2072 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:56:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37553 states. [2025-03-16 14:56:51,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37553 to 31545. [2025-03-16 14:56:51,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31545 states, 31544 states have (on average 1.0853411108293178) internal successors, (34236), 31544 states have internal predecessors, (34236), 0 states have call successors, (0), 0 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 14:56:51,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31545 states to 31545 states and 34236 transitions. [2025-03-16 14:56:51,559 INFO L78 Accepts]: Start accepts. Automaton has 31545 states and 34236 transitions. Word has length 318 [2025-03-16 14:56:51,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:51,560 INFO L471 AbstractCegarLoop]: Abstraction has 31545 states and 34236 transitions. [2025-03-16 14:56:51,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-16 14:56:51,560 INFO L276 IsEmpty]: Start isEmpty. Operand 31545 states and 34236 transitions. [2025-03-16 14:56:51,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2025-03-16 14:56:51,566 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:51,566 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:56:51,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-16 14:56:51,770 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 14:56:51,770 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:51,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:51,771 INFO L85 PathProgramCache]: Analyzing trace with hash 511190090, now seen corresponding path program 1 times [2025-03-16 14:56:51,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:51,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226735027] [2025-03-16 14:56:51,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:51,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:51,811 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 380 statements into 1 equivalence classes. [2025-03-16 14:56:51,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 380 of 380 statements. [2025-03-16 14:56:51,839 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:51,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:52,084 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 251 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-16 14:56:52,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:52,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226735027] [2025-03-16 14:56:52,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226735027] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:52,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:52,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:52,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838625568] [2025-03-16 14:56:52,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:52,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:52,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:52,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:52,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:52,086 INFO L87 Difference]: Start difference. First operand 31545 states and 34236 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 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 14:56:53,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:53,964 INFO L93 Difference]: Finished difference Result 65342 states and 70749 transitions. [2025-03-16 14:56:53,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:53,965 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 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 380 [2025-03-16 14:56:53,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:53,998 INFO L225 Difference]: With dead ends: 65342 [2025-03-16 14:56:53,998 INFO L226 Difference]: Without dead ends: 33798 [2025-03-16 14:56:54,018 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 14:56:54,019 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 645 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2130 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 645 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 2663 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 2130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:54,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [645 Valid, 109 Invalid, 2663 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 2130 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:56:54,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33798 states. [2025-03-16 14:56:54,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33798 to 30794. [2025-03-16 14:56:54,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30794 states, 30793 states have (on average 1.0819017309128698) internal successors, (33315), 30793 states have internal predecessors, (33315), 0 states have call successors, (0), 0 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 14:56:54,331 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30794 states to 30794 states and 33315 transitions. [2025-03-16 14:56:54,331 INFO L78 Accepts]: Start accepts. Automaton has 30794 states and 33315 transitions. Word has length 380 [2025-03-16 14:56:54,332 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:54,332 INFO L471 AbstractCegarLoop]: Abstraction has 30794 states and 33315 transitions. [2025-03-16 14:56:54,332 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 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 14:56:54,332 INFO L276 IsEmpty]: Start isEmpty. Operand 30794 states and 33315 transitions. [2025-03-16 14:56:54,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-03-16 14:56:54,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:54,335 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:56:54,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-16 14:56:54,335 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:54,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:54,336 INFO L85 PathProgramCache]: Analyzing trace with hash 428931909, now seen corresponding path program 1 times [2025-03-16 14:56:54,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:54,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055543404] [2025-03-16 14:56:54,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:54,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:54,356 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-16 14:56:54,371 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-16 14:56:54,371 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:54,371 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:54,623 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 73 proven. 230 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2025-03-16 14:56:54,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:54,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055543404] [2025-03-16 14:56:54,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055543404] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:56:54,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505951873] [2025-03-16 14:56:54,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:54,624 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:56:54,624 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:56:54,626 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 14:56:54,628 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 14:56:54,670 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-03-16 14:56:54,772 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-03-16 14:56:54,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:54,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:54,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 522 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-16 14:56:54,781 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:56:54,966 INFO L134 CoverageAnalysis]: Checked inductivity of 347 backedges. 262 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2025-03-16 14:56:54,968 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:56:54,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [505951873] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:54,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:56:54,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-16 14:56:54,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56890843] [2025-03-16 14:56:54,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:54,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:54,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:54,970 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:54,971 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:56:54,971 INFO L87 Difference]: Start difference. First operand 30794 states and 33315 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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 14:56:57,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:57,052 INFO L93 Difference]: Finished difference Result 72852 states and 79558 transitions. [2025-03-16 14:56:57,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:57,052 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 391 [2025-03-16 14:56:57,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:56:57,085 INFO L225 Difference]: With dead ends: 72852 [2025-03-16 14:56:57,085 INFO L226 Difference]: Without dead ends: 42059 [2025-03-16 14:56:57,095 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 394 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-16 14:56:57,095 INFO L435 NwaCegarLoop]: 852 mSDtfsCounter, 674 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2016 mSolverCounterSat, 738 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 674 SdHoareTripleChecker+Valid, 859 SdHoareTripleChecker+Invalid, 2754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 738 IncrementalHoareTripleChecker+Valid, 2016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:56:57,095 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [674 Valid, 859 Invalid, 2754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [738 Valid, 2016 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:56:57,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42059 states. [2025-03-16 14:56:57,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42059 to 40557. [2025-03-16 14:56:57,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40557 states, 40556 states have (on average 1.096952362165894) internal successors, (44488), 40556 states have internal predecessors, (44488), 0 states have call successors, (0), 0 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 14:56:57,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40557 states to 40557 states and 44488 transitions. [2025-03-16 14:56:57,397 INFO L78 Accepts]: Start accepts. Automaton has 40557 states and 44488 transitions. Word has length 391 [2025-03-16 14:56:57,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:56:57,398 INFO L471 AbstractCegarLoop]: Abstraction has 40557 states and 44488 transitions. [2025-03-16 14:56:57,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 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 14:56:57,398 INFO L276 IsEmpty]: Start isEmpty. Operand 40557 states and 44488 transitions. [2025-03-16 14:56:57,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 570 [2025-03-16 14:56:57,409 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:56:57,409 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:56:57,419 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-16 14:56:57,609 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 14:56:57,610 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:56:57,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:56:57,610 INFO L85 PathProgramCache]: Analyzing trace with hash 626177346, now seen corresponding path program 1 times [2025-03-16 14:56:57,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:56:57,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204359237] [2025-03-16 14:56:57,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:56:57,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:56:57,641 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 569 statements into 1 equivalence classes. [2025-03-16 14:56:57,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 569 of 569 statements. [2025-03-16 14:56:57,657 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:56:57,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:56:57,837 INFO L134 CoverageAnalysis]: Checked inductivity of 647 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 96 trivial. 0 not checked. [2025-03-16 14:56:57,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:56:57,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204359237] [2025-03-16 14:56:57,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204359237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:56:57,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:56:57,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:56:57,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730881552] [2025-03-16 14:56:57,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:56:57,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:56:57,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:56:57,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:56:57,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:56:57,841 INFO L87 Difference]: Start difference. First operand 40557 states and 44488 transitions. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 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 14:56:59,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:56:59,957 INFO L93 Difference]: Finished difference Result 99137 states and 109519 transitions. [2025-03-16 14:56:59,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:56:59,957 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 569 [2025-03-16 14:56:59,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:00,014 INFO L225 Difference]: With dead ends: 99137 [2025-03-16 14:57:00,014 INFO L226 Difference]: Without dead ends: 58581 [2025-03-16 14:57:00,042 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 14:57:00,043 INFO L435 NwaCegarLoop]: 326 mSDtfsCounter, 675 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2126 mSolverCounterSat, 513 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 2639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 513 IncrementalHoareTripleChecker+Valid, 2126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:00,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 332 Invalid, 2639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [513 Valid, 2126 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-16 14:57:00,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58581 states. [2025-03-16 14:57:00,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58581 to 58581. [2025-03-16 14:57:00,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58581 states, 58580 states have (on average 1.0923352680095595) internal successors, (63989), 58580 states have internal predecessors, (63989), 0 states have call successors, (0), 0 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 14:57:00,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58581 states to 58581 states and 63989 transitions. [2025-03-16 14:57:00,576 INFO L78 Accepts]: Start accepts. Automaton has 58581 states and 63989 transitions. Word has length 569 [2025-03-16 14:57:00,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:00,576 INFO L471 AbstractCegarLoop]: Abstraction has 58581 states and 63989 transitions. [2025-03-16 14:57:00,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 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 14:57:00,577 INFO L276 IsEmpty]: Start isEmpty. Operand 58581 states and 63989 transitions. [2025-03-16 14:57:00,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 595 [2025-03-16 14:57:00,589 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:00,590 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:57:00,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-16 14:57:00,590 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:00,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:00,590 INFO L85 PathProgramCache]: Analyzing trace with hash 711044881, now seen corresponding path program 1 times [2025-03-16 14:57:00,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:00,591 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615498833] [2025-03-16 14:57:00,591 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:00,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:00,621 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-16 14:57:00,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-16 14:57:00,640 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:00,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:01,198 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 116 proven. 229 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:57:01,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615498833] [2025-03-16 14:57:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615498833] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:57:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636257413] [2025-03-16 14:57:01,199 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:01,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:57:01,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:57:01,201 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 14:57:01,207 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 14:57:01,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 594 statements into 1 equivalence classes. [2025-03-16 14:57:01,328 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 594 of 594 statements. [2025-03-16 14:57:01,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:01,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:01,330 INFO L256 TraceCheckSpWp]: Trace formula consists of 724 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-16 14:57:01,334 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:57:02,075 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-03-16 14:57:02,075 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-16 14:57:02,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636257413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:02,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-16 14:57:02,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-03-16 14:57:02,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538392756] [2025-03-16 14:57:02,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:02,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:02,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:02,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:02,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:57:02,078 INFO L87 Difference]: Start difference. First operand 58581 states and 63989 transitions. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 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 14:57:03,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:03,963 INFO L93 Difference]: Finished difference Result 118663 states and 129591 transitions. [2025-03-16 14:57:03,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:03,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 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 594 [2025-03-16 14:57:03,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:04,024 INFO L225 Difference]: With dead ends: 118663 [2025-03-16 14:57:04,024 INFO L226 Difference]: Without dead ends: 60083 [2025-03-16 14:57:04,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 598 GetRequests, 594 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-16 14:57:04,059 INFO L435 NwaCegarLoop]: 1162 mSDtfsCounter, 413 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2084 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 1169 SdHoareTripleChecker+Invalid, 2297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2084 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:04,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 1169 Invalid, 2297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2084 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 14:57:04,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60083 states. [2025-03-16 14:57:04,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60083 to 60083. [2025-03-16 14:57:04,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60083 states, 60082 states have (on average 1.0876468825937884) internal successors, (65348), 60082 states have internal predecessors, (65348), 0 states have call successors, (0), 0 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 14:57:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60083 states to 60083 states and 65348 transitions. [2025-03-16 14:57:04,754 INFO L78 Accepts]: Start accepts. Automaton has 60083 states and 65348 transitions. Word has length 594 [2025-03-16 14:57:04,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:04,755 INFO L471 AbstractCegarLoop]: Abstraction has 60083 states and 65348 transitions. [2025-03-16 14:57:04,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 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 14:57:04,755 INFO L276 IsEmpty]: Start isEmpty. Operand 60083 states and 65348 transitions. [2025-03-16 14:57:04,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2025-03-16 14:57:04,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:04,773 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:04,780 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 14:57:04,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:57:04,975 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:04,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:04,976 INFO L85 PathProgramCache]: Analyzing trace with hash -446451342, now seen corresponding path program 1 times [2025-03-16 14:57:04,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:04,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689458759] [2025-03-16 14:57:04,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:04,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:05,065 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 596 statements into 1 equivalence classes. [2025-03-16 14:57:05,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 596 of 596 statements. [2025-03-16 14:57:05,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:05,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:05,271 INFO L134 CoverageAnalysis]: Checked inductivity of 717 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2025-03-16 14:57:05,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:05,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689458759] [2025-03-16 14:57:05,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689458759] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:05,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:05,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:05,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754992112] [2025-03-16 14:57:05,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:05,272 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:05,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:05,273 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:05,273 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:05,273 INFO L87 Difference]: Start difference. First operand 60083 states and 65348 transitions. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 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 14:57:07,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:07,349 INFO L93 Difference]: Finished difference Result 130679 states and 142486 transitions. [2025-03-16 14:57:07,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:07,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 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 596 [2025-03-16 14:57:07,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:07,426 INFO L225 Difference]: With dead ends: 130679 [2025-03-16 14:57:07,426 INFO L226 Difference]: Without dead ends: 70597 [2025-03-16 14:57:07,451 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 14:57:07,452 INFO L435 NwaCegarLoop]: 1168 mSDtfsCounter, 663 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2107 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 2107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:07,452 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 1175 Invalid, 2471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 2107 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:57:07,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70597 states. [2025-03-16 14:57:07,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70597 to 69846. [2025-03-16 14:57:07,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69846 states, 69845 states have (on average 1.0823537833774788) internal successors, (75597), 69845 states have internal predecessors, (75597), 0 states have call successors, (0), 0 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 14:57:07,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69846 states to 69846 states and 75597 transitions. [2025-03-16 14:57:07,986 INFO L78 Accepts]: Start accepts. Automaton has 69846 states and 75597 transitions. Word has length 596 [2025-03-16 14:57:07,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:07,986 INFO L471 AbstractCegarLoop]: Abstraction has 69846 states and 75597 transitions. [2025-03-16 14:57:07,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 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 14:57:07,986 INFO L276 IsEmpty]: Start isEmpty. Operand 69846 states and 75597 transitions. [2025-03-16 14:57:07,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2025-03-16 14:57:07,996 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:07,996 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:07,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-16 14:57:07,997 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:07,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:07,997 INFO L85 PathProgramCache]: Analyzing trace with hash -246453316, now seen corresponding path program 1 times [2025-03-16 14:57:07,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:07,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877281067] [2025-03-16 14:57:07,997 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:07,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:08,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 600 statements into 1 equivalence classes. [2025-03-16 14:57:08,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 600 of 600 statements. [2025-03-16 14:57:08,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:08,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 725 backedges. 598 proven. 0 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2025-03-16 14:57:08,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:08,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877281067] [2025-03-16 14:57:08,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877281067] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:08,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:08,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:08,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906725844] [2025-03-16 14:57:08,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:08,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:08,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:08,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:08,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:08,319 INFO L87 Difference]: Start difference. First operand 69846 states and 75597 transitions. Second operand has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 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 14:57:10,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:10,299 INFO L93 Difference]: Finished difference Result 157715 states and 171279 transitions. [2025-03-16 14:57:10,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:10,299 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 600 [2025-03-16 14:57:10,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:10,404 INFO L225 Difference]: With dead ends: 157715 [2025-03-16 14:57:10,404 INFO L226 Difference]: Without dead ends: 87870 [2025-03-16 14:57:10,431 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 14:57:10,431 INFO L435 NwaCegarLoop]: 1190 mSDtfsCounter, 660 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 239 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 660 SdHoareTripleChecker+Valid, 1197 SdHoareTripleChecker+Invalid, 2335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 239 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:10,431 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [660 Valid, 1197 Invalid, 2335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [239 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-16 14:57:10,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87870 states. [2025-03-16 14:57:10,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87870 to 87119. [2025-03-16 14:57:11,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87119 states, 87118 states have (on average 1.0743703941780114) internal successors, (93597), 87118 states have internal predecessors, (93597), 0 states have call successors, (0), 0 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 14:57:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87119 states to 87119 states and 93597 transitions. [2025-03-16 14:57:11,318 INFO L78 Accepts]: Start accepts. Automaton has 87119 states and 93597 transitions. Word has length 600 [2025-03-16 14:57:11,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:11,318 INFO L471 AbstractCegarLoop]: Abstraction has 87119 states and 93597 transitions. [2025-03-16 14:57:11,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 158.33333333333334) internal successors, (475), 3 states have internal predecessors, (475), 0 states have call successors, (0), 0 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 14:57:11,319 INFO L276 IsEmpty]: Start isEmpty. Operand 87119 states and 93597 transitions. [2025-03-16 14:57:11,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2025-03-16 14:57:11,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:11,330 INFO L218 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-16 14:57:11,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-16 14:57:11,330 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:11,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:11,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2074580073, now seen corresponding path program 1 times [2025-03-16 14:57:11,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:11,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726192937] [2025-03-16 14:57:11,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:11,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:11,364 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-16 14:57:11,386 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-16 14:57:11,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:11,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:12,507 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 144 proven. 257 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:57:12,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:12,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726192937] [2025-03-16 14:57:12,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726192937] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 14:57:12,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340277515] [2025-03-16 14:57:12,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:12,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 14:57:12,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 14:57:12,510 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 14:57:12,512 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 14:57:12,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 622 statements into 1 equivalence classes. [2025-03-16 14:57:12,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 622 of 622 statements. [2025-03-16 14:57:12,693 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:12,693 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:12,696 INFO L256 TraceCheckSpWp]: Trace formula consists of 750 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 14:57:12,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 14:57:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 293 proven. 108 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 14:57:13,954 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 14:57:15,398 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 289 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2025-03-16 14:57:15,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340277515] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-16 14:57:15,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-16 14:57:15,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5, 5] total 11 [2025-03-16 14:57:15,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559033818] [2025-03-16 14:57:15,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:15,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:15,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:15,400 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:15,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:57:15,400 INFO L87 Difference]: Start difference. First operand 87119 states and 93597 transitions. Second operand has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 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 14:57:17,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:17,391 INFO L93 Difference]: Finished difference Result 180245 states and 193962 transitions. [2025-03-16 14:57:17,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:17,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 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 622 [2025-03-16 14:57:17,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:17,490 INFO L225 Difference]: With dead ends: 180245 [2025-03-16 14:57:17,490 INFO L226 Difference]: Without dead ends: 93127 [2025-03-16 14:57:17,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1247 GetRequests, 1238 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=73, Unknown=0, NotChecked=0, Total=110 [2025-03-16 14:57:17,540 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 466 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1986 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 2559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 1986 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:17,540 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 70 Invalid, 2559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 1986 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-16 14:57:17,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93127 states. [2025-03-16 14:57:18,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93127 to 91625. [2025-03-16 14:57:18,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91625 states, 91624 states have (on average 1.0658233650571902) internal successors, (97655), 91624 states have internal predecessors, (97655), 0 states have call successors, (0), 0 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 14:57:18,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91625 states to 91625 states and 97655 transitions. [2025-03-16 14:57:18,422 INFO L78 Accepts]: Start accepts. Automaton has 91625 states and 97655 transitions. Word has length 622 [2025-03-16 14:57:18,422 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:18,422 INFO L471 AbstractCegarLoop]: Abstraction has 91625 states and 97655 transitions. [2025-03-16 14:57:18,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 170.33333333333334) internal successors, (511), 3 states have internal predecessors, (511), 0 states have call successors, (0), 0 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 14:57:18,423 INFO L276 IsEmpty]: Start isEmpty. Operand 91625 states and 97655 transitions. [2025-03-16 14:57:18,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 707 [2025-03-16 14:57:18,438 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:18,439 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2025-03-16 14:57:18,445 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 14:57:18,639 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,SelfDestructingSolverStorable16 [2025-03-16 14:57:18,639 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:18,640 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:18,640 INFO L85 PathProgramCache]: Analyzing trace with hash -4321263, now seen corresponding path program 1 times [2025-03-16 14:57:18,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:18,640 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861409677] [2025-03-16 14:57:18,640 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:18,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:18,673 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 706 statements into 1 equivalence classes. [2025-03-16 14:57:18,689 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 706 of 706 statements. [2025-03-16 14:57:18,690 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:18,690 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:18,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1133 backedges. 874 proven. 0 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2025-03-16 14:57:18,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:18,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861409677] [2025-03-16 14:57:18,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861409677] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:18,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:18,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:18,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939983282] [2025-03-16 14:57:18,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:18,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:18,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:18,837 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:18,837 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:18,837 INFO L87 Difference]: Start difference. First operand 91625 states and 97655 transitions. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 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 14:57:21,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:21,054 INFO L93 Difference]: Finished difference Result 209534 states and 223745 transitions. [2025-03-16 14:57:21,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:21,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 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 706 [2025-03-16 14:57:21,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:21,189 INFO L225 Difference]: With dead ends: 209534 [2025-03-16 14:57:21,189 INFO L226 Difference]: Without dead ends: 116408 [2025-03-16 14:57:21,260 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 14:57:21,260 INFO L435 NwaCegarLoop]: 1159 mSDtfsCounter, 696 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 696 SdHoareTripleChecker+Valid, 1165 SdHoareTripleChecker+Invalid, 2545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:21,261 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [696 Valid, 1165 Invalid, 2545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:57:21,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116408 states. [2025-03-16 14:57:22,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116408 to 114155. [2025-03-16 14:57:22,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114155 states, 114154 states have (on average 1.0515093645426354) internal successors, (120034), 114154 states have internal predecessors, (120034), 0 states have call successors, (0), 0 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 14:57:22,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114155 states to 114155 states and 120034 transitions. [2025-03-16 14:57:22,569 INFO L78 Accepts]: Start accepts. Automaton has 114155 states and 120034 transitions. Word has length 706 [2025-03-16 14:57:22,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:22,570 INFO L471 AbstractCegarLoop]: Abstraction has 114155 states and 120034 transitions. [2025-03-16 14:57:22,570 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 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 14:57:22,570 INFO L276 IsEmpty]: Start isEmpty. Operand 114155 states and 120034 transitions. [2025-03-16 14:57:22,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 734 [2025-03-16 14:57:22,596 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:22,597 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:57:22,597 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-16 14:57:22,597 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:22,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:22,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1793552531, now seen corresponding path program 1 times [2025-03-16 14:57:22,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:22,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1175866427] [2025-03-16 14:57:22,598 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:22,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:22,674 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 733 statements into 1 equivalence classes. [2025-03-16 14:57:22,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 733 of 733 statements. [2025-03-16 14:57:22,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:22,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:23,160 INFO L134 CoverageAnalysis]: Checked inductivity of 1154 backedges. 550 proven. 0 refuted. 0 times theorem prover too weak. 604 trivial. 0 not checked. [2025-03-16 14:57:23,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:23,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1175866427] [2025-03-16 14:57:23,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1175866427] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:23,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:23,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:23,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664623862] [2025-03-16 14:57:23,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:23,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:23,161 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:23,162 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:23,162 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:23,162 INFO L87 Difference]: Start difference. First operand 114155 states and 120034 transitions. Second operand has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 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 14:57:25,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:25,362 INFO L93 Difference]: Finished difference Result 230562 states and 242325 transitions. [2025-03-16 14:57:25,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:25,363 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 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 733 [2025-03-16 14:57:25,363 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:25,470 INFO L225 Difference]: With dead ends: 230562 [2025-03-16 14:57:25,471 INFO L226 Difference]: Without dead ends: 113404 [2025-03-16 14:57:25,510 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 14:57:25,511 INFO L435 NwaCegarLoop]: 1119 mSDtfsCounter, 589 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1979 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 589 SdHoareTripleChecker+Valid, 1126 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 1979 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:25,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [589 Valid, 1126 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 1979 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-16 14:57:25,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113404 states. [2025-03-16 14:57:26,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113404 to 108898. [2025-03-16 14:57:26,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108898 states, 108897 states have (on average 1.034702517057403) internal successors, (112676), 108897 states have internal predecessors, (112676), 0 states have call successors, (0), 0 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 14:57:26,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108898 states to 108898 states and 112676 transitions. [2025-03-16 14:57:26,457 INFO L78 Accepts]: Start accepts. Automaton has 108898 states and 112676 transitions. Word has length 733 [2025-03-16 14:57:26,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:26,458 INFO L471 AbstractCegarLoop]: Abstraction has 108898 states and 112676 transitions. [2025-03-16 14:57:26,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 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 14:57:26,458 INFO L276 IsEmpty]: Start isEmpty. Operand 108898 states and 112676 transitions. [2025-03-16 14:57:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 884 [2025-03-16 14:57:26,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:26,487 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:26,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-16 14:57:26,487 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:26,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:26,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1571410313, now seen corresponding path program 1 times [2025-03-16 14:57:26,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:26,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747929777] [2025-03-16 14:57:26,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:26,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:26,709 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 883 statements into 1 equivalence classes. [2025-03-16 14:57:26,749 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 883 of 883 statements. [2025-03-16 14:57:26,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:26,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:27,096 INFO L134 CoverageAnalysis]: Checked inductivity of 972 backedges. 826 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-03-16 14:57:27,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:27,096 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747929777] [2025-03-16 14:57:27,096 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747929777] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:27,096 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:27,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:27,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072252258] [2025-03-16 14:57:27,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:27,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:27,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:27,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:27,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:27,099 INFO L87 Difference]: Start difference. First operand 108898 states and 112676 transitions. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 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 14:57:29,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:29,457 INFO L93 Difference]: Finished difference Result 256096 states and 265020 transitions. [2025-03-16 14:57:29,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-16 14:57:29,457 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 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 883 [2025-03-16 14:57:29,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:29,643 INFO L225 Difference]: With dead ends: 256096 [2025-03-16 14:57:29,643 INFO L226 Difference]: Without dead ends: 147950 [2025-03-16 14:57:29,723 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 14:57:29,723 INFO L435 NwaCegarLoop]: 186 mSDtfsCounter, 542 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 516 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 542 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 2618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 516 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:29,723 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [542 Valid, 192 Invalid, 2618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [516 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-03-16 14:57:29,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147950 states. [2025-03-16 14:57:31,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147950 to 118661. [2025-03-16 14:57:31,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118661 states, 118660 states have (on average 1.035150851171414) internal successors, (122831), 118660 states have internal predecessors, (122831), 0 states have call successors, (0), 0 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 14:57:31,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118661 states to 118661 states and 122831 transitions. [2025-03-16 14:57:31,328 INFO L78 Accepts]: Start accepts. Automaton has 118661 states and 122831 transitions. Word has length 883 [2025-03-16 14:57:31,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:31,328 INFO L471 AbstractCegarLoop]: Abstraction has 118661 states and 122831 transitions. [2025-03-16 14:57:31,328 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 0 states have call successors, (0), 0 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 14:57:31,329 INFO L276 IsEmpty]: Start isEmpty. Operand 118661 states and 122831 transitions. [2025-03-16 14:57:31,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 892 [2025-03-16 14:57:31,358 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:31,358 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 14:57:31,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-16 14:57:31,359 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:31,359 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:31,359 INFO L85 PathProgramCache]: Analyzing trace with hash 1855218827, now seen corresponding path program 1 times [2025-03-16 14:57:31,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:31,360 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150056860] [2025-03-16 14:57:31,360 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:31,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:31,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 891 statements into 1 equivalence classes. [2025-03-16 14:57:31,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 891 of 891 statements. [2025-03-16 14:57:31,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:31,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:32,687 INFO L134 CoverageAnalysis]: Checked inductivity of 980 backedges. 845 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2025-03-16 14:57:32,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:32,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150056860] [2025-03-16 14:57:32,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150056860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:32,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:32,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-16 14:57:32,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244829358] [2025-03-16 14:57:32,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:32,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-16 14:57:32,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:32,690 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-16 14:57:32,690 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-16 14:57:32,690 INFO L87 Difference]: Start difference. First operand 118661 states and 122831 transitions. Second operand has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 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 14:57:35,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 14:57:35,848 INFO L93 Difference]: Finished difference Result 248586 states and 257286 transitions. [2025-03-16 14:57:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-16 14:57:35,848 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 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 891 [2025-03-16 14:57:35,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 14:57:36,001 INFO L225 Difference]: With dead ends: 248586 [2025-03-16 14:57:36,001 INFO L226 Difference]: Without dead ends: 130677 [2025-03-16 14:57:36,070 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 14:57:36,070 INFO L435 NwaCegarLoop]: 1142 mSDtfsCounter, 916 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 4913 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 916 SdHoareTripleChecker+Valid, 1161 SdHoareTripleChecker+Invalid, 5075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 4913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-03-16 14:57:36,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [916 Valid, 1161 Invalid, 5075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 4913 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-03-16 14:57:36,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130677 states. [2025-03-16 14:57:37,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130677 to 121665. [2025-03-16 14:57:37,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121665 states, 121664 states have (on average 1.0346528143082587) internal successors, (125880), 121664 states have internal predecessors, (125880), 0 states have call successors, (0), 0 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 14:57:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121665 states to 121665 states and 125880 transitions. [2025-03-16 14:57:37,648 INFO L78 Accepts]: Start accepts. Automaton has 121665 states and 125880 transitions. Word has length 891 [2025-03-16 14:57:37,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 14:57:37,649 INFO L471 AbstractCegarLoop]: Abstraction has 121665 states and 125880 transitions. [2025-03-16 14:57:37,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 189.25) internal successors, (757), 4 states have internal predecessors, (757), 0 states have call successors, (0), 0 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 14:57:37,649 INFO L276 IsEmpty]: Start isEmpty. Operand 121665 states and 125880 transitions. [2025-03-16 14:57:37,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 950 [2025-03-16 14:57:37,681 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 14:57:37,681 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-16 14:57:37,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-16 14:57:37,682 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 14:57:37,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 14:57:37,682 INFO L85 PathProgramCache]: Analyzing trace with hash -951013331, now seen corresponding path program 1 times [2025-03-16 14:57:37,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 14:57:37,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [90920521] [2025-03-16 14:57:37,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 14:57:37,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 14:57:37,725 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 949 statements into 1 equivalence classes. [2025-03-16 14:57:37,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 949 of 949 statements. [2025-03-16 14:57:37,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 14:57:37,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 14:57:38,359 INFO L134 CoverageAnalysis]: Checked inductivity of 1377 backedges. 1075 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2025-03-16 14:57:38,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 14:57:38,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [90920521] [2025-03-16 14:57:38,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [90920521] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 14:57:38,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 14:57:38,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-16 14:57:38,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146338008] [2025-03-16 14:57:38,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 14:57:38,360 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-16 14:57:38,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 14:57:38,361 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-16 14:57:38,361 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-16 14:57:38,361 INFO L87 Difference]: Start difference. First operand 121665 states and 125880 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)