./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label15.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_label15.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 a8ce96d555e872b609ed7174eef821f9a0406316106ba92ad582ec48aa272726 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 10:58:46,862 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 10:58:46,908 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:46,914 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 10:58:46,915 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 10:58:46,928 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 10:58:46,928 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 10:58:46,929 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 10:58:46,929 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 10:58:46,929 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 10:58:46,929 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 10:58:46,929 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 10:58:46,929 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 10:58:46,929 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 10:58:46,930 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 10:58:46,930 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 10:58:46,930 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 10:58:46,930 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 10:58:46,930 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 10:58:46,930 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 10:58:46,930 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 10:58:46,930 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 10:58:46,930 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 10:58:46,930 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 10:58:46,930 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 10:58:46,931 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 10:58:46,931 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 10:58:46,931 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 10:58:46,931 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 10:58:46,931 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 10:58:46,931 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 10:58:46,931 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 10:58:46,931 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:58:46,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 10:58:46,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 10:58:46,931 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 10:58:46,932 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 10:58:46,932 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 10:58:46,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 10:58:46,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 10:58:46,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 10:58:46,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 10:58:46,932 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 10:58:46,932 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 -> a8ce96d555e872b609ed7174eef821f9a0406316106ba92ad582ec48aa272726 [2025-03-03 10:58:47,163 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 10:58:47,173 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 10:58:47,175 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 10:58:47,176 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 10:58:47,176 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 10:58:47,177 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label15.c [2025-03-03 10:58:48,351 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48346b99a/b1a893a5f09145f6b41e3ecc65d54371/FLAG32f4cf5e1 [2025-03-03 10:58:48,673 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 10:58:48,674 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label15.c [2025-03-03 10:58:48,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48346b99a/b1a893a5f09145f6b41e3ecc65d54371/FLAG32f4cf5e1 [2025-03-03 10:58:48,913 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48346b99a/b1a893a5f09145f6b41e3ecc65d54371 [2025-03-03 10:58:48,915 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 10:58:48,916 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 10:58:48,917 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 10:58:48,917 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 10:58:48,919 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 10:58:48,920 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:58:48" (1/1) ... [2025-03-03 10:58:48,921 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44205c89 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:48, skipping insertion in model container [2025-03-03 10:58:48,921 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 10:58:48" (1/1) ... [2025-03-03 10:58:48,974 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 10:58:49,120 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_label15.c[5490,5503] [2025-03-03 10:58:49,429 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:58:49,436 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 10:58:49,466 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_label15.c[5490,5503] [2025-03-03 10:58:49,609 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 10:58:49,623 INFO L204 MainTranslator]: Completed translation [2025-03-03 10:58:49,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:49 WrapperNode [2025-03-03 10:58:49,624 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 10:58:49,625 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 10:58:49,625 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 10:58:49,625 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 10:58:49,629 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:49" (1/1) ... [2025-03-03 10:58:49,658 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:49" (1/1) ... [2025-03-03 10:58:49,841 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2610 [2025-03-03 10:58:49,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 10:58:49,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 10:58:49,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 10:58:49,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 10:58:49,848 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:49" (1/1) ... [2025-03-03 10:58:49,848 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:49" (1/1) ... [2025-03-03 10:58:49,933 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:49" (1/1) ... [2025-03-03 10:58:50,043 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:50,044 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:49" (1/1) ... [2025-03-03 10:58:50,044 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:49" (1/1) ... [2025-03-03 10:58:50,110 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:49" (1/1) ... [2025-03-03 10:58:50,126 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:49" (1/1) ... [2025-03-03 10:58:50,160 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:49" (1/1) ... [2025-03-03 10:58:50,180 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:49" (1/1) ... [2025-03-03 10:58:50,222 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 10:58:50,224 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 10:58:50,224 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 10:58:50,224 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 10:58:50,225 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:49" (1/1) ... [2025-03-03 10:58:50,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 10:58:50,239 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:58:50,252 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:50,254 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:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 10:58:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 10:58:50,270 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 10:58:50,270 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 10:58:50,318 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 10:58:50,319 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 10:58:52,742 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L1653: havoc calculate_output_#t~ret7#1; [2025-03-03 10:58:52,924 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2025-03-03 10:58:52,924 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 10:58:52,963 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 10:58:52,963 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 10:58:52,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:58:52 BoogieIcfgContainer [2025-03-03 10:58:52,963 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 10:58:52,970 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 10:58:52,970 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 10:58:52,986 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 10:58:52,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 10:58:48" (1/3) ... [2025-03-03 10:58:52,991 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498710be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:58:52, skipping insertion in model container [2025-03-03 10:58:52,991 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 10:58:49" (2/3) ... [2025-03-03 10:58:52,992 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@498710be and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 10:58:52, skipping insertion in model container [2025-03-03 10:58:52,992 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 10:58:52" (3/3) ... [2025-03-03 10:58:52,995 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem17_label15.c [2025-03-03 10:58:53,008 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 10:58:53,010 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem17_label15.c that has 1 procedures, 590 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 10:58:53,063 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 10:58:53,071 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;@6b3a9087, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 10:58:53,071 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 10:58:53,075 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:58:53,079 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-03 10:58:53,080 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:53,080 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:58:53,081 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:53,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:53,084 INFO L85 PathProgramCache]: Analyzing trace with hash -813462447, now seen corresponding path program 1 times [2025-03-03 10:58:53,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:53,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1268157260] [2025-03-03 10:58:53,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:53,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:53,143 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-03 10:58:53,175 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-03 10:58:53,177 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:53,177 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:53,332 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:58:53,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:53,333 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1268157260] [2025-03-03 10:58:53,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1268157260] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:53,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:53,334 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:58:53,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576367928] [2025-03-03 10:58:53,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:53,337 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:53,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:53,348 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:53,349 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:53,351 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 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:58:55,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:55,369 INFO L93 Difference]: Finished difference Result 1642 states and 3021 transitions. [2025-03-03 10:58:55,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:58:55,370 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 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 36 [2025-03-03 10:58:55,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:55,380 INFO L225 Difference]: With dead ends: 1642 [2025-03-03 10:58:55,381 INFO L226 Difference]: Without dead ends: 975 [2025-03-03 10:58:55,384 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:58:55,386 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 454 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 551 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:55,386 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 551 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-03-03 10:58:55,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2025-03-03 10:58:55,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2025-03-03 10:58:55,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 0 states have call successors, (0), 0 states 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:58:55,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2025-03-03 10:58:55,458 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 36 [2025-03-03 10:58:55,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:55,458 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2025-03-03 10:58:55,459 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.0) internal successors, (36), 2 states have internal predecessors, (36), 0 states have call successors, (0), 0 states 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:58:55,459 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2025-03-03 10:58:55,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2025-03-03 10:58:55,461 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:55,461 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:55,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 10:58:55,461 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:55,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1911583175, now seen corresponding path program 1 times [2025-03-03 10:58:55,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:55,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253203774] [2025-03-03 10:58:55,462 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:55,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 106 statements into 1 equivalence classes. [2025-03-03 10:58:55,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 106 of 106 statements. [2025-03-03 10:58:55,517 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:55,517 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:55,802 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:58:55,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:55,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253203774] [2025-03-03 10:58:55,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253203774] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:55,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:55,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:58:55,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580875909] [2025-03-03 10:58:55,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:55,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:58:55,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:55,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:58:55,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:58:55,806 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:58:58,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:58:58,612 INFO L93 Difference]: Finished difference Result 3291 states and 5100 transitions. [2025-03-03 10:58:58,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:58:58,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2025-03-03 10:58:58,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:58:58,620 INFO L225 Difference]: With dead ends: 3291 [2025-03-03 10:58:58,620 INFO L226 Difference]: Without dead ends: 2321 [2025-03-03 10:58:58,622 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:58:58,623 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 1017 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 2671 mSolverCounterSat, 814 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 3485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 814 IncrementalHoareTripleChecker+Valid, 2671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:58:58,623 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 207 Invalid, 3485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [814 Valid, 2671 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-03-03 10:58:58,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2321 states. [2025-03-03 10:58:58,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2321 to 2317. [2025-03-03 10:58:58,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2317 states, 2316 states have (on average 1.455958549222798) internal successors, (3372), 2316 states have internal predecessors, (3372), 0 states have call successors, (0), 0 states 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:58:58,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2317 states to 2317 states and 3372 transitions. [2025-03-03 10:58:58,660 INFO L78 Accepts]: Start accepts. Automaton has 2317 states and 3372 transitions. Word has length 106 [2025-03-03 10:58:58,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:58:58,660 INFO L471 AbstractCegarLoop]: Abstraction has 2317 states and 3372 transitions. [2025-03-03 10:58:58,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:58:58,660 INFO L276 IsEmpty]: Start isEmpty. Operand 2317 states and 3372 transitions. [2025-03-03 10:58:58,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2025-03-03 10:58:58,664 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:58:58,664 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:58:58,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 10:58:58,664 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:58:58,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:58:58,664 INFO L85 PathProgramCache]: Analyzing trace with hash -774940370, now seen corresponding path program 1 times [2025-03-03 10:58:58,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:58:58,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829490596] [2025-03-03 10:58:58,665 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:58:58,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:58:58,698 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 128 statements into 1 equivalence classes. [2025-03-03 10:58:58,711 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 128 of 128 statements. [2025-03-03 10:58:58,711 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:58:58,711 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:58:58,838 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:58:58,839 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:58:58,839 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829490596] [2025-03-03 10:58:58,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829490596] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:58:58,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:58:58,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-03 10:58:58,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828431049] [2025-03-03 10:58:58,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:58:58,840 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:58:58,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:58:58,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:58:58,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:58:58,843 INFO L87 Difference]: Start difference. First operand 2317 states and 3372 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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:00,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:00,405 INFO L93 Difference]: Finished difference Result 6327 states and 9334 transitions. [2025-03-03 10:59:00,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:00,405 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2025-03-03 10:59:00,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:00,415 INFO L225 Difference]: With dead ends: 6327 [2025-03-03 10:59:00,415 INFO L226 Difference]: Without dead ends: 3583 [2025-03-03 10:59:00,417 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:00,418 INFO L435 NwaCegarLoop]: 515 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 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.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:00,418 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 590 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:59:00,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3583 states. [2025-03-03 10:59:00,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3583 to 3583. [2025-03-03 10:59:00,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3583 states, 3582 states have (on average 1.2554438860971524) internal successors, (4497), 3582 states have internal predecessors, (4497), 0 states have call successors, (0), 0 states 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:00,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3583 states to 3583 states and 4497 transitions. [2025-03-03 10:59:00,465 INFO L78 Accepts]: Start accepts. Automaton has 3583 states and 4497 transitions. Word has length 128 [2025-03-03 10:59:00,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:00,465 INFO L471 AbstractCegarLoop]: Abstraction has 3583 states and 4497 transitions. [2025-03-03 10:59:00,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 2 states have internal predecessors, (128), 0 states have call successors, (0), 0 states 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:00,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3583 states and 4497 transitions. [2025-03-03 10:59:00,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2025-03-03 10:59:00,467 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:00,468 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:00,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 10:59:00,468 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:00,468 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:00,468 INFO L85 PathProgramCache]: Analyzing trace with hash 1599448704, now seen corresponding path program 1 times [2025-03-03 10:59:00,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:00,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204547410] [2025-03-03 10:59:00,469 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:00,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:00,488 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 184 statements into 1 equivalence classes. [2025-03-03 10:59:00,505 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 184 of 184 statements. [2025-03-03 10:59:00,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:00,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:00,642 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:00,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:00,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204547410] [2025-03-03 10:59:00,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204547410] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:00,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:00,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:00,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589060681] [2025-03-03 10:59:00,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:00,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:00,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:00,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:00,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:00,645 INFO L87 Difference]: Start difference. First operand 3583 states and 4497 transitions. Second operand has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states 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:02,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:02,001 INFO L93 Difference]: Finished difference Result 8446 states and 11096 transitions. [2025-03-03 10:59:02,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:02,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 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 184 [2025-03-03 10:59:02,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:02,012 INFO L225 Difference]: With dead ends: 8446 [2025-03-03 10:59:02,012 INFO L226 Difference]: Without dead ends: 5290 [2025-03-03 10:59:02,015 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:02,015 INFO L435 NwaCegarLoop]: 751 mSDtfsCounter, 500 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 808 SdHoareTripleChecker+Invalid, 1600 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:02,016 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 808 Invalid, 1600 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:59:02,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5290 states. [2025-03-03 10:59:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5290 to 5290. [2025-03-03 10:59:02,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5290 states, 5289 states have (on average 1.2550576668557383) internal successors, (6638), 5289 states have internal predecessors, (6638), 0 states have call successors, (0), 0 states 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:02,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5290 states to 5290 states and 6638 transitions. [2025-03-03 10:59:02,075 INFO L78 Accepts]: Start accepts. Automaton has 5290 states and 6638 transitions. Word has length 184 [2025-03-03 10:59:02,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:02,076 INFO L471 AbstractCegarLoop]: Abstraction has 5290 states and 6638 transitions. [2025-03-03 10:59:02,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.333333333333336) internal successors, (184), 3 states have internal predecessors, (184), 0 states have call successors, (0), 0 states 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:02,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5290 states and 6638 transitions. [2025-03-03 10:59:02,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2025-03-03 10:59:02,078 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:02,078 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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:02,078 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 10:59:02,079 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:02,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:02,079 INFO L85 PathProgramCache]: Analyzing trace with hash -2025675894, now seen corresponding path program 1 times [2025-03-03 10:59:02,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:02,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299845200] [2025-03-03 10:59:02,079 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:02,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:02,102 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 289 statements into 1 equivalence classes. [2025-03-03 10:59:02,118 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 289 of 289 statements. [2025-03-03 10:59:02,119 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:02,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:02,249 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 215 trivial. 0 not checked. [2025-03-03 10:59:02,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:02,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299845200] [2025-03-03 10:59:02,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1299845200] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:02,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:02,249 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:02,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208805196] [2025-03-03 10:59:02,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:02,250 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:02,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:02,250 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:02,250 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:02,251 INFO L87 Difference]: Start difference. First operand 5290 states and 6638 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:03,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:03,772 INFO L93 Difference]: Finished difference Result 12280 states and 15585 transitions. [2025-03-03 10:59:03,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:03,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 289 [2025-03-03 10:59:03,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:03,787 INFO L225 Difference]: With dead ends: 12280 [2025-03-03 10:59:03,787 INFO L226 Difference]: Without dead ends: 6992 [2025-03-03 10:59:03,790 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:03,791 INFO L435 NwaCegarLoop]: 881 mSDtfsCounter, 408 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 345 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 952 SdHoareTripleChecker+Invalid, 1620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 345 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:03,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 952 Invalid, 1620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [345 Valid, 1275 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-03-03 10:59:03,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6992 states. [2025-03-03 10:59:03,844 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6992 to 5284. [2025-03-03 10:59:03,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5284 states, 5283 states have (on average 1.2061328790459966) internal successors, (6372), 5283 states have internal predecessors, (6372), 0 states have call successors, (0), 0 states 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,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5284 states to 5284 states and 6372 transitions. [2025-03-03 10:59:03,857 INFO L78 Accepts]: Start accepts. Automaton has 5284 states and 6372 transitions. Word has length 289 [2025-03-03 10:59:03,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:03,857 INFO L471 AbstractCegarLoop]: Abstraction has 5284 states and 6372 transitions. [2025-03-03 10:59:03,858 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:03,858 INFO L276 IsEmpty]: Start isEmpty. Operand 5284 states and 6372 transitions. [2025-03-03 10:59:03,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2025-03-03 10:59:03,861 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:03,861 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 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:03,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 10:59:03,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:03,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:03,862 INFO L85 PathProgramCache]: Analyzing trace with hash 1668148032, now seen corresponding path program 1 times [2025-03-03 10:59:03,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:03,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071984643] [2025-03-03 10:59:03,862 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:03,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:03,884 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 293 statements into 1 equivalence classes. [2025-03-03 10:59:03,907 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 293 of 293 statements. [2025-03-03 10:59:03,908 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:03,909 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:04,036 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 223 trivial. 0 not checked. [2025-03-03 10:59:04,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:04,037 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071984643] [2025-03-03 10:59:04,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071984643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:04,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:04,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:04,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040306770] [2025-03-03 10:59:04,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:04,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:04,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:04,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:04,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:04,038 INFO L87 Difference]: Start difference. First operand 5284 states and 6372 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:05,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:05,522 INFO L93 Difference]: Finished difference Result 12689 states and 15671 transitions. [2025-03-03 10:59:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:05,523 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 293 [2025-03-03 10:59:05,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:05,538 INFO L225 Difference]: With dead ends: 12689 [2025-03-03 10:59:05,538 INFO L226 Difference]: Without dead ends: 7831 [2025-03-03 10:59:05,541 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:05,542 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 424 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1217 mSolverCounterSat, 278 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 424 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 1495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 278 IncrementalHoareTripleChecker+Valid, 1217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:05,542 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [424 Valid, 426 Invalid, 1495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [278 Valid, 1217 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-03 10:59:05,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7831 states. [2025-03-03 10:59:05,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7831 to 6111. [2025-03-03 10:59:05,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6111 states, 6110 states have (on average 1.190834697217676) internal successors, (7276), 6110 states have internal predecessors, (7276), 0 states have call successors, (0), 0 states 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,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6111 states to 6111 states and 7276 transitions. [2025-03-03 10:59:05,604 INFO L78 Accepts]: Start accepts. Automaton has 6111 states and 7276 transitions. Word has length 293 [2025-03-03 10:59:05,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:05,604 INFO L471 AbstractCegarLoop]: Abstraction has 6111 states and 7276 transitions. [2025-03-03 10:59:05,604 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:05,605 INFO L276 IsEmpty]: Start isEmpty. Operand 6111 states and 7276 transitions. [2025-03-03 10:59:05,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 307 [2025-03-03 10:59:05,607 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:05,607 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:05,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 10:59:05,607 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:05,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:05,608 INFO L85 PathProgramCache]: Analyzing trace with hash 172322908, now seen corresponding path program 1 times [2025-03-03 10:59:05,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:05,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89641605] [2025-03-03 10:59:05,608 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:05,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:05,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 306 statements into 1 equivalence classes. [2025-03-03 10:59:05,645 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 306 of 306 statements. [2025-03-03 10:59:05,645 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:05,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:05,754 INFO L134 CoverageAnalysis]: Checked inductivity of 349 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2025-03-03 10:59:05,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:05,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89641605] [2025-03-03 10:59:05,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89641605] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:05,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:05,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:05,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2089659649] [2025-03-03 10:59:05,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:05,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:05,756 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:05,757 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:05,757 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:05,757 INFO L87 Difference]: Start difference. First operand 6111 states and 7276 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:07,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:07,092 INFO L93 Difference]: Finished difference Result 13923 states and 16653 transitions. [2025-03-03 10:59:07,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:07,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 306 [2025-03-03 10:59:07,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:07,112 INFO L225 Difference]: With dead ends: 13923 [2025-03-03 10:59:07,112 INFO L226 Difference]: Without dead ends: 7814 [2025-03-03 10:59:07,116 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,117 INFO L435 NwaCegarLoop]: 310 mSDtfsCounter, 462 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1236 mSolverCounterSat, 305 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 1541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 305 IncrementalHoareTripleChecker+Valid, 1236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:07,117 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 361 Invalid, 1541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [305 Valid, 1236 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:59:07,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7814 states. [2025-03-03 10:59:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7814 to 6961. [2025-03-03 10:59:07,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6961 states, 6960 states have (on average 1.195977011494253) internal successors, (8324), 6960 states have internal predecessors, (8324), 0 states have call successors, (0), 0 states 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,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6961 states to 6961 states and 8324 transitions. [2025-03-03 10:59:07,205 INFO L78 Accepts]: Start accepts. Automaton has 6961 states and 8324 transitions. Word has length 306 [2025-03-03 10:59:07,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:07,206 INFO L471 AbstractCegarLoop]: Abstraction has 6961 states and 8324 transitions. [2025-03-03 10:59:07,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:07,206 INFO L276 IsEmpty]: Start isEmpty. Operand 6961 states and 8324 transitions. [2025-03-03 10:59:07,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 347 [2025-03-03 10:59:07,211 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:07,211 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:07,211 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 10:59:07,212 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:07,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash -246914067, now seen corresponding path program 1 times [2025-03-03 10:59:07,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:07,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516007246] [2025-03-03 10:59:07,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:07,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 346 statements into 1 equivalence classes. [2025-03-03 10:59:07,264 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 346 of 346 statements. [2025-03-03 10:59:07,264 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:07,264 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:07,472 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 334 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 10:59:07,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:07,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516007246] [2025-03-03 10:59:07,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516007246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:07,473 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:07,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:07,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [516455442] [2025-03-03 10:59:07,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:07,473 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:07,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:07,474 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:07,474 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:07,474 INFO L87 Difference]: Start difference. First operand 6961 states and 8324 transitions. Second operand has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states 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:08,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:08,878 INFO L93 Difference]: Finished difference Result 20761 states and 24824 transitions. [2025-03-03 10:59:08,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:08,882 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 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 346 [2025-03-03 10:59:08,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:08,904 INFO L225 Difference]: With dead ends: 20761 [2025-03-03 10:59:08,904 INFO L226 Difference]: Without dead ends: 12952 [2025-03-03 10:59:08,913 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:08,913 INFO L435 NwaCegarLoop]: 840 mSDtfsCounter, 378 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 249 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 378 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 249 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:08,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [378 Valid, 912 Invalid, 1539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [249 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:59:08,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12952 states. [2025-03-03 10:59:09,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12952 to 12519. [2025-03-03 10:59:09,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12519 states, 12518 states have (on average 1.1480268413484582) internal successors, (14371), 12518 states have internal predecessors, (14371), 0 states have call successors, (0), 0 states 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,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12519 states to 12519 states and 14371 transitions. [2025-03-03 10:59:09,061 INFO L78 Accepts]: Start accepts. Automaton has 12519 states and 14371 transitions. Word has length 346 [2025-03-03 10:59:09,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:09,061 INFO L471 AbstractCegarLoop]: Abstraction has 12519 states and 14371 transitions. [2025-03-03 10:59:09,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.33333333333333) internal successors, (313), 3 states have internal predecessors, (313), 0 states have call successors, (0), 0 states 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,061 INFO L276 IsEmpty]: Start isEmpty. Operand 12519 states and 14371 transitions. [2025-03-03 10:59:09,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 349 [2025-03-03 10:59:09,068 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:09,068 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:09,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 10:59:09,068 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:09,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:09,069 INFO L85 PathProgramCache]: Analyzing trace with hash 544841448, now seen corresponding path program 1 times [2025-03-03 10:59:09,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:09,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458063266] [2025-03-03 10:59:09,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:09,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:09,092 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 348 statements into 1 equivalence classes. [2025-03-03 10:59:09,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 348 of 348 statements. [2025-03-03 10:59:09,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:09,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:09,285 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 10:59:09,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:09,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458063266] [2025-03-03 10:59:09,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1458063266] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:09,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:09,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:09,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [867926104] [2025-03-03 10:59:09,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:09,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:09,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:09,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:09,287 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:09,287 INFO L87 Difference]: Start difference. First operand 12519 states and 14371 transitions. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:10,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:10,650 INFO L93 Difference]: Finished difference Result 30582 states and 35182 transitions. [2025-03-03 10:59:10,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:10,650 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 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 348 [2025-03-03 10:59:10,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:10,674 INFO L225 Difference]: With dead ends: 30582 [2025-03-03 10:59:10,674 INFO L226 Difference]: Without dead ends: 18065 [2025-03-03 10:59:10,686 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:10,689 INFO L435 NwaCegarLoop]: 397 mSDtfsCounter, 446 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 216 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 446 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 1546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 216 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:10,690 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [446 Valid, 461 Invalid, 1546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [216 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:59:10,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18065 states. [2025-03-03 10:59:10,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18065 to 16352. [2025-03-03 10:59:10,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16352 states, 16351 states have (on average 1.1402360711883066) internal successors, (18644), 16351 states have internal predecessors, (18644), 0 states have call successors, (0), 0 states 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:10,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16352 states to 16352 states and 18644 transitions. [2025-03-03 10:59:10,887 INFO L78 Accepts]: Start accepts. Automaton has 16352 states and 18644 transitions. Word has length 348 [2025-03-03 10:59:10,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:10,887 INFO L471 AbstractCegarLoop]: Abstraction has 16352 states and 18644 transitions. [2025-03-03 10:59:10,887 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states 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:10,887 INFO L276 IsEmpty]: Start isEmpty. Operand 16352 states and 18644 transitions. [2025-03-03 10:59:10,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-03-03 10:59:10,891 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:10,891 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:59:10,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 10:59:10,891 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:10,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:10,895 INFO L85 PathProgramCache]: Analyzing trace with hash 88736183, now seen corresponding path program 1 times [2025-03-03 10:59:10,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:10,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277133902] [2025-03-03 10:59:10,895 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:10,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:10,929 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-03-03 10:59:10,954 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-03-03 10:59:10,954 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:10,954 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:11,127 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 288 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2025-03-03 10:59:11,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:11,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277133902] [2025-03-03 10:59:11,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277133902] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:11,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:11,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:11,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803268198] [2025-03-03 10:59:11,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:11,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:11,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:11,129 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:11,129 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:11,130 INFO L87 Difference]: Start difference. First operand 16352 states and 18644 transitions. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:12,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:12,482 INFO L93 Difference]: Finished difference Result 40394 states and 46077 transitions. [2025-03-03 10:59:12,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:12,482 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 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 357 [2025-03-03 10:59:12,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:12,509 INFO L225 Difference]: With dead ends: 40394 [2025-03-03 10:59:12,509 INFO L226 Difference]: Without dead ends: 23604 [2025-03-03 10:59:12,525 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:12,526 INFO L435 NwaCegarLoop]: 598 mSDtfsCounter, 402 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1265 mSolverCounterSat, 288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 402 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 1553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 288 IncrementalHoareTripleChecker+Valid, 1265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:12,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [402 Valid, 653 Invalid, 1553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [288 Valid, 1265 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:59:12,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23604 states. [2025-03-03 10:59:12,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23604 to 20617. [2025-03-03 10:59:12,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20617 states, 20616 states have (on average 1.1340221187427242) internal successors, (23379), 20616 states have internal predecessors, (23379), 0 states have call successors, (0), 0 states 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:12,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20617 states to 20617 states and 23379 transitions. [2025-03-03 10:59:12,750 INFO L78 Accepts]: Start accepts. Automaton has 20617 states and 23379 transitions. Word has length 357 [2025-03-03 10:59:12,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:12,750 INFO L471 AbstractCegarLoop]: Abstraction has 20617 states and 23379 transitions. [2025-03-03 10:59:12,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 0 states have call successors, (0), 0 states 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:12,751 INFO L276 IsEmpty]: Start isEmpty. Operand 20617 states and 23379 transitions. [2025-03-03 10:59:12,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 419 [2025-03-03 10:59:12,755 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:12,755 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:12,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 10:59:12,755 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:12,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:12,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1697039834, now seen corresponding path program 1 times [2025-03-03 10:59:12,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:12,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1391690654] [2025-03-03 10:59:12,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:12,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:12,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 418 statements into 1 equivalence classes. [2025-03-03 10:59:12,802 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 418 of 418 statements. [2025-03-03 10:59:12,802 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:12,803 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:12,916 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 101 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 10:59:12,916 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:12,916 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1391690654] [2025-03-03 10:59:12,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1391690654] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:12,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:12,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:12,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815731471] [2025-03-03 10:59:12,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:12,917 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:12,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:12,917 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:12,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:12,917 INFO L87 Difference]: Start difference. First operand 20617 states and 23379 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:14,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:14,195 INFO L93 Difference]: Finished difference Result 47189 states and 53592 transitions. [2025-03-03 10:59:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:14,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 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 418 [2025-03-03 10:59:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:14,224 INFO L225 Difference]: With dead ends: 47189 [2025-03-03 10:59:14,224 INFO L226 Difference]: Without dead ends: 26148 [2025-03-03 10:59:14,238 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:14,239 INFO L435 NwaCegarLoop]: 340 mSDtfsCounter, 431 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1223 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 1471 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 1223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:14,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 394 Invalid, 1471 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 1223 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-03-03 10:59:14,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26148 states. [2025-03-03 10:59:14,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26148 to 20607. [2025-03-03 10:59:14,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20607 states, 20606 states have (on average 1.1319518586819373) internal successors, (23325), 20606 states have internal predecessors, (23325), 0 states have call successors, (0), 0 states 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:14,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20607 states to 20607 states and 23325 transitions. [2025-03-03 10:59:14,605 INFO L78 Accepts]: Start accepts. Automaton has 20607 states and 23325 transitions. Word has length 418 [2025-03-03 10:59:14,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:14,606 INFO L471 AbstractCegarLoop]: Abstraction has 20607 states and 23325 transitions. [2025-03-03 10:59:14,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states 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:14,607 INFO L276 IsEmpty]: Start isEmpty. Operand 20607 states and 23325 transitions. [2025-03-03 10:59:14,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-03-03 10:59:14,611 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:14,612 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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:14,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 10:59:14,612 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:14,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:14,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1431765406, now seen corresponding path program 1 times [2025-03-03 10:59:14,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:14,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97231998] [2025-03-03 10:59:14,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:14,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:14,650 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-03-03 10:59:14,677 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-03-03 10:59:14,677 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:14,677 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:14,899 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 527 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2025-03-03 10:59:14,899 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:14,899 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97231998] [2025-03-03 10:59:14,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97231998] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:14,900 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:14,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:14,900 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [322800754] [2025-03-03 10:59:14,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:14,900 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:14,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:14,900 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:14,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:14,901 INFO L87 Difference]: Start difference. First operand 20607 states and 23325 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:16,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:16,359 INFO L93 Difference]: Finished difference Result 51001 states and 57570 transitions. [2025-03-03 10:59:16,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:16,359 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 432 [2025-03-03 10:59:16,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:16,392 INFO L225 Difference]: With dead ends: 51001 [2025-03-03 10:59:16,392 INFO L226 Difference]: Without dead ends: 29535 [2025-03-03 10:59:16,406 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:16,407 INFO L435 NwaCegarLoop]: 587 mSDtfsCounter, 448 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 1198 mSolverCounterSat, 316 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 448 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 316 IncrementalHoareTripleChecker+Valid, 1198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:16,407 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [448 Valid, 621 Invalid, 1514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [316 Valid, 1198 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-03-03 10:59:16,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29535 states. [2025-03-03 10:59:16,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29535 to 26545. [2025-03-03 10:59:16,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26545 states, 26544 states have (on average 1.1164481615430983) internal successors, (29635), 26544 states have internal predecessors, (29635), 0 states have call successors, (0), 0 states 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:16,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26545 states to 26545 states and 29635 transitions. [2025-03-03 10:59:16,718 INFO L78 Accepts]: Start accepts. Automaton has 26545 states and 29635 transitions. Word has length 432 [2025-03-03 10:59:16,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:16,718 INFO L471 AbstractCegarLoop]: Abstraction has 26545 states and 29635 transitions. [2025-03-03 10:59:16,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-03 10:59:16,719 INFO L276 IsEmpty]: Start isEmpty. Operand 26545 states and 29635 transitions. [2025-03-03 10:59:16,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 457 [2025-03-03 10:59:16,726 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:16,726 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:59:16,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 10:59:16,726 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:16,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:16,727 INFO L85 PathProgramCache]: Analyzing trace with hash -1432972537, now seen corresponding path program 1 times [2025-03-03 10:59:16,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:16,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127071851] [2025-03-03 10:59:16,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:16,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:16,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 456 statements into 1 equivalence classes. [2025-03-03 10:59:16,804 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 456 of 456 statements. [2025-03-03 10:59:16,805 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:16,805 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:17,232 INFO L134 CoverageAnalysis]: Checked inductivity of 660 backedges. 544 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 10:59:17,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:17,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127071851] [2025-03-03 10:59:17,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127071851] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:17,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:17,232 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:17,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900918676] [2025-03-03 10:59:17,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:17,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:17,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:17,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:17,234 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:17,234 INFO L87 Difference]: Start difference. First operand 26545 states and 29635 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states 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:18,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:18,531 INFO L93 Difference]: Finished difference Result 65008 states and 72107 transitions. [2025-03-03 10:59:18,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:18,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 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 456 [2025-03-03 10:59:18,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:18,568 INFO L225 Difference]: With dead ends: 65008 [2025-03-03 10:59:18,569 INFO L226 Difference]: Without dead ends: 37613 [2025-03-03 10:59:18,587 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:18,588 INFO L435 NwaCegarLoop]: 753 mSDtfsCounter, 368 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1290 mSolverCounterSat, 155 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 804 SdHoareTripleChecker+Invalid, 1445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 155 IncrementalHoareTripleChecker+Valid, 1290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:18,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 804 Invalid, 1445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [155 Valid, 1290 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:59:18,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37613 states. [2025-03-03 10:59:18,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37613 to 35046. [2025-03-03 10:59:18,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35046 states, 35045 states have (on average 1.100071336852618) internal successors, (38552), 35045 states have internal predecessors, (38552), 0 states have call successors, (0), 0 states 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:18,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35046 states to 35046 states and 38552 transitions. [2025-03-03 10:59:18,888 INFO L78 Accepts]: Start accepts. Automaton has 35046 states and 38552 transitions. Word has length 456 [2025-03-03 10:59:18,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:18,889 INFO L471 AbstractCegarLoop]: Abstraction has 35046 states and 38552 transitions. [2025-03-03 10:59:18,889 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states 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:18,889 INFO L276 IsEmpty]: Start isEmpty. Operand 35046 states and 38552 transitions. [2025-03-03 10:59:18,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 466 [2025-03-03 10:59:18,894 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:18,895 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:18,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 10:59:18,895 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:18,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:18,896 INFO L85 PathProgramCache]: Analyzing trace with hash 888815798, now seen corresponding path program 1 times [2025-03-03 10:59:18,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:18,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034003428] [2025-03-03 10:59:18,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:18,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:18,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 465 statements into 1 equivalence classes. [2025-03-03 10:59:18,941 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 465 of 465 statements. [2025-03-03 10:59:18,942 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:18,942 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 699 backedges. 430 proven. 0 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2025-03-03 10:59:19,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:19,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034003428] [2025-03-03 10:59:19,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034003428] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:19,065 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:19,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:19,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459453599] [2025-03-03 10:59:19,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:19,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:19,066 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:19,066 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:19,066 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:19,066 INFO L87 Difference]: Start difference. First operand 35046 states and 38552 transitions. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 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:20,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:20,216 INFO L93 Difference]: Finished difference Result 75624 states and 83407 transitions. [2025-03-03 10:59:20,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:20,216 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 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 465 [2025-03-03 10:59:20,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:20,250 INFO L225 Difference]: With dead ends: 75624 [2025-03-03 10:59:20,250 INFO L226 Difference]: Without dead ends: 40580 [2025-03-03 10:59:20,268 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:20,268 INFO L435 NwaCegarLoop]: 696 mSDtfsCounter, 342 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1138 mSolverCounterSat, 191 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 1329 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 191 IncrementalHoareTripleChecker+Valid, 1138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:20,268 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 745 Invalid, 1329 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [191 Valid, 1138 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:59:20,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40580 states. [2025-03-03 10:59:20,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40580 to 34600. [2025-03-03 10:59:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34600 states, 34599 states have (on average 1.0974594641463626) internal successors, (37971), 34599 states have internal predecessors, (37971), 0 states have call successors, (0), 0 states 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:20,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34600 states to 34600 states and 37971 transitions. [2025-03-03 10:59:20,547 INFO L78 Accepts]: Start accepts. Automaton has 34600 states and 37971 transitions. Word has length 465 [2025-03-03 10:59:20,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:20,547 INFO L471 AbstractCegarLoop]: Abstraction has 34600 states and 37971 transitions. [2025-03-03 10:59:20,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 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:20,547 INFO L276 IsEmpty]: Start isEmpty. Operand 34600 states and 37971 transitions. [2025-03-03 10:59:20,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-03-03 10:59:20,552 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:20,552 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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:20,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-03 10:59:20,553 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:20,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:20,553 INFO L85 PathProgramCache]: Analyzing trace with hash -54159638, now seen corresponding path program 1 times [2025-03-03 10:59:20,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:20,553 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959906383] [2025-03-03 10:59:20,553 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:20,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:20,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-03-03 10:59:20,607 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-03-03 10:59:20,607 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:20,607 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:20,915 INFO L134 CoverageAnalysis]: Checked inductivity of 709 backedges. 675 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 10:59:20,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:20,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959906383] [2025-03-03 10:59:20,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959906383] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:20,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:20,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 10:59:20,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895287024] [2025-03-03 10:59:20,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:20,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 10:59:20,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:20,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 10:59:20,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 10:59:20,916 INFO L87 Difference]: Start difference. First operand 34600 states and 37971 transitions. Second operand has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states 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:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:22,883 INFO L93 Difference]: Finished difference Result 83276 states and 91176 transitions. [2025-03-03 10:59:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 10:59:22,883 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 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 477 [2025-03-03 10:59:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:22,928 INFO L225 Difference]: With dead ends: 83276 [2025-03-03 10:59:22,928 INFO L226 Difference]: Without dead ends: 48678 [2025-03-03 10:59:22,950 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:22,950 INFO L435 NwaCegarLoop]: 106 mSDtfsCounter, 768 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 444 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 2798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 444 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:22,951 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 195 Invalid, 2798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [444 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-03 10:59:22,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48678 states. [2025-03-03 10:59:23,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48678 to 46113. [2025-03-03 10:59:23,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46113 states, 46112 states have (on average 1.0941620402498264) internal successors, (50454), 46112 states have internal predecessors, (50454), 0 states have call successors, (0), 0 states 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,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46113 states to 46113 states and 50454 transitions. [2025-03-03 10:59:23,285 INFO L78 Accepts]: Start accepts. Automaton has 46113 states and 50454 transitions. Word has length 477 [2025-03-03 10:59:23,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:23,285 INFO L471 AbstractCegarLoop]: Abstraction has 46113 states and 50454 transitions. [2025-03-03 10:59:23,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 111.0) internal successors, (444), 4 states have internal predecessors, (444), 0 states have call successors, (0), 0 states 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,285 INFO L276 IsEmpty]: Start isEmpty. Operand 46113 states and 50454 transitions. [2025-03-03 10:59:23,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-03 10:59:23,291 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:23,291 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:59:23,291 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-03 10:59:23,291 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:23,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:23,292 INFO L85 PathProgramCache]: Analyzing trace with hash -1944828043, now seen corresponding path program 1 times [2025-03-03 10:59:23,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:23,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168654265] [2025-03-03 10:59:23,292 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:23,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:23,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-03 10:59:23,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-03 10:59:23,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:23,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:23,692 INFO L134 CoverageAnalysis]: Checked inductivity of 668 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2025-03-03 10:59:23,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:23,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168654265] [2025-03-03 10:59:23,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168654265] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:23,692 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:23,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:23,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642423982] [2025-03-03 10:59:23,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:23,693 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:23,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:23,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:23,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:23,694 INFO L87 Difference]: Start difference. First operand 46113 states and 50454 transitions. Second operand has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:24,995 INFO L93 Difference]: Finished difference Result 99902 states and 109342 transitions. [2025-03-03 10:59:24,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:24,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 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:24,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:25,050 INFO L225 Difference]: With dead ends: 99902 [2025-03-03 10:59:25,050 INFO L226 Difference]: Without dead ends: 53365 [2025-03-03 10:59:25,080 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,081 INFO L435 NwaCegarLoop]: 189 mSDtfsCounter, 426 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 1229 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 426 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 1443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 1229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:25,081 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [426 Valid, 238 Invalid, 1443 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 1229 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:59:25,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53365 states. [2025-03-03 10:59:25,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53365 to 51643. [2025-03-03 10:59:25,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51643 states, 51642 states have (on average 1.093625343712482) internal successors, (56477), 51642 states have internal predecessors, (56477), 0 states have call successors, (0), 0 states 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,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51643 states to 51643 states and 56477 transitions. [2025-03-03 10:59:25,514 INFO L78 Accepts]: Start accepts. Automaton has 51643 states and 56477 transitions. Word has length 479 [2025-03-03 10:59:25,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:25,514 INFO L471 AbstractCegarLoop]: Abstraction has 51643 states and 56477 transitions. [2025-03-03 10:59:25,514 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.66666666666667) internal successors, (365), 3 states have internal predecessors, (365), 0 states have call successors, (0), 0 states 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,514 INFO L276 IsEmpty]: Start isEmpty. Operand 51643 states and 56477 transitions. [2025-03-03 10:59:25,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-03 10:59:25,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:25,586 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:59:25,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-03 10:59:25,586 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:25,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:25,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1495344354, now seen corresponding path program 1 times [2025-03-03 10:59:25,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:25,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211660031] [2025-03-03 10:59:25,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:25,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:25,613 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-03 10:59:25,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-03 10:59:25,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:25,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:25,735 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2025-03-03 10:59:25,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:25,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211660031] [2025-03-03 10:59:25,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211660031] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:25,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:25,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:25,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949582447] [2025-03-03 10:59:25,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:25,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:25,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:25,737 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:25,737 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:25,737 INFO L87 Difference]: Start difference. First operand 51643 states and 56477 transitions. Second operand has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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:27,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:27,082 INFO L93 Difference]: Finished difference Result 124560 states and 136224 transitions. [2025-03-03 10:59:27,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:27,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 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:27,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:27,162 INFO L225 Difference]: With dead ends: 124560 [2025-03-03 10:59:27,163 INFO L226 Difference]: Without dead ends: 72919 [2025-03-03 10:59:27,201 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:27,201 INFO L435 NwaCegarLoop]: 219 mSDtfsCounter, 472 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 204 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 472 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 1449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 204 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:27,201 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [472 Valid, 259 Invalid, 1449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [204 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-03-03 10:59:27,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72919 states. [2025-03-03 10:59:27,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72919 to 68641. [2025-03-03 10:59:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68641 states, 68640 states have (on average 1.090777972027972) internal successors, (74871), 68640 states have internal predecessors, (74871), 0 states have call successors, (0), 0 states 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:27,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68641 states to 68641 states and 74871 transitions. [2025-03-03 10:59:27,944 INFO L78 Accepts]: Start accepts. Automaton has 68641 states and 74871 transitions. Word has length 479 [2025-03-03 10:59:27,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:27,945 INFO L471 AbstractCegarLoop]: Abstraction has 68641 states and 74871 transitions. [2025-03-03 10:59:27,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 67.0) internal successors, (201), 3 states have internal predecessors, (201), 0 states have call successors, (0), 0 states 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:27,945 INFO L276 IsEmpty]: Start isEmpty. Operand 68641 states and 74871 transitions. [2025-03-03 10:59:27,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-03-03 10:59:27,950 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:27,950 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-03-03 10:59:27,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-03 10:59:27,950 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:27,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:27,951 INFO L85 PathProgramCache]: Analyzing trace with hash -1036872873, now seen corresponding path program 1 times [2025-03-03 10:59:27,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:27,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523925189] [2025-03-03 10:59:27,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:27,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:27,976 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-03-03 10:59:27,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-03-03 10:59:27,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:27,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:28,156 INFO L134 CoverageAnalysis]: Checked inductivity of 645 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 229 trivial. 0 not checked. [2025-03-03 10:59:28,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:28,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523925189] [2025-03-03 10:59:28,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523925189] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:28,156 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 10:59:28,156 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 10:59:28,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137735069] [2025-03-03 10:59:28,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:28,156 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:28,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:28,157 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:28,157 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 10:59:28,157 INFO L87 Difference]: Start difference. First operand 68641 states and 74871 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:29,505 INFO L93 Difference]: Finished difference Result 152185 states and 165812 transitions. [2025-03-03 10:59:29,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 10:59:29,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 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:29,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:29,599 INFO L225 Difference]: With dead ends: 152185 [2025-03-03 10:59:29,599 INFO L226 Difference]: Without dead ends: 83118 [2025-03-03 10:59:29,642 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:29,642 INFO L435 NwaCegarLoop]: 731 mSDtfsCounter, 291 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1281 mSolverCounterSat, 144 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 291 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 1425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 144 IncrementalHoareTripleChecker+Valid, 1281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:29,643 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [291 Valid, 782 Invalid, 1425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [144 Valid, 1281 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-03 10:59:29,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83118 states. [2025-03-03 10:59:30,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83118 to 81402. [2025-03-03 10:59:30,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81402 states, 81401 states have (on average 1.0821980073954864) internal successors, (88092), 81401 states have internal predecessors, (88092), 0 states have call successors, (0), 0 states 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,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81402 states to 81402 states and 88092 transitions. [2025-03-03 10:59:30,701 INFO L78 Accepts]: Start accepts. Automaton has 81402 states and 88092 transitions. Word has length 479 [2025-03-03 10:59:30,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:30,702 INFO L471 AbstractCegarLoop]: Abstraction has 81402 states and 88092 transitions. [2025-03-03 10:59:30,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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,702 INFO L276 IsEmpty]: Start isEmpty. Operand 81402 states and 88092 transitions. [2025-03-03 10:59:30,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-03-03 10:59:30,712 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:30,712 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-03-03 10:59:30,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-03-03 10:59:30,713 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:30,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash -1944768791, now seen corresponding path program 1 times [2025-03-03 10:59:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:30,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079458611] [2025-03-03 10:59:30,713 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:30,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:30,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 10:59:30,798 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 10:59:30,798 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:30,798 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:31,693 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 336 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-03 10:59:31,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:31,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079458611] [2025-03-03 10:59:31,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079458611] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:31,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875128785] [2025-03-03 10:59:31,693 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:31,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:31,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:59:31,696 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:31,698 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:31,762 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-03-03 10:59:31,848 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-03-03 10:59:31,849 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:31,849 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:31,852 INFO L256 TraceCheckSpWp]: Trace formula consists of 657 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-03 10:59:31,870 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:59:32,273 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 254 proven. 82 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 10:59:32,273 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 10:59:33,070 INFO L134 CoverageAnalysis]: Checked inductivity of 370 backedges. 254 proven. 82 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 10:59:33,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875128785] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 10:59:33,071 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 10:59:33,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2025-03-03 10:59:33,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321977732] [2025-03-03 10:59:33,071 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 10:59:33,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 10:59:33,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:33,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 10:59:33,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 10:59:33,075 INFO L87 Difference]: Start difference. First operand 81402 states and 88092 transitions. Second operand has 9 states, 9 states have (on average 134.33333333333334) internal successors, (1209), 9 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states 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,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 10:59:42,826 INFO L93 Difference]: Finished difference Result 230143 states and 249508 transitions. [2025-03-03 10:59:42,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-03 10:59:42,826 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 134.33333333333334) internal successors, (1209), 9 states have internal predecessors, (1209), 0 states have call successors, (0), 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 527 [2025-03-03 10:59:42,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 10:59:42,976 INFO L225 Difference]: With dead ends: 230143 [2025-03-03 10:59:42,977 INFO L226 Difference]: Without dead ends: 148317 [2025-03-03 10:59:43,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1083 GetRequests, 1063 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=319, Unknown=0, NotChecked=0, Total=462 [2025-03-03 10:59:43,002 INFO L435 NwaCegarLoop]: 93 mSDtfsCounter, 7324 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 12062 mSolverCounterSat, 2453 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7324 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 14515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2453 IncrementalHoareTripleChecker+Valid, 12062 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2025-03-03 10:59:43,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7324 Valid, 387 Invalid, 14515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2453 Valid, 12062 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2025-03-03 10:59:43,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148317 states. [2025-03-03 10:59:44,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148317 to 100132. [2025-03-03 10:59:44,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100132 states, 100131 states have (on average 1.0837403002067292) internal successors, (108516), 100131 states have internal predecessors, (108516), 0 states have call successors, (0), 0 states 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:44,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100132 states to 100132 states and 108516 transitions. [2025-03-03 10:59:44,158 INFO L78 Accepts]: Start accepts. Automaton has 100132 states and 108516 transitions. Word has length 527 [2025-03-03 10:59:44,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 10:59:44,159 INFO L471 AbstractCegarLoop]: Abstraction has 100132 states and 108516 transitions. [2025-03-03 10:59:44,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 134.33333333333334) internal successors, (1209), 9 states have internal predecessors, (1209), 0 states have call successors, (0), 0 states 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:44,159 INFO L276 IsEmpty]: Start isEmpty. Operand 100132 states and 108516 transitions. [2025-03-03 10:59:44,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-03 10:59:44,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 10:59:44,167 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 10:59:44,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-03 10:59:44,367 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:44,367 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 10:59:44,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 10:59:44,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1699836296, now seen corresponding path program 1 times [2025-03-03 10:59:44,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 10:59:44,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872020305] [2025-03-03 10:59:44,368 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 10:59:44,401 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-03 10:59:44,422 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-03 10:59:44,422 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:44,422 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:44,967 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 613 proven. 141 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-03 10:59:44,967 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 10:59:44,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872020305] [2025-03-03 10:59:44,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872020305] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 10:59:44,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489876893] [2025-03-03 10:59:44,967 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 10:59:44,967 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 10:59:44,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 10:59:44,969 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:44,971 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:45,029 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-03 10:59:45,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-03 10:59:45,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 10:59:45,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 10:59:45,107 INFO L256 TraceCheckSpWp]: Trace formula consists of 693 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-03 10:59:45,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 10:59:45,915 INFO L134 CoverageAnalysis]: Checked inductivity of 788 backedges. 135 proven. 0 refuted. 0 times theorem prover too weak. 653 trivial. 0 not checked. [2025-03-03 10:59:45,915 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 10:59:45,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489876893] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 10:59:45,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 10:59:45,916 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2025-03-03 10:59:45,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995212340] [2025-03-03 10:59:45,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 10:59:45,916 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 10:59:45,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 10:59:45,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 10:59:45,916 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 10:59:45,916 INFO L87 Difference]: Start difference. First operand 100132 states and 108516 transitions. Second operand has 3 states, 3 states have (on average 63.333333333333336) internal successors, (190), 3 states have internal predecessors, (190), 0 states have call successors, (0), 0 states 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,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 10:59:55,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:00:00,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:00:04,410 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:00:08,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2025-03-03 11:00:12,831 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [0]