./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label18.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem17_label18.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 36682755a8fd6d5761d4aa48745e539f37b082d91c2b7f5a4981e2bf074e7e62 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:58:54,855 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:58:54,899 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 10:58:54,902 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:58:54,903 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:58:54,925 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:58:54,926 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:58:54,926 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:58:54,926 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:58:54,926 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:58:54,926 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:58:54,926 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:58:54,927 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:58:54,927 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:58:54,927 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:58:54,927 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:58:54,927 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:58:54,927 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:58:54,927 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:58:54,927 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:58:54,927 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:58:54,927 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:58:54,928 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:58:54,928 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:58:54,928 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:58:54,928 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:58:54,928 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:58:54,928 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:58:54,928 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:58:54,928 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:58:54,928 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:58:54,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:58:54,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:58:54,929 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:58:54,929 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:58:54,929 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:58:54,929 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:58:54,929 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:58:54,929 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:58:54,929 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:58:54,929 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:58:54,929 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:58:54,929 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:58:54,929 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 -> 36682755a8fd6d5761d4aa48745e539f37b082d91c2b7f5a4981e2bf074e7e62 [2025-03-03 10:58:55,174 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:58:55,183 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:58:55,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:58:55,186 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:58:55,186 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:58:55,188 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label18.c [2025-03-03 10:58:56,334 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac2328cb/91e806cbb6954277b1c9b486237279bf/FLAGc8877adff [2025-03-03 10:58:56,723 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:58:56,724 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label18.c [2025-03-03 10:58:56,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac2328cb/91e806cbb6954277b1c9b486237279bf/FLAGc8877adff [2025-03-03 10:58:56,897 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ac2328cb/91e806cbb6954277b1c9b486237279bf [2025-03-03 10:58:56,900 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:58:56,901 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:58:56,903 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:58:56,903 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:58:56,907 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:58:56,907 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:58:56" (1/1) ... [2025-03-03 10:58:56,908 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2dc41474 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:56, skipping insertion in model container [2025-03-03 10:58:56,908 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:58:56" (1/1) ... [2025-03-03 10:58:56,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:58:57,142 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label18.c[8129,8142] [2025-03-03 10:58:57,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:58:57,498 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:58:57,545 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label18.c[8129,8142] [2025-03-03 10:58:57,699 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:58:57,712 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:58:57,713 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57 WrapperNode [2025-03-03 10:58:57,714 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:58:57,715 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:58:57,715 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:58:57,715 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:58:57,719 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (1/1) ... [2025-03-03 10:58:57,749 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (1/1) ... [2025-03-03 10:58:57,925 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-03 10:58:57,926 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:58:57,926 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:58:57,927 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:58:57,927 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:58:57,933 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (1/1) ... [2025-03-03 10:58:57,933 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (1/1) ... [2025-03-03 10:58:57,995 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (1/1) ... [2025-03-03 10:58:58,111 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-03 10:58:58,111 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (1/1) ... [2025-03-03 10:58:58,112 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (1/1) ... [2025-03-03 10:58:58,225 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (1/1) ... [2025-03-03 10:58:58,246 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (1/1) ... [2025-03-03 10:58:58,260 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (1/1) ... [2025-03-03 10:58:58,272 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (1/1) ... [2025-03-03 10:58:58,303 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:58:58,304 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:58:58,304 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:58:58,305 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:58:58,306 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (1/1) ... [2025-03-03 10:58:58,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:58:58,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:58:58,332 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-03 10:58:58,335 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-03 10:58:58,352 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:58:58,352 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:58:58,352 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:58:58,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:58:58,399 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:58:58,400 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:59:00,710 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-03 10:59:00,875 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 10:59:00,875 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:59:00,905 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:59:00,905 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:59:00,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:59:00 BoogieIcfgContainer [2025-03-03 10:59:00,906 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:59:00,907 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:59:00,907 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:59:00,910 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:59:00,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:58:56" (1/3) ... [2025-03-03 10:59:00,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4b2d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:59:00, skipping insertion in model container [2025-03-03 10:59:00,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:57" (2/3) ... [2025-03-03 10:59:00,911 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d4b2d07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:59:00, skipping insertion in model container [2025-03-03 10:59:00,911 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:59:00" (3/3) ... [2025-03-03 10:59:00,912 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label18.c [2025-03-03 10:59:00,935 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:59:00,937 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label18.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:59:01,032 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:59:01,041 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;@44f1ac88, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:59:01,041 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:59:01,046 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:01,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-03-03 10:59:01,050 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:01,050 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:01,051 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:01,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash -504203452, now seen corresponding path program 1 times [2025-03-03 10:59:01,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:01,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103714776] [2025-03-03 10:59:01,059 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:01,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:01,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-03-03 10:59:01,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-03-03 10:59:01,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:01,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:01,364 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-03 10:59:01,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:01,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103714776] [2025-03-03 10:59:01,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103714776] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:01,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:01,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:59:01,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807519341] [2025-03-03 10:59:01,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:01,373 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:01,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:01,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:01,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:01,388 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.804421768707483) internal successors, (1061), 589 states have internal predecessors, (1061), 0 states have call successors, (0), 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 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:03,551 INFO L93 Difference]: Finished difference Result 1667 states and 3058 transitions. [2025-03-03 10:59:03,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:03,554 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-03-03 10:59:03,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:03,570 INFO L225 Difference]: With dead ends: 1667 [2025-03-03 10:59:03,570 INFO L226 Difference]: Without dead ends: 998 [2025-03-03 10:59:03,576 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-03 10:59:03,578 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 490 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1566 mSolverCounterSat, 396 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 1962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 396 IncrementalHoareTripleChecker+Valid, 1566 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:03,579 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 276 Invalid, 1962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [396 Valid, 1566 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:59:03,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 998 states. [2025-03-03 10:59:03,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 998 to 982. [2025-03-03 10:59:03,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 982 states, 981 states have (on average 1.707441386340469) internal successors, (1675), 981 states have internal predecessors, (1675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:03,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 982 states to 982 states and 1675 transitions. [2025-03-03 10:59:03,649 INFO L78 Accepts]: Start accepts. Automaton has 982 states and 1675 transitions. Word has length 55 [2025-03-03 10:59:03,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:03,650 INFO L471 AbstractCegarLoop]: Abstraction has 982 states and 1675 transitions. [2025-03-03 10:59:03,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:03,650 INFO L276 IsEmpty]: Start isEmpty. Operand 982 states and 1675 transitions. [2025-03-03 10:59:03,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-03 10:59:03,657 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:03,657 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:03,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:59:03,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:03,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:03,658 INFO L85 PathProgramCache]: Analyzing trace with hash -363554594, now seen corresponding path program 1 times [2025-03-03 10:59:03,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:03,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735523621] [2025-03-03 10:59:03,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:03,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:03,680 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-03 10:59:03,718 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-03 10:59:03,718 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:03,718 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:03,929 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:03,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:03,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735523621] [2025-03-03 10:59:03,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735523621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:03,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:03,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:59:03,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229413043] [2025-03-03 10:59:03,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:03,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:03,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:03,933 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:03,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:03,934 INFO L87 Difference]: Start difference. First operand 982 states and 1675 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:05,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:05,596 INFO L93 Difference]: Finished difference Result 2824 states and 4847 transitions. [2025-03-03 10:59:05,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:05,596 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 120 [2025-03-03 10:59:05,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:05,602 INFO L225 Difference]: With dead ends: 2824 [2025-03-03 10:59:05,602 INFO L226 Difference]: Without dead ends: 1844 [2025-03-03 10:59:05,603 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-03 10:59:05,616 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 393 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 590 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:05,617 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:59:05,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2025-03-03 10:59:05,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1844. [2025-03-03 10:59:05,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1844 states, 1843 states have (on average 1.3836136733586544) internal successors, (2550), 1843 states have internal predecessors, (2550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:05,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1844 states to 1844 states and 2550 transitions. [2025-03-03 10:59:05,666 INFO L78 Accepts]: Start accepts. Automaton has 1844 states and 2550 transitions. Word has length 120 [2025-03-03 10:59:05,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:05,666 INFO L471 AbstractCegarLoop]: Abstraction has 1844 states and 2550 transitions. [2025-03-03 10:59:05,666 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:05,666 INFO L276 IsEmpty]: Start isEmpty. Operand 1844 states and 2550 transitions. [2025-03-03 10:59:05,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2025-03-03 10:59:05,668 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:05,668 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, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:05,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:59:05,669 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:05,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:05,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1063064341, now seen corresponding path program 1 times [2025-03-03 10:59:05,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:05,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735655080] [2025-03-03 10:59:05,669 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:05,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:05,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 203 statements into 1 equivalence classes. [2025-03-03 10:59:05,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 203 of 203 statements. [2025-03-03 10:59:05,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:05,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:05,902 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 169 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:05,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:05,903 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735655080] [2025-03-03 10:59:05,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735655080] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:05,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:05,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:05,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914772035] [2025-03-03 10:59:05,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:05,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:05,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:05,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:05,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:05,905 INFO L87 Difference]: Start difference. First operand 1844 states and 2550 transitions. Second operand has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:07,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:07,413 INFO L93 Difference]: Finished difference Result 4546 states and 6595 transitions. [2025-03-03 10:59:07,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:07,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 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 203 [2025-03-03 10:59:07,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:07,424 INFO L225 Difference]: With dead ends: 4546 [2025-03-03 10:59:07,424 INFO L226 Difference]: Without dead ends: 2704 [2025-03-03 10:59:07,426 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-03 10:59:07,426 INFO L435 NwaCegarLoop]: 759 mSDtfsCounter, 500 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 336 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 817 SdHoareTripleChecker+Invalid, 1633 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 336 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:07,427 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 817 Invalid, 1633 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [336 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:59:07,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2704 states. [2025-03-03 10:59:07,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2704 to 2704. [2025-03-03 10:59:07,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2704 states, 2703 states have (on average 1.38771735109138) internal successors, (3751), 2703 states have internal predecessors, (3751), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:07,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2704 states to 2704 states and 3751 transitions. [2025-03-03 10:59:07,460 INFO L78 Accepts]: Start accepts. Automaton has 2704 states and 3751 transitions. Word has length 203 [2025-03-03 10:59:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:07,460 INFO L471 AbstractCegarLoop]: Abstraction has 2704 states and 3751 transitions. [2025-03-03 10:59:07,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.66666666666667) internal successors, (203), 3 states have internal predecessors, (203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 2704 states and 3751 transitions. [2025-03-03 10:59:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2025-03-03 10:59:07,462 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:07,462 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, 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] [2025-03-03 10:59:07,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:59:07,463 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:07,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash 2089142948, now seen corresponding path program 1 times [2025-03-03 10:59:07,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:07,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151978108] [2025-03-03 10:59:07,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:07,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:07,484 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 209 statements into 1 equivalence classes. [2025-03-03 10:59:07,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 209 of 209 statements. [2025-03-03 10:59:07,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:07,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:07,644 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-03-03 10:59:07,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:07,646 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151978108] [2025-03-03 10:59:07,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151978108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:07,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:07,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:07,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580996365] [2025-03-03 10:59:07,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:07,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:07,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:07,647 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:07,647 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:07,647 INFO L87 Difference]: Start difference. First operand 2704 states and 3751 transitions. Second operand has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:09,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:09,050 INFO L93 Difference]: Finished difference Result 7954 states and 11040 transitions. [2025-03-03 10:59:09,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:09,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 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 209 [2025-03-03 10:59:09,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:09,064 INFO L225 Difference]: With dead ends: 7954 [2025-03-03 10:59:09,064 INFO L226 Difference]: Without dead ends: 5252 [2025-03-03 10:59:09,067 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-03 10:59:09,067 INFO L435 NwaCegarLoop]: 482 mSDtfsCounter, 393 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1339 mSolverCounterSat, 356 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 393 SdHoareTripleChecker+Valid, 546 SdHoareTripleChecker+Invalid, 1695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 356 IncrementalHoareTripleChecker+Valid, 1339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:09,068 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [393 Valid, 546 Invalid, 1695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [356 Valid, 1339 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:59:09,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2025-03-03 10:59:09,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 4826. [2025-03-03 10:59:09,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4826 states, 4825 states have (on average 1.2652849740932643) internal successors, (6105), 4825 states have internal predecessors, (6105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:09,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4826 states to 4826 states and 6105 transitions. [2025-03-03 10:59:09,125 INFO L78 Accepts]: Start accepts. Automaton has 4826 states and 6105 transitions. Word has length 209 [2025-03-03 10:59:09,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:09,125 INFO L471 AbstractCegarLoop]: Abstraction has 4826 states and 6105 transitions. [2025-03-03 10:59:09,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:09,126 INFO L276 IsEmpty]: Start isEmpty. Operand 4826 states and 6105 transitions. [2025-03-03 10:59:09,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 223 [2025-03-03 10:59:09,127 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:09,127 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, 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, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:09,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:59:09,128 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:09,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:09,128 INFO L85 PathProgramCache]: Analyzing trace with hash 82743050, now seen corresponding path program 1 times [2025-03-03 10:59:09,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:09,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224191512] [2025-03-03 10:59:09,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:09,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:09,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 10:59:09,161 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 10:59:09,163 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:09,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:09,587 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 75 proven. 30 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:59:09,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:09,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224191512] [2025-03-03 10:59:09,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224191512] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:09,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1496394894] [2025-03-03 10:59:09,589 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:09,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:09,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:59:09,592 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-03 10:59:09,593 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-03 10:59:09,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 222 statements into 1 equivalence classes. [2025-03-03 10:59:09,671 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 222 of 222 statements. [2025-03-03 10:59:09,672 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:09,672 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:09,675 INFO L256 TraceCheckSpWp]: Trace formula consists of 324 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:59:09,682 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:59:09,755 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:59:09,755 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:59:09,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1496394894] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:09,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:59:09,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-03-03 10:59:09,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751179604] [2025-03-03 10:59:09,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:09,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:09,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:09,756 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:09,756 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:59:09,756 INFO L87 Difference]: Start difference. First operand 4826 states and 6105 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:11,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:11,267 INFO L93 Difference]: Finished difference Result 12204 states and 15757 transitions. [2025-03-03 10:59:11,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:11,267 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 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 222 [2025-03-03 10:59:11,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:11,284 INFO L225 Difference]: With dead ends: 12204 [2025-03-03 10:59:11,284 INFO L226 Difference]: Without dead ends: 7380 [2025-03-03 10:59:11,289 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 221 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:59:11,290 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 417 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1398 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 417 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 1758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:11,290 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [417 Valid, 512 Invalid, 1758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1398 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:59:11,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7380 states. [2025-03-03 10:59:11,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7380 to 6525. [2025-03-03 10:59:11,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6525 states, 6524 states have (on average 1.2665542611894542) internal successors, (8263), 6524 states have internal predecessors, (8263), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:11,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6525 states to 6525 states and 8263 transitions. [2025-03-03 10:59:11,393 INFO L78 Accepts]: Start accepts. Automaton has 6525 states and 8263 transitions. Word has length 222 [2025-03-03 10:59:11,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:11,394 INFO L471 AbstractCegarLoop]: Abstraction has 6525 states and 8263 transitions. [2025-03-03 10:59:11,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:11,396 INFO L276 IsEmpty]: Start isEmpty. Operand 6525 states and 8263 transitions. [2025-03-03 10:59:11,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 272 [2025-03-03 10:59:11,400 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:11,400 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:59:11,406 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-03 10:59:11,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:11,601 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:11,601 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:11,601 INFO L85 PathProgramCache]: Analyzing trace with hash -198427118, now seen corresponding path program 1 times [2025-03-03 10:59:11,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:11,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209891196] [2025-03-03 10:59:11,601 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:11,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:11,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 271 statements into 1 equivalence classes. [2025-03-03 10:59:11,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 271 of 271 statements. [2025-03-03 10:59:11,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:11,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:11,871 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:11,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:11,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209891196] [2025-03-03 10:59:11,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209891196] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:11,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:11,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:11,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041467499] [2025-03-03 10:59:11,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:11,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:11,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:11,873 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:11,873 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:11,873 INFO L87 Difference]: Start difference. First operand 6525 states and 8263 transitions. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:13,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:13,605 INFO L93 Difference]: Finished difference Result 18180 states and 22851 transitions. [2025-03-03 10:59:13,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:13,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 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 271 [2025-03-03 10:59:13,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:13,629 INFO L225 Difference]: With dead ends: 18180 [2025-03-03 10:59:13,629 INFO L226 Difference]: Without dead ends: 10805 [2025-03-03 10:59:13,635 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-03 10:59:13,636 INFO L435 NwaCegarLoop]: 877 mSDtfsCounter, 371 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 1354 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 1703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:13,636 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [371 Valid, 950 Invalid, 1703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1354 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:59:13,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10805 states. [2025-03-03 10:59:13,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10805 to 10797. [2025-03-03 10:59:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10797 states, 10796 states have (on average 1.1779362726935902) internal successors, (12717), 10796 states have internal predecessors, (12717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:13,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10797 states to 10797 states and 12717 transitions. [2025-03-03 10:59:13,760 INFO L78 Accepts]: Start accepts. Automaton has 10797 states and 12717 transitions. Word has length 271 [2025-03-03 10:59:13,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:13,761 INFO L471 AbstractCegarLoop]: Abstraction has 10797 states and 12717 transitions. [2025-03-03 10:59:13,761 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 10797 states and 12717 transitions. [2025-03-03 10:59:13,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2025-03-03 10:59:13,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:13,764 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:59:13,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:59:13,765 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:13,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:13,765 INFO L85 PathProgramCache]: Analyzing trace with hash -2141794404, now seen corresponding path program 1 times [2025-03-03 10:59:13,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:13,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665392671] [2025-03-03 10:59:13,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:13,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:13,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 10:59:13,807 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 10:59:13,807 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:13,807 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:14,048 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 105 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:14,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:14,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665392671] [2025-03-03 10:59:14,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665392671] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:14,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2030927939] [2025-03-03 10:59:14,049 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:14,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:14,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:59:14,051 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-03 10:59:14,053 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-03 10:59:14,093 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 275 statements into 1 equivalence classes. [2025-03-03 10:59:14,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 275 of 275 statements. [2025-03-03 10:59:14,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:14,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:14,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:59:14,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:59:14,400 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 105 proven. 82 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:14,402 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:59:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:14,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2030927939] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:14,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:59:14,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 7 [2025-03-03 10:59:14,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55690056] [2025-03-03 10:59:14,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:14,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:59:14,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:14,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:59:14,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:59:14,836 INFO L87 Difference]: Start difference. First operand 10797 states and 12717 transitions. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:17,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:17,428 INFO L93 Difference]: Finished difference Result 33552 states and 39684 transitions. [2025-03-03 10:59:17,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:59:17,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2025-03-03 10:59:17,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:17,461 INFO L225 Difference]: With dead ends: 33552 [2025-03-03 10:59:17,461 INFO L226 Difference]: Without dead ends: 21052 [2025-03-03 10:59:17,471 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 551 GetRequests, 545 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-03 10:59:17,472 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 770 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2723 mSolverCounterSat, 793 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 3516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 793 IncrementalHoareTripleChecker+Valid, 2723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:17,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [770 Valid, 160 Invalid, 3516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [793 Valid, 2723 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-03-03 10:59:17,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21052 states. [2025-03-03 10:59:17,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21052 to 19736. [2025-03-03 10:59:17,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19736 states, 19735 states have (on average 1.1582467696985053) internal successors, (22858), 19735 states have internal predecessors, (22858), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:17,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19736 states to 19736 states and 22858 transitions. [2025-03-03 10:59:17,714 INFO L78 Accepts]: Start accepts. Automaton has 19736 states and 22858 transitions. Word has length 275 [2025-03-03 10:59:17,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:17,715 INFO L471 AbstractCegarLoop]: Abstraction has 19736 states and 22858 transitions. [2025-03-03 10:59:17,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:17,715 INFO L276 IsEmpty]: Start isEmpty. Operand 19736 states and 22858 transitions. [2025-03-03 10:59:17,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2025-03-03 10:59:17,717 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:17,718 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:17,724 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-03 10:59:17,918 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,SelfDestructingSolverStorable6 [2025-03-03 10:59:17,919 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:17,919 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:17,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1455611323, now seen corresponding path program 1 times [2025-03-03 10:59:17,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:17,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [407296260] [2025-03-03 10:59:17,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:17,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:17,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-03 10:59:17,971 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-03 10:59:17,972 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:17,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:18,340 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 244 proven. 70 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 10:59:18,340 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:18,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [407296260] [2025-03-03 10:59:18,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [407296260] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:18,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056331737] [2025-03-03 10:59:18,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:18,340 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:18,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:59:18,348 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-03 10:59:18,353 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-03 10:59:18,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 279 statements into 1 equivalence classes. [2025-03-03 10:59:18,502 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 279 of 279 statements. [2025-03-03 10:59:18,502 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:18,502 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:18,504 INFO L256 TraceCheckSpWp]: Trace formula consists of 403 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:59:18,511 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:59:18,674 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 244 proven. 70 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 10:59:18,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:59:18,856 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 10:59:18,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056331737] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:18,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:59:18,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-03 10:59:18,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749766844] [2025-03-03 10:59:18,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:18,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:59:18,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:18,857 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:59:18,857 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:59:18,858 INFO L87 Difference]: Start difference. First operand 19736 states and 22858 transitions. Second operand has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:21,179 INFO L93 Difference]: Finished difference Result 56941 states and 66169 transitions. [2025-03-03 10:59:21,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:59:21,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 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 279 [2025-03-03 10:59:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:21,268 INFO L225 Difference]: With dead ends: 56941 [2025-03-03 10:59:21,268 INFO L226 Difference]: Without dead ends: 35917 [2025-03-03 10:59:21,282 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 559 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:59:21,282 INFO L435 NwaCegarLoop]: 82 mSDtfsCounter, 1048 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 1069 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1048 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 3261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1069 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:21,283 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1048 Valid, 138 Invalid, 3261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1069 Valid, 2192 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-03-03 10:59:21,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35917 states. [2025-03-03 10:59:21,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35917 to 34214. [2025-03-03 10:59:21,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34214 states, 34213 states have (on average 1.1475170256919884) internal successors, (39260), 34213 states have internal predecessors, (39260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:21,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34214 states to 34214 states and 39260 transitions. [2025-03-03 10:59:21,689 INFO L78 Accepts]: Start accepts. Automaton has 34214 states and 39260 transitions. Word has length 279 [2025-03-03 10:59:21,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:21,692 INFO L471 AbstractCegarLoop]: Abstraction has 34214 states and 39260 transitions. [2025-03-03 10:59:21,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.75) internal successors, (227), 3 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:21,693 INFO L276 IsEmpty]: Start isEmpty. Operand 34214 states and 39260 transitions. [2025-03-03 10:59:21,700 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 315 [2025-03-03 10:59:21,701 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:21,701 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, 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, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:21,711 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-03 10:59:21,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:21,903 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:21,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:21,904 INFO L85 PathProgramCache]: Analyzing trace with hash 2081166462, now seen corresponding path program 1 times [2025-03-03 10:59:21,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:21,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683010831] [2025-03-03 10:59:21,904 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:21,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:21,924 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 314 statements into 1 equivalence classes. [2025-03-03 10:59:21,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 314 of 314 statements. [2025-03-03 10:59:21,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:21,940 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:22,020 INFO L134 CoverageAnalysis]: Checked inductivity of 403 backedges. 322 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-03-03 10:59:22,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:22,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683010831] [2025-03-03 10:59:22,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683010831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:22,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:22,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:22,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683856099] [2025-03-03 10:59:22,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:22,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:22,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:22,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:22,022 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:22,022 INFO L87 Difference]: Start difference. First operand 34214 states and 39260 transitions. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:23,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:23,423 INFO L93 Difference]: Finished difference Result 73952 states and 85101 transitions. [2025-03-03 10:59:23,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:23,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 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 314 [2025-03-03 10:59:23,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:23,463 INFO L225 Difference]: With dead ends: 73952 [2025-03-03 10:59:23,463 INFO L226 Difference]: Without dead ends: 39314 [2025-03-03 10:59:23,480 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-03 10:59:23,480 INFO L435 NwaCegarLoop]: 765 mSDtfsCounter, 361 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 1182 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 361 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 1392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:23,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [361 Valid, 830 Invalid, 1392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1182 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:59:23,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39314 states. [2025-03-03 10:59:23,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39314 to 38039. [2025-03-03 10:59:24,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38039 states, 38038 states have (on average 1.129055155370945) internal successors, (42947), 38038 states have internal predecessors, (42947), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:24,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38039 states to 38039 states and 42947 transitions. [2025-03-03 10:59:24,079 INFO L78 Accepts]: Start accepts. Automaton has 38039 states and 42947 transitions. Word has length 314 [2025-03-03 10:59:24,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:24,080 INFO L471 AbstractCegarLoop]: Abstraction has 38039 states and 42947 transitions. [2025-03-03 10:59:24,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:24,080 INFO L276 IsEmpty]: Start isEmpty. Operand 38039 states and 42947 transitions. [2025-03-03 10:59:24,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-03-03 10:59:24,086 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:24,086 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:59:24,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:59:24,087 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:24,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:24,087 INFO L85 PathProgramCache]: Analyzing trace with hash -168774501, now seen corresponding path program 1 times [2025-03-03 10:59:24,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:24,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313563146] [2025-03-03 10:59:24,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:24,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:24,120 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-03-03 10:59:24,150 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-03-03 10:59:24,150 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:24,150 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:24,382 INFO L134 CoverageAnalysis]: Checked inductivity of 387 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2025-03-03 10:59:24,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:24,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313563146] [2025-03-03 10:59:24,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313563146] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:24,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:24,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:24,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737291856] [2025-03-03 10:59:24,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:24,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:24,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:24,384 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:24,384 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:24,385 INFO L87 Difference]: Start difference. First operand 38039 states and 42947 transitions. Second operand has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:25,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:25,782 INFO L93 Difference]: Finished difference Result 86741 states and 98208 transitions. [2025-03-03 10:59:25,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:25,783 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 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 349 [2025-03-03 10:59:25,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:25,829 INFO L225 Difference]: With dead ends: 86741 [2025-03-03 10:59:25,829 INFO L226 Difference]: Without dead ends: 48704 [2025-03-03 10:59:25,851 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-03 10:59:25,851 INFO L435 NwaCegarLoop]: 779 mSDtfsCounter, 323 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 1357 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 835 SdHoareTripleChecker+Invalid, 1524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:25,851 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 835 Invalid, 1524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1357 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:59:25,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48704 states. [2025-03-03 10:59:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48704 to 46980. [2025-03-03 10:59:26,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46980 states, 46979 states have (on average 1.1195427744311288) internal successors, (52595), 46979 states have internal predecessors, (52595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:26,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46980 states to 46980 states and 52595 transitions. [2025-03-03 10:59:26,399 INFO L78 Accepts]: Start accepts. Automaton has 46980 states and 52595 transitions. Word has length 349 [2025-03-03 10:59:26,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:26,399 INFO L471 AbstractCegarLoop]: Abstraction has 46980 states and 52595 transitions. [2025-03-03 10:59:26,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.33333333333333) internal successors, (277), 3 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 46980 states and 52595 transitions. [2025-03-03 10:59:26,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 354 [2025-03-03 10:59:26,407 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:26,407 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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:26,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:59:26,407 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:26,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:26,408 INFO L85 PathProgramCache]: Analyzing trace with hash -220976326, now seen corresponding path program 1 times [2025-03-03 10:59:26,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:26,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74193177] [2025-03-03 10:59:26,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:26,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:26,439 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-03 10:59:26,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-03 10:59:26,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:26,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:26,840 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 385 proven. 73 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-03 10:59:26,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:26,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74193177] [2025-03-03 10:59:26,840 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74193177] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:26,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1929290150] [2025-03-03 10:59:26,840 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:26,840 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:26,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:59:26,842 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-03 10:59:26,844 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-03 10:59:26,888 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 353 statements into 1 equivalence classes. [2025-03-03 10:59:26,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 353 of 353 statements. [2025-03-03 10:59:26,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:26,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:26,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-03 10:59:26,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:59:27,082 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 385 proven. 73 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-03 10:59:27,083 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:59:27,260 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 458 proven. 0 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-03 10:59:27,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1929290150] provided 1 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:27,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-03-03 10:59:27,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-03-03 10:59:27,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458582320] [2025-03-03 10:59:27,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:27,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:59:27,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:27,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:59:27,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:59:27,262 INFO L87 Difference]: Start difference. First operand 46980 states and 52595 transitions. Second operand has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:29,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:29,485 INFO L93 Difference]: Finished difference Result 111003 states and 124632 transitions. [2025-03-03 10:59:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:59:29,486 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 353 [2025-03-03 10:59:29,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:29,559 INFO L225 Difference]: With dead ends: 111003 [2025-03-03 10:59:29,559 INFO L226 Difference]: Without dead ends: 63598 [2025-03-03 10:59:29,594 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 707 GetRequests, 703 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-03 10:59:29,594 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 842 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 2315 mSolverCounterSat, 486 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 842 SdHoareTripleChecker+Valid, 197 SdHoareTripleChecker+Invalid, 2801 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 486 IncrementalHoareTripleChecker+Valid, 2315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:29,595 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [842 Valid, 197 Invalid, 2801 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [486 Valid, 2315 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:59:29,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63598 states. [2025-03-03 10:59:30,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63598 to 61045. [2025-03-03 10:59:30,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61045 states, 61044 states have (on average 1.1267446432081778) internal successors, (68781), 61044 states have internal predecessors, (68781), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:30,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61045 states to 61045 states and 68781 transitions. [2025-03-03 10:59:30,376 INFO L78 Accepts]: Start accepts. Automaton has 61045 states and 68781 transitions. Word has length 353 [2025-03-03 10:59:30,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:30,377 INFO L471 AbstractCegarLoop]: Abstraction has 61045 states and 68781 transitions. [2025-03-03 10:59:30,377 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 58.0) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:30,377 INFO L276 IsEmpty]: Start isEmpty. Operand 61045 states and 68781 transitions. [2025-03-03 10:59:30,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 368 [2025-03-03 10:59:30,381 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:30,381 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, 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, 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-03 10:59:30,388 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-03 10:59:30,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:30,582 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:30,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:30,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1557650836, now seen corresponding path program 1 times [2025-03-03 10:59:30,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:30,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106796707] [2025-03-03 10:59:30,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:30,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:30,620 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 367 statements into 1 equivalence classes. [2025-03-03 10:59:30,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 367 of 367 statements. [2025-03-03 10:59:30,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:30,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:30,886 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 10:59:30,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:30,886 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106796707] [2025-03-03 10:59:30,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106796707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:30,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:30,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:30,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589486960] [2025-03-03 10:59:30,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:30,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:30,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:30,887 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:30,887 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:30,887 INFO L87 Difference]: Start difference. First operand 61045 states and 68781 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:32,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:32,235 INFO L93 Difference]: Finished difference Result 139108 states and 156346 transitions. [2025-03-03 10:59:32,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:32,236 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 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 367 [2025-03-03 10:59:32,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:32,317 INFO L225 Difference]: With dead ends: 139108 [2025-03-03 10:59:32,317 INFO L226 Difference]: Without dead ends: 77633 [2025-03-03 10:59:32,361 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:32,362 INFO L435 NwaCegarLoop]: 357 mSDtfsCounter, 421 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1284 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 421 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 1460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 1284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:32,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [421 Valid, 414 Invalid, 1460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 1284 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:59:32,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77633 states. [2025-03-03 10:59:33,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77633 to 71673. [2025-03-03 10:59:33,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71673 states, 71672 states have (on average 1.1141868512110726) internal successors, (79856), 71672 states have internal predecessors, (79856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:33,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71673 states to 71673 states and 79856 transitions. [2025-03-03 10:59:33,212 INFO L78 Accepts]: Start accepts. Automaton has 71673 states and 79856 transitions. Word has length 367 [2025-03-03 10:59:33,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:33,213 INFO L471 AbstractCegarLoop]: Abstraction has 71673 states and 79856 transitions. [2025-03-03 10:59:33,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:33,213 INFO L276 IsEmpty]: Start isEmpty. Operand 71673 states and 79856 transitions. [2025-03-03 10:59:33,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-03-03 10:59:33,218 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:33,219 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, 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, 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] [2025-03-03 10:59:33,219 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:59:33,219 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:33,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:33,219 INFO L85 PathProgramCache]: Analyzing trace with hash 1216894714, now seen corresponding path program 1 times [2025-03-03 10:59:33,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:33,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312928769] [2025-03-03 10:59:33,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:33,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:33,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-03-03 10:59:33,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-03-03 10:59:33,281 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:33,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:33,497 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 10:59:33,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:33,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312928769] [2025-03-03 10:59:33,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312928769] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:33,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:33,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:33,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433619202] [2025-03-03 10:59:33,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:33,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:33,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:33,498 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:33,499 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:33,499 INFO L87 Difference]: Start difference. First operand 71673 states and 79856 transitions. Second operand has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:34,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:34,883 INFO L93 Difference]: Finished difference Result 155253 states and 172888 transitions. [2025-03-03 10:59:34,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:34,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 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 437 [2025-03-03 10:59:34,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:34,968 INFO L225 Difference]: With dead ends: 155253 [2025-03-03 10:59:34,968 INFO L226 Difference]: Without dead ends: 83156 [2025-03-03 10:59:34,997 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-03 10:59:34,997 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 424 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 1192 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 1409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:34,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 340 Invalid, 1409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1192 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:59:35,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83156 states. [2025-03-03 10:59:35,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83156 to 70814. [2025-03-03 10:59:35,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70814 states, 70813 states have (on average 1.1122392780986543) internal successors, (78761), 70813 states have internal predecessors, (78761), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:35,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70814 states to 70814 states and 78761 transitions. [2025-03-03 10:59:35,787 INFO L78 Accepts]: Start accepts. Automaton has 70814 states and 78761 transitions. Word has length 437 [2025-03-03 10:59:35,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:35,788 INFO L471 AbstractCegarLoop]: Abstraction has 70814 states and 78761 transitions. [2025-03-03 10:59:35,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 84.0) internal successors, (252), 3 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:35,788 INFO L276 IsEmpty]: Start isEmpty. Operand 70814 states and 78761 transitions. [2025-03-03 10:59:35,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 452 [2025-03-03 10:59:35,796 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:35,796 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:35,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:59:35,796 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:35,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:35,797 INFO L85 PathProgramCache]: Analyzing trace with hash -1461110795, now seen corresponding path program 1 times [2025-03-03 10:59:35,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:35,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988737460] [2025-03-03 10:59:35,797 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:35,797 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:35,840 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 451 statements into 1 equivalence classes. [2025-03-03 10:59:35,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 451 of 451 statements. [2025-03-03 10:59:35,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:35,869 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:36,220 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-03 10:59:36,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:36,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988737460] [2025-03-03 10:59:36,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988737460] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:36,221 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:36,221 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:36,221 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722915444] [2025-03-03 10:59:36,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:36,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:36,222 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:36,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:36,222 INFO L87 Difference]: Start difference. First operand 70814 states and 78761 transitions. Second operand has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:37,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:37,645 INFO L93 Difference]: Finished difference Result 156563 states and 173678 transitions. [2025-03-03 10:59:37,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:37,645 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 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 451 [2025-03-03 10:59:37,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:37,747 INFO L225 Difference]: With dead ends: 156563 [2025-03-03 10:59:37,747 INFO L226 Difference]: Without dead ends: 85325 [2025-03-03 10:59:37,802 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-03 10:59:37,803 INFO L435 NwaCegarLoop]: 259 mSDtfsCounter, 431 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1307 mSolverCounterSat, 175 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 1482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 175 IncrementalHoareTripleChecker+Valid, 1307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:37,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 308 Invalid, 1482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [175 Valid, 1307 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:59:37,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85325 states. [2025-03-03 10:59:38,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85325 to 75493. [2025-03-03 10:59:38,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75493 states, 75492 states have (on average 1.1083028665289036) internal successors, (83668), 75492 states have internal predecessors, (83668), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:38,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75493 states to 75493 states and 83668 transitions. [2025-03-03 10:59:38,709 INFO L78 Accepts]: Start accepts. Automaton has 75493 states and 83668 transitions. Word has length 451 [2025-03-03 10:59:38,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:38,709 INFO L471 AbstractCegarLoop]: Abstraction has 75493 states and 83668 transitions. [2025-03-03 10:59:38,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 64.0) internal successors, (192), 3 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:38,710 INFO L276 IsEmpty]: Start isEmpty. Operand 75493 states and 83668 transitions. [2025-03-03 10:59:38,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-03 10:59:38,716 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:38,716 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:38,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:59:38,717 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:38,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:38,717 INFO L85 PathProgramCache]: Analyzing trace with hash 157227654, now seen corresponding path program 1 times [2025-03-03 10:59:38,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:38,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1851190828] [2025-03-03 10:59:38,717 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:38,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:38,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-03 10:59:38,767 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-03 10:59:38,768 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:38,768 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:38,867 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 507 trivial. 0 not checked. [2025-03-03 10:59:38,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:38,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1851190828] [2025-03-03 10:59:38,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1851190828] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:38,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:38,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:38,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81863420] [2025-03-03 10:59:38,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:38,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:38,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:38,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:38,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:38,869 INFO L87 Difference]: Start difference. First operand 75493 states and 83668 transitions. Second operand has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:40,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:40,430 INFO L93 Difference]: Finished difference Result 162903 states and 179970 transitions. [2025-03-03 10:59:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:40,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 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 479 [2025-03-03 10:59:40,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:40,532 INFO L225 Difference]: With dead ends: 162903 [2025-03-03 10:59:40,532 INFO L226 Difference]: Without dead ends: 86987 [2025-03-03 10:59:40,585 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:40,585 INFO L435 NwaCegarLoop]: 210 mSDtfsCounter, 485 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 1266 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 485 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 1476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 1266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:40,585 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [485 Valid, 252 Invalid, 1476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 1266 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:59:40,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86987 states. [2025-03-03 10:59:41,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86987 to 69502. [2025-03-03 10:59:41,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69502 states, 69501 states have (on average 1.106948101466166) internal successors, (76934), 69501 states have internal predecessors, (76934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:41,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69502 states to 69502 states and 76934 transitions. [2025-03-03 10:59:41,439 INFO L78 Accepts]: Start accepts. Automaton has 69502 states and 76934 transitions. Word has length 479 [2025-03-03 10:59:41,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:41,440 INFO L471 AbstractCegarLoop]: Abstraction has 69502 states and 76934 transitions. [2025-03-03 10:59:41,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 73.33333333333333) internal successors, (220), 3 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:41,440 INFO L276 IsEmpty]: Start isEmpty. Operand 69502 states and 76934 transitions. [2025-03-03 10:59:41,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2025-03-03 10:59:41,448 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:41,448 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, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:59:41,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:59:41,448 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:41,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:41,449 INFO L85 PathProgramCache]: Analyzing trace with hash -1586501945, now seen corresponding path program 1 times [2025-03-03 10:59:41,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:41,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693684731] [2025-03-03 10:59:41,449 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:41,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:41,480 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes. [2025-03-03 10:59:41,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements. [2025-03-03 10:59:41,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:41,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:41,767 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 579 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-03-03 10:59:41,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:41,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [693684731] [2025-03-03 10:59:41,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [693684731] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:41,767 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:41,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:59:41,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487391732] [2025-03-03 10:59:41,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:41,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:41,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:41,768 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:41,768 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:41,768 INFO L87 Difference]: Start difference. First operand 69502 states and 76934 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:42,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:42,524 INFO L93 Difference]: Finished difference Result 136439 states and 150638 transitions. [2025-03-03 10:59:42,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:42,524 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 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 515 [2025-03-03 10:59:42,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:42,592 INFO L225 Difference]: With dead ends: 136439 [2025-03-03 10:59:42,593 INFO L226 Difference]: Without dead ends: 66939 [2025-03-03 10:59:42,751 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-03 10:59:42,752 INFO L435 NwaCegarLoop]: 100 mSDtfsCounter, 618 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 651 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 618 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 656 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 651 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:42,752 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [618 Valid, 100 Invalid, 656 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 651 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-03 10:59:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66939 states. [2025-03-03 10:59:43,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66939 to 66933. [2025-03-03 10:59:43,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66933 states, 66932 states have (on average 1.1008934440925118) internal successors, (73685), 66932 states have internal predecessors, (73685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:43,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66933 states to 66933 states and 73685 transitions. [2025-03-03 10:59:43,410 INFO L78 Accepts]: Start accepts. Automaton has 66933 states and 73685 transitions. Word has length 515 [2025-03-03 10:59:43,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:43,410 INFO L471 AbstractCegarLoop]: Abstraction has 66933 states and 73685 transitions. [2025-03-03 10:59:43,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:43,411 INFO L276 IsEmpty]: Start isEmpty. Operand 66933 states and 73685 transitions. [2025-03-03 10:59:43,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 516 [2025-03-03 10:59:43,420 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:43,420 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, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:59:43,420 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:59:43,420 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:43,420 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:43,420 INFO L85 PathProgramCache]: Analyzing trace with hash -301439416, now seen corresponding path program 1 times [2025-03-03 10:59:43,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:43,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457873636] [2025-03-03 10:59:43,420 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:43,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:43,459 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 515 statements into 1 equivalence classes. [2025-03-03 10:59:43,493 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 515 of 515 statements. [2025-03-03 10:59:43,493 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:43,493 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:43,994 INFO L134 CoverageAnalysis]: Checked inductivity of 1024 backedges. 702 proven. 0 refuted. 0 times theorem prover too weak. 322 trivial. 0 not checked. [2025-03-03 10:59:43,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:43,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457873636] [2025-03-03 10:59:43,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457873636] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:43,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:43,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:59:43,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879783298] [2025-03-03 10:59:43,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:43,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:59:43,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:43,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:59:43,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:59:43,996 INFO L87 Difference]: Start difference. First operand 66933 states and 73685 transitions. Second operand has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:45,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:45,837 INFO L93 Difference]: Finished difference Result 141526 states and 155665 transitions. [2025-03-03 10:59:45,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:59:45,837 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 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 515 [2025-03-03 10:59:45,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:45,921 INFO L225 Difference]: With dead ends: 141526 [2025-03-03 10:59:45,921 INFO L226 Difference]: Without dead ends: 73745 [2025-03-03 10:59:45,965 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:59:45,966 INFO L435 NwaCegarLoop]: 717 mSDtfsCounter, 813 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 2093 mSolverCounterSat, 312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 813 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 2405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 312 IncrementalHoareTripleChecker+Valid, 2093 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:45,966 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [813 Valid, 780 Invalid, 2405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [312 Valid, 2093 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:59:46,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73745 states. [2025-03-03 10:59:46,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73745 to 61380. [2025-03-03 10:59:46,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61380 states, 61379 states have (on average 1.0978836409847017) internal successors, (67387), 61379 states have internal predecessors, (67387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:46,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61380 states to 61380 states and 67387 transitions. [2025-03-03 10:59:46,964 INFO L78 Accepts]: Start accepts. Automaton has 61380 states and 67387 transitions. Word has length 515 [2025-03-03 10:59:46,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:46,964 INFO L471 AbstractCegarLoop]: Abstraction has 61380 states and 67387 transitions. [2025-03-03 10:59:46,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.5) internal successors, (278), 4 states have internal predecessors, (278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 61380 states and 67387 transitions. [2025-03-03 10:59:46,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2025-03-03 10:59:46,973 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:46,973 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:46,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:59:46,973 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:46,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:46,974 INFO L85 PathProgramCache]: Analyzing trace with hash -1218321191, now seen corresponding path program 1 times [2025-03-03 10:59:46,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:46,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [67697100] [2025-03-03 10:59:46,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:46,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:47,001 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 519 statements into 1 equivalence classes. [2025-03-03 10:59:47,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 519 of 519 statements. [2025-03-03 10:59:47,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:47,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:47,401 INFO L134 CoverageAnalysis]: Checked inductivity of 718 backedges. 473 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 10:59:47,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:47,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [67697100] [2025-03-03 10:59:47,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [67697100] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:47,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:47,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:59:47,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818582253] [2025-03-03 10:59:47,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:47,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:59:47,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:47,403 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:59:47,403 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:59:47,403 INFO L87 Difference]: Start difference. First operand 61380 states and 67387 transitions. Second operand has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:49,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:49,371 INFO L93 Difference]: Finished difference Result 142778 states and 156155 transitions. [2025-03-03 10:59:49,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:59:49,371 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 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 519 [2025-03-03 10:59:49,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:49,453 INFO L225 Difference]: With dead ends: 142778 [2025-03-03 10:59:49,453 INFO L226 Difference]: Without dead ends: 78000 [2025-03-03 10:59:49,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:59:49,475 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 690 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2356 mSolverCounterSat, 315 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 690 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 2671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 315 IncrementalHoareTripleChecker+Valid, 2356 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:49,475 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [690 Valid, 178 Invalid, 2671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [315 Valid, 2356 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 10:59:49,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78000 states. [2025-03-03 10:59:50,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78000 to 74567. [2025-03-03 10:59:50,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74567 states, 74566 states have (on average 1.095445645468444) internal successors, (81683), 74566 states have internal predecessors, (81683), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:50,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74567 states to 74567 states and 81683 transitions. [2025-03-03 10:59:50,213 INFO L78 Accepts]: Start accepts. Automaton has 74567 states and 81683 transitions. Word has length 519 [2025-03-03 10:59:50,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:50,214 INFO L471 AbstractCegarLoop]: Abstraction has 74567 states and 81683 transitions. [2025-03-03 10:59:50,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.25) internal successors, (357), 4 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:50,214 INFO L276 IsEmpty]: Start isEmpty. Operand 74567 states and 81683 transitions. [2025-03-03 10:59:50,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 560 [2025-03-03 10:59:50,224 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:50,224 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:50,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:59:50,224 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:50,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:50,224 INFO L85 PathProgramCache]: Analyzing trace with hash -2141732811, now seen corresponding path program 1 times [2025-03-03 10:59:50,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:50,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154523737] [2025-03-03 10:59:50,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:50,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:50,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 559 statements into 1 equivalence classes. [2025-03-03 10:59:50,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 559 of 559 statements. [2025-03-03 10:59:50,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:50,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:50,435 INFO L134 CoverageAnalysis]: Checked inductivity of 427 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 10:59:50,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:50,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154523737] [2025-03-03 10:59:50,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154523737] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:50,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:50,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:50,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189232262] [2025-03-03 10:59:50,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:50,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:50,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:50,436 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:50,436 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:50,437 INFO L87 Difference]: Start difference. First operand 74567 states and 81683 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-03 10:59:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:51,864 INFO L93 Difference]: Finished difference Result 147847 states and 161967 transitions. [2025-03-03 10:59:51,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:51,864 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 559 [2025-03-03 10:59:51,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:51,936 INFO L225 Difference]: With dead ends: 147847 [2025-03-03 10:59:51,937 INFO L226 Difference]: Without dead ends: 73281 [2025-03-03 10:59:51,979 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-03 10:59:51,980 INFO L435 NwaCegarLoop]: 641 mSDtfsCounter, 436 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1159 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 436 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 1159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:51,980 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [436 Valid, 698 Invalid, 1287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 1159 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:59:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73281 states. [2025-03-03 10:59:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73281 to 70728. [2025-03-03 10:59:52,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70728 states, 70727 states have (on average 1.0749784382201988) internal successors, (76030), 70727 states have internal predecessors, (76030), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:52,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70728 states to 70728 states and 76030 transitions. [2025-03-03 10:59:52,752 INFO L78 Accepts]: Start accepts. Automaton has 70728 states and 76030 transitions. Word has length 559 [2025-03-03 10:59:52,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:52,753 INFO L471 AbstractCegarLoop]: Abstraction has 70728 states and 76030 transitions. [2025-03-03 10:59:52,753 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-03 10:59:52,753 INFO L276 IsEmpty]: Start isEmpty. Operand 70728 states and 76030 transitions. [2025-03-03 10:59:52,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 571 [2025-03-03 10:59:52,761 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:52,761 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, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:52,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-03 10:59:52,761 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:52,762 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:52,762 INFO L85 PathProgramCache]: Analyzing trace with hash 128694359, now seen corresponding path program 1 times [2025-03-03 10:59:52,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:52,762 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [941401170] [2025-03-03 10:59:52,762 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:52,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:52,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 570 statements into 1 equivalence classes. [2025-03-03 10:59:52,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 570 of 570 statements. [2025-03-03 10:59:52,815 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:52,815 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:53,231 INFO L134 CoverageAnalysis]: Checked inductivity of 1060 backedges. 685 proven. 0 refuted. 0 times theorem prover too weak. 375 trivial. 0 not checked. [2025-03-03 10:59:53,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:53,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [941401170] [2025-03-03 10:59:53,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [941401170] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:53,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:53,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 10:59:53,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373010272] [2025-03-03 10:59:53,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:53,232 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 10:59:53,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:53,232 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 10:59:53,232 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:59:53,233 INFO L87 Difference]: Start difference. First operand 70728 states and 76030 transitions. Second operand has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:55,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:55,919 INFO L93 Difference]: Finished difference Result 178474 states and 191701 transitions. [2025-03-03 10:59:55,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 10:59:55,920 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 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 570 [2025-03-03 10:59:55,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:56,035 INFO L225 Difference]: With dead ends: 178474 [2025-03-03 10:59:56,035 INFO L226 Difference]: Without dead ends: 105623 [2025-03-03 10:59:56,084 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:59:56,084 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 1325 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 3797 mSolverCounterSat, 638 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1325 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 4435 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 638 IncrementalHoareTripleChecker+Valid, 3797 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:56,084 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1325 Valid, 222 Invalid, 4435 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [638 Valid, 3797 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-03-03 10:59:56,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105623 states. [2025-03-03 10:59:57,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105623 to 91157. [2025-03-03 10:59:57,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91157 states, 91156 states have (on average 1.0678178068366317) internal successors, (97338), 91156 states have internal predecessors, (97338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:57,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91157 states to 91157 states and 97338 transitions. [2025-03-03 10:59:57,157 INFO L78 Accepts]: Start accepts. Automaton has 91157 states and 97338 transitions. Word has length 570 [2025-03-03 10:59:57,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:57,157 INFO L471 AbstractCegarLoop]: Abstraction has 91157 states and 97338 transitions. [2025-03-03 10:59:57,158 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 56.0) internal successors, (280), 5 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:57,158 INFO L276 IsEmpty]: Start isEmpty. Operand 91157 states and 97338 transitions. [2025-03-03 10:59:57,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 642 [2025-03-03 10:59:57,171 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:57,171 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, 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, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 10:59:57,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-03-03 10:59:57,171 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:57,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:57,172 INFO L85 PathProgramCache]: Analyzing trace with hash 910331314, now seen corresponding path program 1 times [2025-03-03 10:59:57,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:57,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1880845773] [2025-03-03 10:59:57,172 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:57,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:57,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 641 statements into 1 equivalence classes. [2025-03-03 10:59:57,225 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 641 of 641 statements. [2025-03-03 10:59:57,225 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:57,225 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:57,466 INFO L134 CoverageAnalysis]: Checked inductivity of 833 backedges. 468 proven. 0 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2025-03-03 10:59:57,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:57,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1880845773] [2025-03-03 10:59:57,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1880845773] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:57,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:57,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:57,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218166814] [2025-03-03 10:59:57,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:57,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:57,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:57,468 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:57,468 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:57,468 INFO L87 Difference]: Start difference. First operand 91157 states and 97338 transitions. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:58,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:58,747 INFO L93 Difference]: Finished difference Result 174614 states and 186168 transitions. [2025-03-03 10:59:58,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:58,747 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 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 641 [2025-03-03 10:59:58,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:58,824 INFO L225 Difference]: With dead ends: 174614 [2025-03-03 10:59:58,825 INFO L226 Difference]: Without dead ends: 80057 [2025-03-03 10:59:58,877 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-03 10:59:58,878 INFO L435 NwaCegarLoop]: 600 mSDtfsCounter, 486 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 1122 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 1337 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 1122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:58,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 627 Invalid, 1337 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 1122 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:59:58,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80057 states. [2025-03-03 10:59:59,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80057 to 77928. [2025-03-03 10:59:59,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77928 states, 77927 states have (on average 1.0574640368550052) internal successors, (82405), 77927 states have internal predecessors, (82405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:59,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77928 states to 77928 states and 82405 transitions. [2025-03-03 10:59:59,933 INFO L78 Accepts]: Start accepts. Automaton has 77928 states and 82405 transitions. Word has length 641 [2025-03-03 10:59:59,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:59,934 INFO L471 AbstractCegarLoop]: Abstraction has 77928 states and 82405 transitions. [2025-03-03 10:59:59,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:59,934 INFO L276 IsEmpty]: Start isEmpty. Operand 77928 states and 82405 transitions. [2025-03-03 11:00:00,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 685 [2025-03-03 11:00:00,117 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:00,117 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:00:00,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-03-03 11:00:00,117 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:00,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:00,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1494841574, now seen corresponding path program 1 times [2025-03-03 11:00:00,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:00,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351880919] [2025-03-03 11:00:00,118 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:00,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:00,157 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 684 statements into 1 equivalence classes. [2025-03-03 11:00:00,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 684 of 684 statements. [2025-03-03 11:00:00,188 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:00,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 821 backedges. 576 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 11:00:00,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:00,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351880919] [2025-03-03 11:00:00,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351880919] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:00,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:00,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:00:00,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280567436] [2025-03-03 11:00:00,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:00,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:00:00,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:00,654 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:00:00,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:00:00,655 INFO L87 Difference]: Start difference. First operand 77928 states and 82405 transitions. Second operand has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:02,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:02,427 INFO L93 Difference]: Finished difference Result 92411 states and 97439 transitions. [2025-03-03 11:00:02,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:00:02,427 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 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 684 [2025-03-03 11:00:02,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:02,521 INFO L225 Difference]: With dead ends: 92411 [2025-03-03 11:00:02,521 INFO L226 Difference]: Without dead ends: 91984 [2025-03-03 11:00:02,547 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:00:02,548 INFO L435 NwaCegarLoop]: 80 mSDtfsCounter, 682 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 2304 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 682 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 2608 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 2304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:02,548 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [682 Valid, 136 Invalid, 2608 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 2304 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:00:02,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91984 states. [2025-03-03 11:00:03,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91984 to 82184. [2025-03-03 11:00:03,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82184 states, 82183 states have (on average 1.05654454084178) internal successors, (86830), 82183 states have internal predecessors, (86830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:03,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82184 states to 82184 states and 86830 transitions. [2025-03-03 11:00:03,487 INFO L78 Accepts]: Start accepts. Automaton has 82184 states and 86830 transitions. Word has length 684 [2025-03-03 11:00:03,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:03,488 INFO L471 AbstractCegarLoop]: Abstraction has 82184 states and 86830 transitions. [2025-03-03 11:00:03,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.5) internal successors, (522), 4 states have internal predecessors, (522), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:03,488 INFO L276 IsEmpty]: Start isEmpty. Operand 82184 states and 86830 transitions. [2025-03-03 11:00:03,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 704 [2025-03-03 11:00:03,512 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:03,513 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, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:00:03,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-03-03 11:00:03,514 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:03,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:03,514 INFO L85 PathProgramCache]: Analyzing trace with hash 493531287, now seen corresponding path program 1 times [2025-03-03 11:00:03,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:03,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [296222722] [2025-03-03 11:00:03,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:03,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:03,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 703 statements into 1 equivalence classes. [2025-03-03 11:00:03,618 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 703 of 703 statements. [2025-03-03 11:00:03,618 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:03,618 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:04,053 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 11:00:04,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [296222722] [2025-03-03 11:00:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [296222722] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:04,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:04,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 11:00:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792272074] [2025-03-03 11:00:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:04,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 11:00:04,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:04,054 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 11:00:04,054 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 11:00:04,054 INFO L87 Difference]: Start difference. First operand 82184 states and 86830 transitions. Second operand has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:05,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:05,464 INFO L93 Difference]: Finished difference Result 169907 states and 179425 transitions. [2025-03-03 11:00:05,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 11:00:05,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 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 703 [2025-03-03 11:00:05,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:05,548 INFO L225 Difference]: With dead ends: 169907 [2025-03-03 11:00:05,549 INFO L226 Difference]: Without dead ends: 87300 [2025-03-03 11:00:05,591 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-03 11:00:05,591 INFO L435 NwaCegarLoop]: 202 mSDtfsCounter, 402 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1169 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 1316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 1169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:05,591 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 237 Invalid, 1316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 1169 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 11:00:05,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87300 states. [2025-03-03 11:00:06,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87300 to 86013. [2025-03-03 11:00:06,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86013 states, 86012 states have (on average 1.0558294191508162) internal successors, (90814), 86012 states have internal predecessors, (90814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:06,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86013 states to 86013 states and 90814 transitions. [2025-03-03 11:00:06,310 INFO L78 Accepts]: Start accepts. Automaton has 86013 states and 90814 transitions. Word has length 703 [2025-03-03 11:00:06,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:06,311 INFO L471 AbstractCegarLoop]: Abstraction has 86013 states and 90814 transitions. [2025-03-03 11:00:06,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 180.33333333333334) internal successors, (541), 3 states have internal predecessors, (541), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:06,311 INFO L276 IsEmpty]: Start isEmpty. Operand 86013 states and 90814 transitions. [2025-03-03 11:00:06,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 750 [2025-03-03 11:00:06,332 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:06,332 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, 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, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:00:06,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-03-03 11:00:06,332 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:06,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:06,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1682583766, now seen corresponding path program 1 times [2025-03-03 11:00:06,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:06,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611828621] [2025-03-03 11:00:06,333 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:06,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:06,371 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 749 statements into 1 equivalence classes. [2025-03-03 11:00:06,400 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 749 of 749 statements. [2025-03-03 11:00:06,400 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:06,400 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:06,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1161 backedges. 974 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-03 11:00:06,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:06,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611828621] [2025-03-03 11:00:06,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611828621] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:06,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:06,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:00:06,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414676834] [2025-03-03 11:00:06,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:06,814 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:00:06,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:06,815 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:00:06,815 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:00:06,815 INFO L87 Difference]: Start difference. First operand 86013 states and 90814 transitions. Second operand has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:08,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:08,781 INFO L93 Difference]: Finished difference Result 197153 states and 208251 transitions. [2025-03-03 11:00:08,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:00:08,782 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 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 749 [2025-03-03 11:00:08,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:08,907 INFO L225 Difference]: With dead ends: 197153 [2025-03-03 11:00:08,907 INFO L226 Difference]: Without dead ends: 111142 [2025-03-03 11:00:08,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:00:08,970 INFO L435 NwaCegarLoop]: 63 mSDtfsCounter, 752 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 2210 mSolverCounterSat, 353 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 752 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 353 IncrementalHoareTripleChecker+Valid, 2210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:08,970 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [752 Valid, 125 Invalid, 2563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [353 Valid, 2210 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 11:00:09,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111142 states. [2025-03-03 11:00:10,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111142 to 109008. [2025-03-03 11:00:10,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109008 states, 109007 states have (on average 1.055501022870091) internal successors, (115057), 109007 states have internal predecessors, (115057), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:10,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109008 states to 109008 states and 115057 transitions. [2025-03-03 11:00:10,267 INFO L78 Accepts]: Start accepts. Automaton has 109008 states and 115057 transitions. Word has length 749 [2025-03-03 11:00:10,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 11:00:10,267 INFO L471 AbstractCegarLoop]: Abstraction has 109008 states and 115057 transitions. [2025-03-03 11:00:10,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 154.25) internal successors, (617), 4 states have internal predecessors, (617), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:10,267 INFO L276 IsEmpty]: Start isEmpty. Operand 109008 states and 115057 transitions. [2025-03-03 11:00:10,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-03-03 11:00:10,300 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 11:00:10,300 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, 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, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 11:00:10,301 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-03-03 11:00:10,301 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 11:00:10,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 11:00:10,301 INFO L85 PathProgramCache]: Analyzing trace with hash 1031372221, now seen corresponding path program 1 times [2025-03-03 11:00:10,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 11:00:10,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102728446] [2025-03-03 11:00:10,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 11:00:10,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 11:00:10,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-03-03 11:00:10,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-03-03 11:00:10,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 11:00:10,412 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 11:00:10,935 INFO L134 CoverageAnalysis]: Checked inductivity of 883 backedges. 638 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2025-03-03 11:00:10,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 11:00:10,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102728446] [2025-03-03 11:00:10,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102728446] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 11:00:10,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 11:00:10,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 11:00:10,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515182986] [2025-03-03 11:00:10,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 11:00:10,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 11:00:10,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 11:00:10,937 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 11:00:10,937 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:00:10,937 INFO L87 Difference]: Start difference. First operand 109008 states and 115057 transitions. Second operand has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 11:00:13,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 11:00:13,141 INFO L93 Difference]: Finished difference Result 234201 states and 246949 transitions. [2025-03-03 11:00:13,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 11:00:13,141 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 153.75) internal successors, (615), 4 states have internal predecessors, (615), 0 states have call successors, (0), 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 777 [2025-03-03 11:00:13,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 11:00:13,291 INFO L225 Difference]: With dead ends: 234201 [2025-03-03 11:00:13,291 INFO L226 Difference]: Without dead ends: 124770 [2025-03-03 11:00:13,363 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 11:00:13,364 INFO L435 NwaCegarLoop]: 89 mSDtfsCounter, 595 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 2265 mSolverCounterSat, 352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 2617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 352 IncrementalHoareTripleChecker+Valid, 2265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 11:00:13,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 137 Invalid, 2617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [352 Valid, 2265 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 11:00:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124770 states. [2025-03-03 11:00:14,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124770 to 112408. [2025-03-03 11:00:14,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112408 states, 112407 states have (on average 1.0549343012445844) internal successors, (118582), 112407 states have internal predecessors, (118582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)