./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label45.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed 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/Problem16_label45.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 afe335c27ad1064f04c887aeb6cd5f788e4385baa51346b0245aab8cf0c02312 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 02:06:13,642 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 02:06:13,693 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 02:06:13,698 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 02:06:13,698 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 02:06:13,718 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 02:06:13,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 02:06:13,719 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 02:06:13,719 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 02:06:13,719 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 02:06:13,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 02:06:13,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 02:06:13,720 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 02:06:13,720 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 02:06:13,721 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 02:06:13,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 02:06:13,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 02:06:13,721 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 02:06:13,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 02:06:13,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 02:06:13,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 02:06:13,721 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 02:06:13,721 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 02:06:13,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 02:06:13,722 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 02:06:13,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 02:06:13,722 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 02:06:13,722 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 02:06:13,722 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 02:06:13,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 02:06:13,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 02:06:13,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 02:06:13,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:06:13,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 02:06:13,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 02:06:13,723 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 02:06:13,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 02:06:13,723 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 02:06:13,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 02:06:13,723 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 02:06:13,723 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 02:06:13,723 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 02:06:13,723 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 02:06:13,723 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 -> afe335c27ad1064f04c887aeb6cd5f788e4385baa51346b0245aab8cf0c02312 [2025-03-08 02:06:13,956 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 02:06:13,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 02:06:13,965 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 02:06:13,967 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 02:06:13,967 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 02:06:13,969 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label45.c [2025-03-08 02:06:15,164 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a811661e8/5a5b816d9afe495e88e59a8500adc544/FLAG1ac3311db [2025-03-08 02:06:15,507 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 02:06:15,508 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label45.c [2025-03-08 02:06:15,525 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a811661e8/5a5b816d9afe495e88e59a8500adc544/FLAG1ac3311db [2025-03-08 02:06:15,541 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a811661e8/5a5b816d9afe495e88e59a8500adc544 [2025-03-08 02:06:15,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 02:06:15,544 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 02:06:15,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 02:06:15,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 02:06:15,549 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 02:06:15,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:06:15" (1/1) ... [2025-03-08 02:06:15,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f400e83 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:15, skipping insertion in model container [2025-03-08 02:06:15,551 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 02:06:15" (1/1) ... [2025-03-08 02:06:15,589 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 02:06:15,719 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/Problem16_label45.c[5621,5634] [2025-03-08 02:06:15,924 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:06:15,932 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 02:06:15,947 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/Problem16_label45.c[5621,5634] [2025-03-08 02:06:16,061 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 02:06:16,074 INFO L204 MainTranslator]: Completed translation [2025-03-08 02:06:16,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16 WrapperNode [2025-03-08 02:06:16,076 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 02:06:16,077 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 02:06:16,077 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 02:06:16,077 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 02:06:16,081 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (1/1) ... [2025-03-08 02:06:16,108 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (1/1) ... [2025-03-08 02:06:16,223 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-03-08 02:06:16,224 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 02:06:16,225 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 02:06:16,225 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 02:06:16,225 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 02:06:16,231 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (1/1) ... [2025-03-08 02:06:16,232 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (1/1) ... [2025-03-08 02:06:16,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (1/1) ... [2025-03-08 02:06:16,287 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-08 02:06:16,288 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (1/1) ... [2025-03-08 02:06:16,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (1/1) ... [2025-03-08 02:06:16,324 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (1/1) ... [2025-03-08 02:06:16,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (1/1) ... [2025-03-08 02:06:16,340 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (1/1) ... [2025-03-08 02:06:16,347 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (1/1) ... [2025-03-08 02:06:16,362 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 02:06:16,363 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 02:06:16,363 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 02:06:16,363 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 02:06:16,364 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (1/1) ... [2025-03-08 02:06:16,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 02:06:16,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:16,392 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-08 02:06:16,395 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-08 02:06:16,412 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 02:06:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 02:06:16,413 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 02:06:16,413 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 02:06:16,461 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 02:06:16,463 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 02:06:18,221 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L1501: havoc calculate_output_#t~ret7#1; [2025-03-08 02:06:18,286 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-03-08 02:06:18,286 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 02:06:18,306 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 02:06:18,306 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 02:06:18,306 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:06:18 BoogieIcfgContainer [2025-03-08 02:06:18,306 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 02:06:18,311 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 02:06:18,311 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 02:06:18,314 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 02:06:18,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 02:06:15" (1/3) ... [2025-03-08 02:06:18,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d2b6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:06:18, skipping insertion in model container [2025-03-08 02:06:18,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 02:06:16" (2/3) ... [2025-03-08 02:06:18,315 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54d2b6af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 02:06:18, skipping insertion in model container [2025-03-08 02:06:18,315 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 02:06:18" (3/3) ... [2025-03-08 02:06:18,316 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label45.c [2025-03-08 02:06:18,328 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 02:06:18,330 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label45.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 02:06:18,384 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 02:06:18,394 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;@7ed82fa3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 02:06:18,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 02:06:18,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:18,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-03-08 02:06:18,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:18,407 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:18,408 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:18,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:18,412 INFO L85 PathProgramCache]: Analyzing trace with hash 2081847668, now seen corresponding path program 1 times [2025-03-08 02:06:18,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:18,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359613034] [2025-03-08 02:06:18,418 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:18,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:18,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-03-08 02:06:18,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-03-08 02:06:18,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:18,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:18,703 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-08 02:06:18,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:18,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359613034] [2025-03-08 02:06:18,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359613034] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:18,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:18,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:18,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1792318683] [2025-03-08 02:06:18,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:18,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:18,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:18,727 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:18,727 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:18,730 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 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 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:19,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:19,994 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-03-08 02:06:19,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:19,996 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 53 [2025-03-08 02:06:19,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:20,004 INFO L225 Difference]: With dead ends: 1122 [2025-03-08 02:06:20,005 INFO L226 Difference]: Without dead ends: 662 [2025-03-08 02:06:20,008 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-08 02:06:20,009 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 307 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:20,010 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 223 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-08 02:06:20,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-03-08 02:06:20,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-03-08 02:06:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5824508320726172) internal successors, (1046), 661 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1046 transitions. [2025-03-08 02:06:20,055 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1046 transitions. Word has length 53 [2025-03-08 02:06:20,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:20,055 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1046 transitions. [2025-03-08 02:06:20,056 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.666666666666668) internal successors, (53), 2 states have internal predecessors, (53), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:20,056 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1046 transitions. [2025-03-08 02:06:20,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2025-03-08 02:06:20,058 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:20,058 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-08 02:06:20,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 02:06:20,058 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:20,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:20,059 INFO L85 PathProgramCache]: Analyzing trace with hash -777679759, now seen corresponding path program 1 times [2025-03-08 02:06:20,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:20,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905660598] [2025-03-08 02:06:20,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:20,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:20,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 124 statements into 1 equivalence classes. [2025-03-08 02:06:20,110 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 124 of 124 statements. [2025-03-08 02:06:20,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:20,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:20,237 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 02:06:20,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:20,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905660598] [2025-03-08 02:06:20,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905660598] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:20,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:20,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:20,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2120052373] [2025-03-08 02:06:20,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:20,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:20,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:20,239 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:20,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:20,239 INFO L87 Difference]: Start difference. First operand 662 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:21,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:21,370 INFO L93 Difference]: Finished difference Result 1980 states and 3133 transitions. [2025-03-08 02:06:21,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:21,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 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 124 [2025-03-08 02:06:21,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:21,374 INFO L225 Difference]: With dead ends: 1980 [2025-03-08 02:06:21,375 INFO L226 Difference]: Without dead ends: 1320 [2025-03-08 02:06:21,376 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-08 02:06:21,376 INFO L435 NwaCegarLoop]: 74 mSDtfsCounter, 277 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 384 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 277 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 384 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:21,377 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [277 Valid, 79 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [384 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-08 02:06:21,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2025-03-08 02:06:21,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2025-03-08 02:06:21,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.5056861258529188) internal successors, (1986), 1319 states have internal predecessors, (1986), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:21,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1986 transitions. [2025-03-08 02:06:21,404 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1986 transitions. Word has length 124 [2025-03-08 02:06:21,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:21,404 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 1986 transitions. [2025-03-08 02:06:21,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 2 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:21,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1986 transitions. [2025-03-08 02:06:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-03-08 02:06:21,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:21,407 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:21,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 02:06:21,407 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:21,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:21,408 INFO L85 PathProgramCache]: Analyzing trace with hash -1147628672, now seen corresponding path program 1 times [2025-03-08 02:06:21,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:21,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420165584] [2025-03-08 02:06:21,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:21,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:21,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-03-08 02:06:21,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-03-08 02:06:21,448 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:21,448 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:21,640 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 51 trivial. 0 not checked. [2025-03-08 02:06:21,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:21,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420165584] [2025-03-08 02:06:21,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420165584] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:21,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:21,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:21,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1196844384] [2025-03-08 02:06:21,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:21,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:21,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:21,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:21,644 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:21,644 INFO L87 Difference]: Start difference. First operand 1320 states and 1986 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:22,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:22,699 INFO L93 Difference]: Finished difference Result 3954 states and 5953 transitions. [2025-03-08 02:06:22,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:22,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 195 [2025-03-08 02:06:22,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:22,711 INFO L225 Difference]: With dead ends: 3954 [2025-03-08 02:06:22,711 INFO L226 Difference]: Without dead ends: 2636 [2025-03-08 02:06:22,714 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-08 02:06:22,714 INFO L435 NwaCegarLoop]: 200 mSDtfsCounter, 293 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 293 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 1199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:22,714 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [293 Valid, 205 Invalid, 1199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 02:06:22,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-03-08 02:06:22,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2025-03-08 02:06:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.323719165085389) internal successors, (3488), 2635 states have internal predecessors, (3488), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:22,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3488 transitions. [2025-03-08 02:06:22,766 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3488 transitions. Word has length 195 [2025-03-08 02:06:22,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:22,767 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3488 transitions. [2025-03-08 02:06:22,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 2 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:22,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3488 transitions. [2025-03-08 02:06:22,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2025-03-08 02:06:22,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:22,771 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:22,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 02:06:22,771 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:22,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:22,772 INFO L85 PathProgramCache]: Analyzing trace with hash 961351232, now seen corresponding path program 1 times [2025-03-08 02:06:22,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:22,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563316305] [2025-03-08 02:06:22,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:22,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:22,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 219 statements into 1 equivalence classes. [2025-03-08 02:06:22,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 219 of 219 statements. [2025-03-08 02:06:22,819 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:22,819 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:22,967 INFO L134 CoverageAnalysis]: Checked inductivity of 179 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-08 02:06:22,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:22,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563316305] [2025-03-08 02:06:22,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563316305] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:22,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:22,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:22,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840454697] [2025-03-08 02:06:22,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:22,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:22,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:22,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:22,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:22,968 INFO L87 Difference]: Start difference. First operand 2636 states and 3488 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:23,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:23,911 INFO L93 Difference]: Finished difference Result 6586 states and 8891 transitions. [2025-03-08 02:06:23,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:23,911 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 219 [2025-03-08 02:06:23,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:23,920 INFO L225 Difference]: With dead ends: 6586 [2025-03-08 02:06:23,921 INFO L226 Difference]: Without dead ends: 3952 [2025-03-08 02:06:23,924 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-08 02:06:23,924 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 368 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 368 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:23,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 156 Invalid, 1179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [368 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:06:23,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2025-03-08 02:06:23,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 2965. [2025-03-08 02:06:23,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2964 states have (on average 1.3286099865047234) internal successors, (3938), 2964 states have internal predecessors, (3938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:23,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 3938 transitions. [2025-03-08 02:06:23,967 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 3938 transitions. Word has length 219 [2025-03-08 02:06:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:23,967 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 3938 transitions. [2025-03-08 02:06:23,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 3938 transitions. [2025-03-08 02:06:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 363 [2025-03-08 02:06:23,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:23,973 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 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-08 02:06:23,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 02:06:23,973 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:23,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:23,974 INFO L85 PathProgramCache]: Analyzing trace with hash -2139477191, now seen corresponding path program 1 times [2025-03-08 02:06:23,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:23,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [673010926] [2025-03-08 02:06:23,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:23,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:24,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 362 statements into 1 equivalence classes. [2025-03-08 02:06:24,024 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 362 of 362 statements. [2025-03-08 02:06:24,024 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:24,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:24,210 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-03-08 02:06:24,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:24,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [673010926] [2025-03-08 02:06:24,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [673010926] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:24,211 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:24,211 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:24,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730531728] [2025-03-08 02:06:24,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:24,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:24,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:24,212 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:24,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:24,213 INFO L87 Difference]: Start difference. First operand 2965 states and 3938 transitions. Second operand has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:25,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:25,161 INFO L93 Difference]: Finished difference Result 7244 states and 9442 transitions. [2025-03-08 02:06:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:25,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 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 362 [2025-03-08 02:06:25,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:25,172 INFO L225 Difference]: With dead ends: 7244 [2025-03-08 02:06:25,172 INFO L226 Difference]: Without dead ends: 4281 [2025-03-08 02:06:25,176 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-08 02:06:25,178 INFO L435 NwaCegarLoop]: 79 mSDtfsCounter, 278 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 1146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:25,178 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 83 Invalid, 1146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:06:25,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2025-03-08 02:06:25,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2025-03-08 02:06:25,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.2121495327102805) internal successors, (5188), 4280 states have internal predecessors, (5188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:25,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5188 transitions. [2025-03-08 02:06:25,237 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5188 transitions. Word has length 362 [2025-03-08 02:06:25,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:25,237 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5188 transitions. [2025-03-08 02:06:25,238 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.0) internal successors, (246), 2 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:25,238 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5188 transitions. [2025-03-08 02:06:25,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-03-08 02:06:25,243 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:25,244 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:06:25,244 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 02:06:25,245 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:25,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:25,245 INFO L85 PathProgramCache]: Analyzing trace with hash 1539188022, now seen corresponding path program 1 times [2025-03-08 02:06:25,246 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:25,246 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1905517826] [2025-03-08 02:06:25,246 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:25,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-03-08 02:06:25,317 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-03-08 02:06:25,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:25,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:25,848 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 226 proven. 0 refuted. 0 times theorem prover too weak. 169 trivial. 0 not checked. [2025-03-08 02:06:25,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:25,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1905517826] [2025-03-08 02:06:25,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1905517826] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:25,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:25,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-08 02:06:25,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121701387] [2025-03-08 02:06:25,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:25,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:25,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:25,854 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:25,854 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:25,854 INFO L87 Difference]: Start difference. First operand 4281 states and 5188 transitions. Second operand has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:26,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:26,711 INFO L93 Difference]: Finished difference Result 9218 states and 11086 transitions. [2025-03-08 02:06:26,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:26,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 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 476 [2025-03-08 02:06:26,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:26,727 INFO L225 Difference]: With dead ends: 9218 [2025-03-08 02:06:26,727 INFO L226 Difference]: Without dead ends: 4939 [2025-03-08 02:06:26,732 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-08 02:06:26,734 INFO L435 NwaCegarLoop]: 243 mSDtfsCounter, 87 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 945 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 945 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:26,735 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 248 Invalid, 956 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 945 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 02:06:26,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4939 states. [2025-03-08 02:06:26,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4939 to 4939. [2025-03-08 02:06:26,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4939 states, 4938 states have (on average 1.191170514378291) internal successors, (5882), 4938 states have internal predecessors, (5882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:26,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4939 states to 4939 states and 5882 transitions. [2025-03-08 02:06:26,805 INFO L78 Accepts]: Start accepts. Automaton has 4939 states and 5882 transitions. Word has length 476 [2025-03-08 02:06:26,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:26,807 INFO L471 AbstractCegarLoop]: Abstraction has 4939 states and 5882 transitions. [2025-03-08 02:06:26,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.0) internal successors, (360), 2 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:26,808 INFO L276 IsEmpty]: Start isEmpty. Operand 4939 states and 5882 transitions. [2025-03-08 02:06:26,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 564 [2025-03-08 02:06:26,816 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:26,816 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:06:26,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 02:06:26,817 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:26,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:26,817 INFO L85 PathProgramCache]: Analyzing trace with hash 621889905, now seen corresponding path program 1 times [2025-03-08 02:06:26,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:26,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1618611385] [2025-03-08 02:06:26,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:26,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:26,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 563 statements into 1 equivalence classes. [2025-03-08 02:06:26,900 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 563 of 563 statements. [2025-03-08 02:06:26,901 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:26,901 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:27,509 INFO L134 CoverageAnalysis]: Checked inductivity of 686 backedges. 457 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-08 02:06:27,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:27,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1618611385] [2025-03-08 02:06:27,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1618611385] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:27,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:27,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 02:06:27,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359659769] [2025-03-08 02:06:27,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:27,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 02:06:27,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:27,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 02:06:27,511 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:06:27,511 INFO L87 Difference]: Start difference. First operand 4939 states and 5882 transitions. Second operand has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:28,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:28,962 INFO L93 Difference]: Finished difference Result 9077 states and 10915 transitions. [2025-03-08 02:06:28,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 02:06:28,963 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 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 563 [2025-03-08 02:06:28,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:28,973 INFO L225 Difference]: With dead ends: 9077 [2025-03-08 02:06:28,973 INFO L226 Difference]: Without dead ends: 4610 [2025-03-08 02:06:28,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:06:28,977 INFO L435 NwaCegarLoop]: 257 mSDtfsCounter, 307 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 1957 mSolverCounterSat, 343 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 2300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 343 IncrementalHoareTripleChecker+Valid, 1957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:28,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 287 Invalid, 2300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [343 Valid, 1957 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-08 02:06:28,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4610 states. [2025-03-08 02:06:29,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4610 to 4610. [2025-03-08 02:06:29,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4610 states, 4609 states have (on average 1.0735517465827729) internal successors, (4948), 4609 states have internal predecessors, (4948), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:29,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4610 states to 4610 states and 4948 transitions. [2025-03-08 02:06:29,066 INFO L78 Accepts]: Start accepts. Automaton has 4610 states and 4948 transitions. Word has length 563 [2025-03-08 02:06:29,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:29,066 INFO L471 AbstractCegarLoop]: Abstraction has 4610 states and 4948 transitions. [2025-03-08 02:06:29,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 56.57142857142857) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:29,067 INFO L276 IsEmpty]: Start isEmpty. Operand 4610 states and 4948 transitions. [2025-03-08 02:06:29,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-03-08 02:06:29,074 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:29,074 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:06:29,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 02:06:29,075 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:29,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:29,076 INFO L85 PathProgramCache]: Analyzing trace with hash 629083603, now seen corresponding path program 1 times [2025-03-08 02:06:29,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:29,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730817655] [2025-03-08 02:06:29,077 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:29,077 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:29,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-03-08 02:06:29,183 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-03-08 02:06:29,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:29,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:29,468 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 573 proven. 0 refuted. 0 times theorem prover too weak. 175 trivial. 0 not checked. [2025-03-08 02:06:29,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:29,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730817655] [2025-03-08 02:06:29,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730817655] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:29,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:29,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:29,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [202204661] [2025-03-08 02:06:29,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:29,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:29,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:29,472 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:29,473 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:29,473 INFO L87 Difference]: Start difference. First operand 4610 states and 4948 transitions. Second operand has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:30,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:30,204 INFO L93 Difference]: Finished difference Result 10863 states and 11778 transitions. [2025-03-08 02:06:30,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:30,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 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 591 [2025-03-08 02:06:30,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:30,224 INFO L225 Difference]: With dead ends: 10863 [2025-03-08 02:06:30,226 INFO L226 Difference]: Without dead ends: 6913 [2025-03-08 02:06:30,230 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-08 02:06:30,230 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 763 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:30,231 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 434 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 763 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:06:30,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6913 states. [2025-03-08 02:06:30,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6913 to 6584. [2025-03-08 02:06:30,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6584 states, 6583 states have (on average 1.058332067446453) internal successors, (6967), 6583 states have internal predecessors, (6967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:30,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6584 states to 6584 states and 6967 transitions. [2025-03-08 02:06:30,309 INFO L78 Accepts]: Start accepts. Automaton has 6584 states and 6967 transitions. Word has length 591 [2025-03-08 02:06:30,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:30,309 INFO L471 AbstractCegarLoop]: Abstraction has 6584 states and 6967 transitions. [2025-03-08 02:06:30,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:30,314 INFO L276 IsEmpty]: Start isEmpty. Operand 6584 states and 6967 transitions. [2025-03-08 02:06:30,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 696 [2025-03-08 02:06:30,322 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:30,323 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:06:30,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 02:06:30,323 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:30,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:30,324 INFO L85 PathProgramCache]: Analyzing trace with hash 827825620, now seen corresponding path program 1 times [2025-03-08 02:06:30,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:30,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158532175] [2025-03-08 02:06:30,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:30,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:30,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 695 statements into 1 equivalence classes. [2025-03-08 02:06:30,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 695 of 695 statements. [2025-03-08 02:06:30,386 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:30,386 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:30,633 INFO L134 CoverageAnalysis]: Checked inductivity of 963 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 210 trivial. 0 not checked. [2025-03-08 02:06:30,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:30,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158532175] [2025-03-08 02:06:30,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158532175] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:30,633 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:30,633 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:30,633 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1271602455] [2025-03-08 02:06:30,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:30,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:30,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:30,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:30,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:30,636 INFO L87 Difference]: Start difference. First operand 6584 states and 6967 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:31,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:31,333 INFO L93 Difference]: Finished difference Result 14482 states and 15462 transitions. [2025-03-08 02:06:31,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:31,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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 695 [2025-03-08 02:06:31,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:31,349 INFO L225 Difference]: With dead ends: 14482 [2025-03-08 02:06:31,350 INFO L226 Difference]: Without dead ends: 8558 [2025-03-08 02:06:31,355 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-08 02:06:31,355 INFO L435 NwaCegarLoop]: 48 mSDtfsCounter, 190 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 773 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 874 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 773 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:31,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 52 Invalid, 874 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 773 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:06:31,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8558 states. [2025-03-08 02:06:31,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8558 to 8558. [2025-03-08 02:06:31,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8558 states, 8557 states have (on average 1.0620544583382026) internal successors, (9088), 8557 states have internal predecessors, (9088), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:31,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8558 states to 8558 states and 9088 transitions. [2025-03-08 02:06:31,429 INFO L78 Accepts]: Start accepts. Automaton has 8558 states and 9088 transitions. Word has length 695 [2025-03-08 02:06:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:31,429 INFO L471 AbstractCegarLoop]: Abstraction has 8558 states and 9088 transitions. [2025-03-08 02:06:31,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 8558 states and 9088 transitions. [2025-03-08 02:06:31,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 856 [2025-03-08 02:06:31,439 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:31,439 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:31,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 02:06:31,440 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:31,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:31,443 INFO L85 PathProgramCache]: Analyzing trace with hash 1053933125, now seen corresponding path program 1 times [2025-03-08 02:06:31,443 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:31,443 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274657951] [2025-03-08 02:06:31,443 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:31,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:31,494 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 855 statements into 1 equivalence classes. [2025-03-08 02:06:31,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 855 of 855 statements. [2025-03-08 02:06:31,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:31,552 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:31,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1361 backedges. 937 proven. 0 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2025-03-08 02:06:31,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:31,863 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274657951] [2025-03-08 02:06:31,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274657951] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:31,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:31,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:31,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2108534889] [2025-03-08 02:06:31,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:31,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:31,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:31,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:31,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:31,866 INFO L87 Difference]: Start difference. First operand 8558 states and 9088 transitions. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:32,626 INFO L93 Difference]: Finished difference Result 18759 states and 20060 transitions. [2025-03-08 02:06:32,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:32,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 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 855 [2025-03-08 02:06:32,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:32,651 INFO L225 Difference]: With dead ends: 18759 [2025-03-08 02:06:32,651 INFO L226 Difference]: Without dead ends: 10861 [2025-03-08 02:06:32,660 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-08 02:06:32,660 INFO L435 NwaCegarLoop]: 436 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 779 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 779 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:32,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 442 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 779 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:06:32,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2025-03-08 02:06:32,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10203. [2025-03-08 02:06:32,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10203 states, 10202 states have (on average 1.0575377376984905) internal successors, (10789), 10202 states have internal predecessors, (10789), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:32,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10203 states to 10203 states and 10789 transitions. [2025-03-08 02:06:32,761 INFO L78 Accepts]: Start accepts. Automaton has 10203 states and 10789 transitions. Word has length 855 [2025-03-08 02:06:32,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:32,763 INFO L471 AbstractCegarLoop]: Abstraction has 10203 states and 10789 transitions. [2025-03-08 02:06:32,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:32,763 INFO L276 IsEmpty]: Start isEmpty. Operand 10203 states and 10789 transitions. [2025-03-08 02:06:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 865 [2025-03-08 02:06:32,773 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:32,775 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:32,775 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-08 02:06:32,775 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:32,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:32,776 INFO L85 PathProgramCache]: Analyzing trace with hash 996287883, now seen corresponding path program 1 times [2025-03-08 02:06:32,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:32,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536194413] [2025-03-08 02:06:32,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:32,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:32,823 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 864 statements into 1 equivalence classes. [2025-03-08 02:06:32,849 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 864 of 864 statements. [2025-03-08 02:06:32,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:32,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:33,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1126 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2025-03-08 02:06:33,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:33,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536194413] [2025-03-08 02:06:33,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536194413] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:33,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:33,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:33,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1760766840] [2025-03-08 02:06:33,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:33,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:33,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:33,160 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:33,160 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:33,160 INFO L87 Difference]: Start difference. First operand 10203 states and 10789 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:33,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:33,775 INFO L93 Difference]: Finished difference Result 24681 states and 26252 transitions. [2025-03-08 02:06:33,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:33,775 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 864 [2025-03-08 02:06:33,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:33,795 INFO L225 Difference]: With dead ends: 24681 [2025-03-08 02:06:33,795 INFO L226 Difference]: Without dead ends: 13493 [2025-03-08 02:06:33,804 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-08 02:06:33,804 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 286 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 286 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:33,805 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [286 Valid, 430 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:06:33,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13493 states. [2025-03-08 02:06:33,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13493 to 13493. [2025-03-08 02:06:33,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.0472131633560628) internal successors, (14129), 13492 states have internal predecessors, (14129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:33,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 14129 transitions. [2025-03-08 02:06:33,937 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 14129 transitions. Word has length 864 [2025-03-08 02:06:33,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:33,938 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 14129 transitions. [2025-03-08 02:06:33,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:33,938 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 14129 transitions. [2025-03-08 02:06:33,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1083 [2025-03-08 02:06:33,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:33,951 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:06:33,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-08 02:06:33,951 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:33,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:33,952 INFO L85 PathProgramCache]: Analyzing trace with hash -951382294, now seen corresponding path program 1 times [2025-03-08 02:06:33,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:33,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820565052] [2025-03-08 02:06:33,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:33,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:34,008 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1082 statements into 1 equivalence classes. [2025-03-08 02:06:34,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1082 of 1082 statements. [2025-03-08 02:06:34,041 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:34,041 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:34,417 INFO L134 CoverageAnalysis]: Checked inductivity of 1688 backedges. 203 proven. 0 refuted. 0 times theorem prover too weak. 1485 trivial. 0 not checked. [2025-03-08 02:06:34,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:34,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820565052] [2025-03-08 02:06:34,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820565052] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:34,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:34,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:34,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797858557] [2025-03-08 02:06:34,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:34,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:34,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:34,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:34,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:34,420 INFO L87 Difference]: Start difference. First operand 13493 states and 14129 transitions. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:35,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:35,002 INFO L93 Difference]: Finished difference Result 29287 states and 30732 transitions. [2025-03-08 02:06:35,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:35,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 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 1082 [2025-03-08 02:06:35,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:35,025 INFO L225 Difference]: With dead ends: 29287 [2025-03-08 02:06:35,025 INFO L226 Difference]: Without dead ends: 14480 [2025-03-08 02:06:35,041 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-08 02:06:35,042 INFO L435 NwaCegarLoop]: 406 mSDtfsCounter, 290 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 290 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:35,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [290 Valid, 412 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:35,053 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2025-03-08 02:06:35,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2025-03-08 02:06:35,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.0375716555010706) internal successors, (15023), 14479 states have internal predecessors, (15023), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:35,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15023 transitions. [2025-03-08 02:06:35,255 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15023 transitions. Word has length 1082 [2025-03-08 02:06:35,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:35,257 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15023 transitions. [2025-03-08 02:06:35,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:35,258 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15023 transitions. [2025-03-08 02:06:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2025-03-08 02:06:35,281 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:35,282 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:35,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 02:06:35,282 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:35,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:35,283 INFO L85 PathProgramCache]: Analyzing trace with hash 512466375, now seen corresponding path program 1 times [2025-03-08 02:06:35,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:35,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291020053] [2025-03-08 02:06:35,283 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:35,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:35,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1212 statements into 1 equivalence classes. [2025-03-08 02:06:35,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1212 of 1212 statements. [2025-03-08 02:06:35,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:35,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:36,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2378 backedges. 1704 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2025-03-08 02:06:36,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:36,419 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291020053] [2025-03-08 02:06:36,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291020053] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:36,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:36,420 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:06:36,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558752075] [2025-03-08 02:06:36,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:36,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:06:36,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:36,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:06:36,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:06:36,422 INFO L87 Difference]: Start difference. First operand 14480 states and 15023 transitions. Second operand has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:37,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:37,209 INFO L93 Difference]: Finished difference Result 28310 states and 29387 transitions. [2025-03-08 02:06:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 02:06:37,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 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 1212 [2025-03-08 02:06:37,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:37,226 INFO L225 Difference]: With dead ends: 28310 [2025-03-08 02:06:37,226 INFO L226 Difference]: Without dead ends: 14490 [2025-03-08 02:06:37,235 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:06:37,236 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:37,236 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 436 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:06:37,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14490 states. [2025-03-08 02:06:37,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14490 to 14151. [2025-03-08 02:06:37,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.037809187279152) internal successors, (14685), 14150 states have internal predecessors, (14685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:37,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14685 transitions. [2025-03-08 02:06:37,352 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14685 transitions. Word has length 1212 [2025-03-08 02:06:37,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:37,353 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14685 transitions. [2025-03-08 02:06:37,353 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 182.75) internal successors, (731), 4 states have internal predecessors, (731), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:37,353 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14685 transitions. [2025-03-08 02:06:37,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1228 [2025-03-08 02:06:37,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:37,368 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:06:37,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 02:06:37,368 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:37,369 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:37,369 INFO L85 PathProgramCache]: Analyzing trace with hash 641501098, now seen corresponding path program 1 times [2025-03-08 02:06:37,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:37,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236067553] [2025-03-08 02:06:37,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:37,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:37,440 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1227 statements into 1 equivalence classes. [2025-03-08 02:06:37,470 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1227 of 1227 statements. [2025-03-08 02:06:37,471 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:37,471 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:38,356 INFO L134 CoverageAnalysis]: Checked inductivity of 3063 backedges. 1715 proven. 0 refuted. 0 times theorem prover too weak. 1348 trivial. 0 not checked. [2025-03-08 02:06:38,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:38,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236067553] [2025-03-08 02:06:38,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [236067553] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:38,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:38,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:38,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2109285037] [2025-03-08 02:06:38,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:38,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:38,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:38,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:38,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:38,359 INFO L87 Difference]: Start difference. First operand 14151 states and 14685 transitions. Second operand has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:38,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:38,961 INFO L93 Difference]: Finished difference Result 28300 states and 29395 transitions. [2025-03-08 02:06:38,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:38,962 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 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 1227 [2025-03-08 02:06:38,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:38,978 INFO L225 Difference]: With dead ends: 28300 [2025-03-08 02:06:38,979 INFO L226 Difference]: Without dead ends: 14809 [2025-03-08 02:06:38,989 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-08 02:06:38,990 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:38,990 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 430 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:38,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2025-03-08 02:06:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14809. [2025-03-08 02:06:39,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.0356564019448946) internal successors, (15336), 14808 states have internal predecessors, (15336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:39,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15336 transitions. [2025-03-08 02:06:39,131 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15336 transitions. Word has length 1227 [2025-03-08 02:06:39,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:39,132 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15336 transitions. [2025-03-08 02:06:39,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.0) internal successors, (570), 3 states have internal predecessors, (570), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:39,132 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15336 transitions. [2025-03-08 02:06:39,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1253 [2025-03-08 02:06:39,153 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:39,153 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:39,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 02:06:39,154 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:39,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:39,154 INFO L85 PathProgramCache]: Analyzing trace with hash -1842860844, now seen corresponding path program 1 times [2025-03-08 02:06:39,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:39,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081817983] [2025-03-08 02:06:39,155 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:39,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:39,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1252 statements into 1 equivalence classes. [2025-03-08 02:06:39,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1252 of 1252 statements. [2025-03-08 02:06:39,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:39,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:40,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2679 backedges. 1835 proven. 0 refuted. 0 times theorem prover too weak. 844 trivial. 0 not checked. [2025-03-08 02:06:40,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:40,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081817983] [2025-03-08 02:06:40,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081817983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:40,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:40,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 02:06:40,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225821276] [2025-03-08 02:06:40,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:40,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:06:40,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:40,051 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:06:40,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:06:40,051 INFO L87 Difference]: Start difference. First operand 14809 states and 15336 transitions. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:40,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:40,820 INFO L93 Difference]: Finished difference Result 28958 states and 30003 transitions. [2025-03-08 02:06:40,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:06:40,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 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 1252 [2025-03-08 02:06:40,821 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:40,832 INFO L225 Difference]: With dead ends: 28958 [2025-03-08 02:06:40,832 INFO L226 Difference]: Without dead ends: 14809 [2025-03-08 02:06:40,839 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:06:40,839 INFO L435 NwaCegarLoop]: 424 mSDtfsCounter, 120 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:40,839 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 553 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 02:06:40,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2025-03-08 02:06:40,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14809. [2025-03-08 02:06:40,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.034981091301999) internal successors, (15326), 14808 states have internal predecessors, (15326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15326 transitions. [2025-03-08 02:06:40,970 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15326 transitions. Word has length 1252 [2025-03-08 02:06:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:40,971 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15326 transitions. [2025-03-08 02:06:40,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:40,971 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15326 transitions. [2025-03-08 02:06:40,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1282 [2025-03-08 02:06:40,983 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:40,983 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:40,984 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 02:06:40,984 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:40,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:40,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1716428511, now seen corresponding path program 1 times [2025-03-08 02:06:40,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:40,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40857216] [2025-03-08 02:06:40,985 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:40,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:41,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1281 statements into 1 equivalence classes. [2025-03-08 02:06:41,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1281 of 1281 statements. [2025-03-08 02:06:41,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:41,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 3084 backedges. 1848 proven. 0 refuted. 0 times theorem prover too weak. 1236 trivial. 0 not checked. [2025-03-08 02:06:42,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:42,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40857216] [2025-03-08 02:06:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40857216] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:42,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:42,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:42,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244724924] [2025-03-08 02:06:42,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:42,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:42,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:42,915 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:42,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:42,915 INFO L87 Difference]: Start difference. First operand 14809 states and 15326 transitions. Second operand has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:43,594 INFO L93 Difference]: Finished difference Result 28958 states and 29983 transitions. [2025-03-08 02:06:43,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:43,594 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1281 [2025-03-08 02:06:43,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:43,607 INFO L225 Difference]: With dead ends: 28958 [2025-03-08 02:06:43,607 INFO L226 Difference]: Without dead ends: 14809 [2025-03-08 02:06:43,615 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 8 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-08 02:06:43,616 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 116 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:43,616 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [116 Valid, 377 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:06:43,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2025-03-08 02:06:43,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14809. [2025-03-08 02:06:43,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.0331577525661804) internal successors, (15299), 14808 states have internal predecessors, (15299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:43,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15299 transitions. [2025-03-08 02:06:43,758 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15299 transitions. Word has length 1281 [2025-03-08 02:06:43,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:43,759 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15299 transitions. [2025-03-08 02:06:43,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.66666666666666) internal successors, (500), 3 states have internal predecessors, (500), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:43,759 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15299 transitions. [2025-03-08 02:06:43,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1350 [2025-03-08 02:06:43,783 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:43,783 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:43,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-08 02:06:43,784 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:43,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:43,784 INFO L85 PathProgramCache]: Analyzing trace with hash -473638030, now seen corresponding path program 1 times [2025-03-08 02:06:43,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:43,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524737829] [2025-03-08 02:06:43,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:43,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:43,894 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1349 statements into 1 equivalence classes. [2025-03-08 02:06:43,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1349 of 1349 statements. [2025-03-08 02:06:43,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:43,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:44,951 INFO L134 CoverageAnalysis]: Checked inductivity of 3608 backedges. 880 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2025-03-08 02:06:44,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:44,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524737829] [2025-03-08 02:06:44,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524737829] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:44,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:44,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:44,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1707223971] [2025-03-08 02:06:44,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:44,952 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:06:44,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:44,953 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:06:44,953 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:44,953 INFO L87 Difference]: Start difference. First operand 14809 states and 15299 transitions. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:45,522 INFO L93 Difference]: Finished difference Result 29287 states and 30265 transitions. [2025-03-08 02:06:45,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:45,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 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 1349 [2025-03-08 02:06:45,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:45,535 INFO L225 Difference]: With dead ends: 29287 [2025-03-08 02:06:45,535 INFO L226 Difference]: Without dead ends: 14809 [2025-03-08 02:06:45,544 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:06:45,544 INFO L435 NwaCegarLoop]: 363 mSDtfsCounter, 271 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:45,544 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 368 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:45,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2025-03-08 02:06:45,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14809. [2025-03-08 02:06:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.027552674230146) internal successors, (15216), 14808 states have internal predecessors, (15216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:45,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15216 transitions. [2025-03-08 02:06:45,641 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15216 transitions. Word has length 1349 [2025-03-08 02:06:45,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:45,642 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15216 transitions. [2025-03-08 02:06:45,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:45,642 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15216 transitions. [2025-03-08 02:06:45,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1358 [2025-03-08 02:06:45,655 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:45,656 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:06:45,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-08 02:06:45,656 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:45,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:45,657 INFO L85 PathProgramCache]: Analyzing trace with hash -1824967398, now seen corresponding path program 1 times [2025-03-08 02:06:45,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:45,657 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745168595] [2025-03-08 02:06:45,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:45,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:45,715 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1357 statements into 1 equivalence classes. [2025-03-08 02:06:45,752 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1357 of 1357 statements. [2025-03-08 02:06:45,753 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:45,753 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:46,456 INFO L134 CoverageAnalysis]: Checked inductivity of 3185 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 2829 trivial. 0 not checked. [2025-03-08 02:06:46,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:46,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745168595] [2025-03-08 02:06:46,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745168595] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:46,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:46,457 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 02:06:46,457 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455838541] [2025-03-08 02:06:46,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:46,457 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 02:06:46,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:46,458 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 02:06:46,458 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:06:46,458 INFO L87 Difference]: Start difference. First operand 14809 states and 15216 transitions. Second operand has 6 states, 6 states have (on average 57.833333333333336) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:46,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:46,995 INFO L93 Difference]: Finished difference Result 28395 states and 29182 transitions. [2025-03-08 02:06:46,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 02:06:46,995 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.833333333333336) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 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 1357 [2025-03-08 02:06:46,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:47,006 INFO L225 Difference]: With dead ends: 28395 [2025-03-08 02:06:47,006 INFO L226 Difference]: Without dead ends: 14151 [2025-03-08 02:06:47,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-08 02:06:47,014 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 22 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 952 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 455 SdHoareTripleChecker+Invalid, 955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:47,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 455 Invalid, 955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 952 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:06:47,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-03-08 02:06:47,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 12506. [2025-03-08 02:06:47,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12506 states, 12505 states have (on average 1.0255897640943623) internal successors, (12825), 12505 states have internal predecessors, (12825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:47,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12506 states to 12506 states and 12825 transitions. [2025-03-08 02:06:47,102 INFO L78 Accepts]: Start accepts. Automaton has 12506 states and 12825 transitions. Word has length 1357 [2025-03-08 02:06:47,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:47,103 INFO L471 AbstractCegarLoop]: Abstraction has 12506 states and 12825 transitions. [2025-03-08 02:06:47,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.833333333333336) internal successors, (347), 6 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:47,103 INFO L276 IsEmpty]: Start isEmpty. Operand 12506 states and 12825 transitions. [2025-03-08 02:06:47,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1448 [2025-03-08 02:06:47,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:47,117 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:06:47,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-08 02:06:47,117 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:47,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:47,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1720221031, now seen corresponding path program 1 times [2025-03-08 02:06:47,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:47,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1266422442] [2025-03-08 02:06:47,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:47,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:47,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1447 statements into 1 equivalence classes. [2025-03-08 02:06:47,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1447 of 1447 statements. [2025-03-08 02:06:47,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:47,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:48,116 INFO L134 CoverageAnalysis]: Checked inductivity of 4081 backedges. 2460 proven. 66 refuted. 0 times theorem prover too weak. 1555 trivial. 0 not checked. [2025-03-08 02:06:48,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:48,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1266422442] [2025-03-08 02:06:48,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1266422442] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:06:48,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [16516522] [2025-03-08 02:06:48,117 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:48,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:48,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:06:48,119 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-08 02:06:48,121 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-08 02:06:48,220 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1447 statements into 1 equivalence classes. [2025-03-08 02:06:48,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1447 of 1447 statements. [2025-03-08 02:06:48,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:48,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:48,397 INFO L256 TraceCheckSpWp]: Trace formula consists of 1674 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-03-08 02:06:48,423 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:06:50,850 INFO L134 CoverageAnalysis]: Checked inductivity of 4081 backedges. 1903 proven. 201 refuted. 0 times theorem prover too weak. 1977 trivial. 0 not checked. [2025-03-08 02:06:50,850 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:06:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 4081 backedges. 1903 proven. 201 refuted. 0 times theorem prover too weak. 1977 trivial. 0 not checked. [2025-03-08 02:06:53,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [16516522] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:06:53,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:06:53,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2025-03-08 02:06:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553174593] [2025-03-08 02:06:53,804 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:06:53,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 02:06:53,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:53,808 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 02:06:53,808 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:06:53,808 INFO L87 Difference]: Start difference. First operand 12506 states and 12825 transitions. Second operand has 9 states, 9 states have (on average 189.55555555555554) internal successors, (1706), 8 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:57,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:57,312 INFO L93 Difference]: Finished difference Result 35540 states and 36471 transitions. [2025-03-08 02:06:57,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-08 02:06:57,312 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 189.55555555555554) internal successors, (1706), 8 states have internal predecessors, (1706), 0 states have call successors, (0), 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 1447 [2025-03-08 02:06:57,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:57,328 INFO L225 Difference]: With dead ends: 35540 [2025-03-08 02:06:57,329 INFO L226 Difference]: Without dead ends: 23694 [2025-03-08 02:06:57,336 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2904 GetRequests, 2889 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=179, Unknown=0, NotChecked=0, Total=272 [2025-03-08 02:06:57,336 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 1942 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5914 mSolverCounterSat, 341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1942 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6255 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 341 IncrementalHoareTripleChecker+Valid, 5914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:57,336 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1942 Valid, 75 Invalid, 6255 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [341 Valid, 5914 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-03-08 02:06:57,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23694 states. [2025-03-08 02:06:57,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23694 to 18099. [2025-03-08 02:06:57,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18099 states, 18098 states have (on average 1.0256381920654216) internal successors, (18562), 18098 states have internal predecessors, (18562), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:57,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18099 states to 18099 states and 18562 transitions. [2025-03-08 02:06:57,478 INFO L78 Accepts]: Start accepts. Automaton has 18099 states and 18562 transitions. Word has length 1447 [2025-03-08 02:06:57,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:57,479 INFO L471 AbstractCegarLoop]: Abstraction has 18099 states and 18562 transitions. [2025-03-08 02:06:57,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 189.55555555555554) internal successors, (1706), 8 states have internal predecessors, (1706), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:57,479 INFO L276 IsEmpty]: Start isEmpty. Operand 18099 states and 18562 transitions. [2025-03-08 02:06:57,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1478 [2025-03-08 02:06:57,496 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:57,496 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-08 02:06:57,506 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 02:06:57,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:06:57,697 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:57,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:57,698 INFO L85 PathProgramCache]: Analyzing trace with hash 488490459, now seen corresponding path program 1 times [2025-03-08 02:06:57,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:57,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095562860] [2025-03-08 02:06:57,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:57,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:57,798 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1477 statements into 1 equivalence classes. [2025-03-08 02:06:57,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1477 of 1477 statements. [2025-03-08 02:06:57,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:57,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:06:58,845 INFO L134 CoverageAnalysis]: Checked inductivity of 4798 backedges. 2153 proven. 0 refuted. 0 times theorem prover too weak. 2645 trivial. 0 not checked. [2025-03-08 02:06:58,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:06:58,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095562860] [2025-03-08 02:06:58,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095562860] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:06:58,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:06:58,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:06:58,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923496369] [2025-03-08 02:06:58,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:06:58,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:06:58,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:06:58,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:06:58,848 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 02:06:58,848 INFO L87 Difference]: Start difference. First operand 18099 states and 18562 transitions. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:59,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:06:59,525 INFO L93 Difference]: Finished difference Result 36196 states and 37125 transitions. [2025-03-08 02:06:59,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:06:59,526 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1477 [2025-03-08 02:06:59,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:06:59,542 INFO L225 Difference]: With dead ends: 36196 [2025-03-08 02:06:59,543 INFO L226 Difference]: Without dead ends: 18428 [2025-03-08 02:06:59,554 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-08 02:06:59,554 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 173 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1151 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 1154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 1151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:06:59,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 99 Invalid, 1154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 1151 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:06:59,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2025-03-08 02:06:59,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18428. [2025-03-08 02:06:59,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18428 states, 18427 states have (on average 1.0252889781299181) internal successors, (18893), 18427 states have internal predecessors, (18893), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:59,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18428 states to 18428 states and 18893 transitions. [2025-03-08 02:06:59,707 INFO L78 Accepts]: Start accepts. Automaton has 18428 states and 18893 transitions. Word has length 1477 [2025-03-08 02:06:59,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:06:59,708 INFO L471 AbstractCegarLoop]: Abstraction has 18428 states and 18893 transitions. [2025-03-08 02:06:59,708 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 3 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:06:59,708 INFO L276 IsEmpty]: Start isEmpty. Operand 18428 states and 18893 transitions. [2025-03-08 02:06:59,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1541 [2025-03-08 02:06:59,724 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:06:59,725 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-03-08 02:06:59,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-08 02:06:59,725 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:06:59,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:06:59,726 INFO L85 PathProgramCache]: Analyzing trace with hash 305086089, now seen corresponding path program 1 times [2025-03-08 02:06:59,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:06:59,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208029377] [2025-03-08 02:06:59,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:06:59,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:06:59,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1540 statements into 1 equivalence classes. [2025-03-08 02:06:59,837 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1540 of 1540 statements. [2025-03-08 02:06:59,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:06:59,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:01,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4985 backedges. 2829 proven. 0 refuted. 0 times theorem prover too weak. 2156 trivial. 0 not checked. [2025-03-08 02:07:01,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:01,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208029377] [2025-03-08 02:07:01,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208029377] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:01,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 02:07:01,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 02:07:01,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756620389] [2025-03-08 02:07:01,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:01,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:01,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:01,134 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:01,134 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 02:07:01,134 INFO L87 Difference]: Start difference. First operand 18428 states and 18893 transitions. Second operand has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:01,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:01,758 INFO L93 Difference]: Finished difference Result 38830 states and 39804 transitions. [2025-03-08 02:07:01,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:01,759 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 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 1540 [2025-03-08 02:07:01,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:01,783 INFO L225 Difference]: With dead ends: 38830 [2025-03-08 02:07:01,783 INFO L226 Difference]: Without dead ends: 21062 [2025-03-08 02:07:01,797 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-08 02:07:01,797 INFO L435 NwaCegarLoop]: 39 mSDtfsCounter, 209 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:01,798 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 44 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:07:01,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21062 states. [2025-03-08 02:07:01,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21062 to 18757. [2025-03-08 02:07:01,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18757 states, 18756 states have (on average 1.02319257837492) internal successors, (19191), 18756 states have internal predecessors, (19191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18757 states to 18757 states and 19191 transitions. [2025-03-08 02:07:01,974 INFO L78 Accepts]: Start accepts. Automaton has 18757 states and 19191 transitions. Word has length 1540 [2025-03-08 02:07:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:01,974 INFO L471 AbstractCegarLoop]: Abstraction has 18757 states and 19191 transitions. [2025-03-08 02:07:01,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 205.33333333333334) internal successors, (616), 3 states have internal predecessors, (616), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 18757 states and 19191 transitions. [2025-03-08 02:07:01,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1582 [2025-03-08 02:07:01,991 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:01,991 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-08 02:07:01,991 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-08 02:07:01,992 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:01,992 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:01,992 INFO L85 PathProgramCache]: Analyzing trace with hash -440237426, now seen corresponding path program 1 times [2025-03-08 02:07:01,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:01,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316956224] [2025-03-08 02:07:01,992 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:01,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:02,059 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1581 statements into 1 equivalence classes. [2025-03-08 02:07:02,108 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1581 of 1581 statements. [2025-03-08 02:07:02,108 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:02,108 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:04,118 INFO L134 CoverageAnalysis]: Checked inductivity of 5690 backedges. 2680 proven. 40 refuted. 0 times theorem prover too weak. 2970 trivial. 0 not checked. [2025-03-08 02:07:04,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:04,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316956224] [2025-03-08 02:07:04,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1316956224] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:04,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [229121117] [2025-03-08 02:07:04,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:04,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:04,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:04,120 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-08 02:07:04,121 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-08 02:07:04,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1581 statements into 1 equivalence classes. [2025-03-08 02:07:04,396 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1581 of 1581 statements. [2025-03-08 02:07:04,396 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:04,396 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:04,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 1852 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:07:04,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:04,773 INFO L134 CoverageAnalysis]: Checked inductivity of 5690 backedges. 2700 proven. 0 refuted. 0 times theorem prover too weak. 2990 trivial. 0 not checked. [2025-03-08 02:07:04,773 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:07:04,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [229121117] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:04,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:07:04,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-08 02:07:04,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373818315] [2025-03-08 02:07:04,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:04,774 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:04,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:04,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:04,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:07:04,775 INFO L87 Difference]: Start difference. First operand 18757 states and 19191 transitions. Second operand has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:05,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:05,338 INFO L93 Difference]: Finished difference Result 36854 states and 37718 transitions. [2025-03-08 02:07:05,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:05,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1581 [2025-03-08 02:07:05,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:05,361 INFO L225 Difference]: With dead ends: 36854 [2025-03-08 02:07:05,361 INFO L226 Difference]: Without dead ends: 18757 [2025-03-08 02:07:05,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1588 GetRequests, 1585 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 02:07:05,380 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 120 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 739 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 749 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 739 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:05,380 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 421 Invalid, 749 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 739 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:07:05,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18757 states. [2025-03-08 02:07:05,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18757 to 18757. [2025-03-08 02:07:05,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18757 states, 18756 states have (on average 1.0230326295585412) internal successors, (19188), 18756 states have internal predecessors, (19188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:05,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18757 states to 18757 states and 19188 transitions. [2025-03-08 02:07:05,549 INFO L78 Accepts]: Start accepts. Automaton has 18757 states and 19188 transitions. Word has length 1581 [2025-03-08 02:07:05,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:05,549 INFO L471 AbstractCegarLoop]: Abstraction has 18757 states and 19188 transitions. [2025-03-08 02:07:05,549 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.33333333333334) internal successors, (634), 3 states have internal predecessors, (634), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:05,549 INFO L276 IsEmpty]: Start isEmpty. Operand 18757 states and 19188 transitions. [2025-03-08 02:07:05,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1646 [2025-03-08 02:07:05,569 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:05,570 INFO L218 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 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-08 02:07:05,578 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-08 02:07:05,771 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,SelfDestructingSolverStorable21 [2025-03-08 02:07:05,772 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:05,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:05,773 INFO L85 PathProgramCache]: Analyzing trace with hash -783431885, now seen corresponding path program 1 times [2025-03-08 02:07:05,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:05,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486428242] [2025-03-08 02:07:05,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:05,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:05,846 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-03-08 02:07:05,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-03-08 02:07:05,875 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:05,875 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:06,884 INFO L134 CoverageAnalysis]: Checked inductivity of 5231 backedges. 3727 proven. 115 refuted. 0 times theorem prover too weak. 1389 trivial. 0 not checked. [2025-03-08 02:07:06,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:06,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486428242] [2025-03-08 02:07:06,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486428242] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:06,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789185915] [2025-03-08 02:07:06,884 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:06,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:06,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:06,886 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-08 02:07:06,887 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-08 02:07:06,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1645 statements into 1 equivalence classes. [2025-03-08 02:07:07,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1645 of 1645 statements. [2025-03-08 02:07:07,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:07,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:07,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1892 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-03-08 02:07:07,224 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:08,418 INFO L134 CoverageAnalysis]: Checked inductivity of 5231 backedges. 3727 proven. 115 refuted. 0 times theorem prover too weak. 1389 trivial. 0 not checked. [2025-03-08 02:07:08,418 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:07:09,558 INFO L134 CoverageAnalysis]: Checked inductivity of 5231 backedges. 3727 proven. 115 refuted. 0 times theorem prover too weak. 1389 trivial. 0 not checked. [2025-03-08 02:07:09,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789185915] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 02:07:09,559 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 02:07:09,559 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2025-03-08 02:07:09,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878221008] [2025-03-08 02:07:09,559 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 02:07:09,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-08 02:07:09,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:09,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-08 02:07:09,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:07:09,562 INFO L87 Difference]: Start difference. First operand 18757 states and 19188 transitions. Second operand has 7 states, 7 states have (on average 141.28571428571428) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:11,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:11,180 INFO L93 Difference]: Finished difference Result 37512 states and 38382 transitions. [2025-03-08 02:07:11,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-08 02:07:11,180 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 141.28571428571428) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 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 1645 [2025-03-08 02:07:11,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:11,199 INFO L225 Difference]: With dead ends: 37512 [2025-03-08 02:07:11,199 INFO L226 Difference]: Without dead ends: 19415 [2025-03-08 02:07:11,211 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3295 GetRequests, 3288 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=31, Invalid=41, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:07:11,211 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 1014 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 3314 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1014 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 3372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 3314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:11,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1014 Valid, 100 Invalid, 3372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 3314 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-08 02:07:11,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2025-03-08 02:07:11,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 16783. [2025-03-08 02:07:11,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0196043379811703) internal successors, (17111), 16782 states have internal predecessors, (17111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:11,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17111 transitions. [2025-03-08 02:07:11,355 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17111 transitions. Word has length 1645 [2025-03-08 02:07:11,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:11,356 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17111 transitions. [2025-03-08 02:07:11,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 141.28571428571428) internal successors, (989), 6 states have internal predecessors, (989), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:11,356 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17111 transitions. [2025-03-08 02:07:11,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1701 [2025-03-08 02:07:11,372 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:11,373 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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-08 02:07:11,380 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-08 02:07:11,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:11,573 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:11,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:11,574 INFO L85 PathProgramCache]: Analyzing trace with hash 2053786238, now seen corresponding path program 1 times [2025-03-08 02:07:11,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:11,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950028966] [2025-03-08 02:07:11,574 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:11,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:11,687 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1700 statements into 1 equivalence classes. [2025-03-08 02:07:11,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1700 of 1700 statements. [2025-03-08 02:07:11,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:11,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:14,046 INFO L134 CoverageAnalysis]: Checked inductivity of 5315 backedges. 3326 proven. 1184 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2025-03-08 02:07:14,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950028966] [2025-03-08 02:07:14,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950028966] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:14,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [355248977] [2025-03-08 02:07:14,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:14,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:14,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:14,049 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-08 02:07:14,050 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-08 02:07:14,195 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1700 statements into 1 equivalence classes. [2025-03-08 02:07:14,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1700 of 1700 statements. [2025-03-08 02:07:14,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:14,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:14,401 INFO L256 TraceCheckSpWp]: Trace formula consists of 1928 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:07:14,415 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:14,654 INFO L134 CoverageAnalysis]: Checked inductivity of 5315 backedges. 3385 proven. 0 refuted. 0 times theorem prover too weak. 1930 trivial. 0 not checked. [2025-03-08 02:07:14,654 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:07:14,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [355248977] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:14,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:07:14,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 9 [2025-03-08 02:07:14,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398952216] [2025-03-08 02:07:14,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:14,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:14,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:14,656 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:14,656 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:07:14,656 INFO L87 Difference]: Start difference. First operand 16783 states and 17111 transitions. Second operand has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:15,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:15,227 INFO L93 Difference]: Finished difference Result 32906 states and 33558 transitions. [2025-03-08 02:07:15,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:15,227 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 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 1700 [2025-03-08 02:07:15,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:15,241 INFO L225 Difference]: With dead ends: 32906 [2025-03-08 02:07:15,241 INFO L226 Difference]: Without dead ends: 16783 [2025-03-08 02:07:15,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1708 GetRequests, 1701 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-08 02:07:15,249 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 67 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:15,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 404 Invalid, 767 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:07:15,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16783 states. [2025-03-08 02:07:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16783 to 16783. [2025-03-08 02:07:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.0182934096055298) internal successors, (17089), 16782 states have internal predecessors, (17089), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:15,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17089 transitions. [2025-03-08 02:07:15,371 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17089 transitions. Word has length 1700 [2025-03-08 02:07:15,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:15,371 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17089 transitions. [2025-03-08 02:07:15,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 249.0) internal successors, (747), 3 states have internal predecessors, (747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:15,371 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17089 transitions. [2025-03-08 02:07:15,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2093 [2025-03-08 02:07:15,394 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:15,395 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:07:15,402 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-08 02:07:15,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:15,595 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:15,596 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:15,596 INFO L85 PathProgramCache]: Analyzing trace with hash 460963309, now seen corresponding path program 1 times [2025-03-08 02:07:15,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:15,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [970127127] [2025-03-08 02:07:15,596 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:15,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:15,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2092 statements into 1 equivalence classes. [2025-03-08 02:07:15,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2092 of 2092 statements. [2025-03-08 02:07:15,739 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:15,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:17,834 INFO L134 CoverageAnalysis]: Checked inductivity of 9146 backedges. 7109 proven. 315 refuted. 0 times theorem prover too weak. 1722 trivial. 0 not checked. [2025-03-08 02:07:17,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:17,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [970127127] [2025-03-08 02:07:17,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [970127127] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:17,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694985991] [2025-03-08 02:07:17,835 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:17,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:17,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:17,837 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-08 02:07:17,838 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-08 02:07:18,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2092 statements into 1 equivalence classes. [2025-03-08 02:07:18,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2092 of 2092 statements. [2025-03-08 02:07:18,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:18,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:18,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 2404 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:07:18,362 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:18,582 INFO L134 CoverageAnalysis]: Checked inductivity of 9146 backedges. 3612 proven. 0 refuted. 0 times theorem prover too weak. 5534 trivial. 0 not checked. [2025-03-08 02:07:18,582 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:07:18,583 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694985991] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:18,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:07:18,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-03-08 02:07:18,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083504137] [2025-03-08 02:07:18,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:18,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:18,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:18,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:18,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:07:18,585 INFO L87 Difference]: Start difference. First operand 16783 states and 17089 transitions. Second operand has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:19,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:19,168 INFO L93 Difference]: Finished difference Result 32906 states and 33514 transitions. [2025-03-08 02:07:19,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:19,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 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 2092 [2025-03-08 02:07:19,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:19,185 INFO L225 Difference]: With dead ends: 32906 [2025-03-08 02:07:19,186 INFO L226 Difference]: Without dead ends: 16783 [2025-03-08 02:07:19,195 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2098 GetRequests, 2092 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:07:19,196 INFO L435 NwaCegarLoop]: 415 mSDtfsCounter, 119 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 742 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:19,196 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 421 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 742 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:07:19,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16783 states. [2025-03-08 02:07:19,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16783 to 15796. [2025-03-08 02:07:19,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15796 states, 15795 states have (on average 1.0157011712567268) internal successors, (16043), 15795 states have internal predecessors, (16043), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:19,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16043 transitions. [2025-03-08 02:07:19,313 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16043 transitions. Word has length 2092 [2025-03-08 02:07:19,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:19,314 INFO L471 AbstractCegarLoop]: Abstraction has 15796 states and 16043 transitions. [2025-03-08 02:07:19,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 219.66666666666666) internal successors, (659), 3 states have internal predecessors, (659), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16043 transitions. [2025-03-08 02:07:19,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2146 [2025-03-08 02:07:19,337 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:19,337 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:19,345 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-08 02:07:19,538 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,SelfDestructingSolverStorable24 [2025-03-08 02:07:19,538 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:19,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:19,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1582844181, now seen corresponding path program 1 times [2025-03-08 02:07:19,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:19,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943888151] [2025-03-08 02:07:19,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:19,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:19,625 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2145 statements into 1 equivalence classes. [2025-03-08 02:07:19,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2145 of 2145 statements. [2025-03-08 02:07:19,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:19,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:21,613 INFO L134 CoverageAnalysis]: Checked inductivity of 9951 backedges. 7269 proven. 91 refuted. 0 times theorem prover too weak. 2591 trivial. 0 not checked. [2025-03-08 02:07:21,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:21,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943888151] [2025-03-08 02:07:21,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943888151] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:21,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069627348] [2025-03-08 02:07:21,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:21,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:21,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:21,616 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:07:21,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 02:07:21,746 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2145 statements into 1 equivalence classes. [2025-03-08 02:07:21,966 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2145 of 2145 statements. [2025-03-08 02:07:21,966 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:21,966 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:21,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 2485 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-08 02:07:21,984 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:22,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9951 backedges. 1476 proven. 0 refuted. 0 times theorem prover too weak. 8475 trivial. 0 not checked. [2025-03-08 02:07:22,173 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:07:22,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069627348] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:22,173 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:07:22,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 8 [2025-03-08 02:07:22,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324713930] [2025-03-08 02:07:22,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:22,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:22,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:22,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:22,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:07:22,175 INFO L87 Difference]: Start difference. First operand 15796 states and 16043 transitions. Second operand has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:23,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:23,176 INFO L93 Difference]: Finished difference Result 34551 states and 35108 transitions. [2025-03-08 02:07:23,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:07:23,177 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 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 2145 [2025-03-08 02:07:23,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:23,195 INFO L225 Difference]: With dead ends: 34551 [2025-03-08 02:07:23,195 INFO L226 Difference]: Without dead ends: 19415 [2025-03-08 02:07:23,206 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2150 GetRequests, 2144 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-03-08 02:07:23,206 INFO L435 NwaCegarLoop]: 47 mSDtfsCounter, 547 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1473 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 1545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:23,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 57 Invalid, 1545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1473 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-08 02:07:23,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19415 states. [2025-03-08 02:07:23,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19415 to 16454. [2025-03-08 02:07:23,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.0154986932474321) internal successors, (16708), 16453 states have internal predecessors, (16708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:23,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 16708 transitions. [2025-03-08 02:07:23,342 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 16708 transitions. Word has length 2145 [2025-03-08 02:07:23,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:23,343 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 16708 transitions. [2025-03-08 02:07:23,343 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 100.5) internal successors, (402), 4 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:23,343 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 16708 transitions. [2025-03-08 02:07:23,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2254 [2025-03-08 02:07:23,416 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:23,416 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 02:07:23,424 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 02:07:23,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2025-03-08 02:07:23,618 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:23,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:23,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1581804477, now seen corresponding path program 1 times [2025-03-08 02:07:23,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:23,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901636340] [2025-03-08 02:07:23,619 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:23,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:23,724 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2253 statements into 1 equivalence classes. [2025-03-08 02:07:23,795 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2253 of 2253 statements. [2025-03-08 02:07:23,795 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:23,795 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:25,922 INFO L134 CoverageAnalysis]: Checked inductivity of 10848 backedges. 7867 proven. 91 refuted. 0 times theorem prover too weak. 2890 trivial. 0 not checked. [2025-03-08 02:07:25,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901636340] [2025-03-08 02:07:25,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901636340] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:25,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1404605306] [2025-03-08 02:07:25,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:25,923 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:25,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:25,925 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:07:25,926 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 02:07:26,058 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2253 statements into 1 equivalence classes. [2025-03-08 02:07:26,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2253 of 2253 statements. [2025-03-08 02:07:26,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:26,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:26,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 2587 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-08 02:07:26,307 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:26,397 INFO L134 CoverageAnalysis]: Checked inductivity of 10848 backedges. 662 proven. 0 refuted. 0 times theorem prover too weak. 10186 trivial. 0 not checked. [2025-03-08 02:07:26,398 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 02:07:26,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1404605306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 02:07:26,398 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 02:07:26,398 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-03-08 02:07:26,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [279029100] [2025-03-08 02:07:26,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:26,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 02:07:26,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:26,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 02:07:26,399 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:07:26,399 INFO L87 Difference]: Start difference. First operand 16454 states and 16708 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:26,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:26,960 INFO L93 Difference]: Finished difference Result 33893 states and 34413 transitions. [2025-03-08 02:07:26,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 02:07:26,960 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 2253 [2025-03-08 02:07:26,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:26,974 INFO L225 Difference]: With dead ends: 33893 [2025-03-08 02:07:26,974 INFO L226 Difference]: Without dead ends: 18099 [2025-03-08 02:07:26,983 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2258 GetRequests, 2253 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-03-08 02:07:26,983 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 281 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 768 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 804 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:26,983 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 417 Invalid, 804 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 768 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 02:07:26,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18099 states. [2025-03-08 02:07:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18099 to 17112. [2025-03-08 02:07:27,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17111 states have (on average 1.014201390918123) internal successors, (17354), 17111 states have internal predecessors, (17354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:27,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 17354 transitions. [2025-03-08 02:07:27,093 INFO L78 Accepts]: Start accepts. Automaton has 17112 states and 17354 transitions. Word has length 2253 [2025-03-08 02:07:27,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:27,094 INFO L471 AbstractCegarLoop]: Abstraction has 17112 states and 17354 transitions. [2025-03-08 02:07:27,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 17112 states and 17354 transitions. [2025-03-08 02:07:27,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2259 [2025-03-08 02:07:27,118 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 02:07:27,119 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 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, 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] [2025-03-08 02:07:27,127 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-03-08 02:07:27,319 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:27,319 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 02:07:27,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 02:07:27,320 INFO L85 PathProgramCache]: Analyzing trace with hash 1068665693, now seen corresponding path program 1 times [2025-03-08 02:07:27,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 02:07:27,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362118189] [2025-03-08 02:07:27,320 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:27,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 02:07:27,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2258 statements into 1 equivalence classes. [2025-03-08 02:07:27,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2258 of 2258 statements. [2025-03-08 02:07:27,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:27,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:29,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10110 backedges. 7379 proven. 91 refuted. 0 times theorem prover too weak. 2640 trivial. 0 not checked. [2025-03-08 02:07:29,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 02:07:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362118189] [2025-03-08 02:07:29,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362118189] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:29,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [764803843] [2025-03-08 02:07:29,815 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 02:07:29,815 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 02:07:29,815 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 02:07:29,817 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 02:07:29,818 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-08 02:07:29,948 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2258 statements into 1 equivalence classes. [2025-03-08 02:07:30,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2258 of 2258 statements. [2025-03-08 02:07:30,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 02:07:30,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 02:07:30,185 INFO L256 TraceCheckSpWp]: Trace formula consists of 2606 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 02:07:30,195 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 02:07:30,913 INFO L134 CoverageAnalysis]: Checked inductivity of 10110 backedges. 1425 proven. 51 refuted. 0 times theorem prover too weak. 8634 trivial. 0 not checked. [2025-03-08 02:07:30,913 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 02:07:31,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10110 backedges. 1476 proven. 0 refuted. 0 times theorem prover too weak. 8634 trivial. 0 not checked. [2025-03-08 02:07:31,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [764803843] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-08 02:07:31,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-08 02:07:31,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 4] total 10 [2025-03-08 02:07:31,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215751484] [2025-03-08 02:07:31,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 02:07:31,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 02:07:31,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 02:07:31,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 02:07:31,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:07:31,087 INFO L87 Difference]: Start difference. First operand 17112 states and 17354 transitions. Second operand has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:31,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 02:07:31,801 INFO L93 Difference]: Finished difference Result 35536 states and 36041 transitions. [2025-03-08 02:07:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 02:07:31,802 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2258 [2025-03-08 02:07:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 02:07:31,803 INFO L225 Difference]: With dead ends: 35536 [2025-03-08 02:07:31,803 INFO L226 Difference]: Without dead ends: 0 [2025-03-08 02:07:31,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4520 GetRequests, 4512 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2025-03-08 02:07:31,813 INFO L435 NwaCegarLoop]: 6 mSDtfsCounter, 815 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 781 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 815 SdHoareTripleChecker+Valid, 10 SdHoareTripleChecker+Invalid, 969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 781 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-03-08 02:07:31,813 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [815 Valid, 10 Invalid, 969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 781 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-03-08 02:07:31,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-08 02:07:31,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-08 02:07:31,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:31,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-08 02:07:31,814 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 2258 [2025-03-08 02:07:31,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 02:07:31,814 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-08 02:07:31,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.75) internal successors, (447), 4 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-08 02:07:31,815 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-08 02:07:31,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-08 02:07:31,817 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-08 02:07:31,825 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-08 02:07:32,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2025-03-08 02:07:32,020 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 02:07:32,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.