./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem16_label20.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 10843b53b0c8d626e0b45edf6995c892da25187fbdbb4d013770994aea6c76bb --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 00:06:43,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 00:06:43,889 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 00:06:43,895 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 00:06:43,896 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 00:06:43,911 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 00:06:43,911 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 00:06:43,911 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 00:06:43,911 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 00:06:43,911 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 00:06:43,911 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 00:06:43,912 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 00:06:43,912 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 00:06:43,912 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 00:06:43,912 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 00:06:43,912 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 00:06:43,912 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 00:06:43,912 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 00:06:43,912 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 00:06:43,912 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 00:06:43,913 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 00:06:43,913 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 00:06:43,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 00:06:43,913 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 00:06:43,913 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 00:06:43,913 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 00:06:43,913 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 00:06:43,913 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 00:06:43,913 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 00:06:43,913 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:06:43,913 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:06:43,913 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:06:43,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:06:43,914 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 00:06:43,914 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 00:06:43,914 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 00:06:43,914 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 00:06:43,914 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:06:43,914 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 00:06:43,914 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 00:06:43,914 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 00:06:43,914 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 00:06:43,914 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 00:06:43,915 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 00:06:43,915 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 00:06:43,915 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 00:06:43,915 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 00:06:43,915 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 00:06:43,915 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-jdk21/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 -> 10843b53b0c8d626e0b45edf6995c892da25187fbdbb4d013770994aea6c76bb [2025-01-09 00:06:44,109 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 00:06:44,122 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 00:06:44,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 00:06:44,125 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 00:06:44,125 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 00:06:44,126 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label20.c [2025-01-09 00:06:45,361 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/779509c8e/b9714d86312b4adf9379b2c39e6fbde0/FLAG94447da52 [2025-01-09 00:06:45,726 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 00:06:45,727 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label20.c [2025-01-09 00:06:45,742 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/779509c8e/b9714d86312b4adf9379b2c39e6fbde0/FLAG94447da52 [2025-01-09 00:06:45,969 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/779509c8e/b9714d86312b4adf9379b2c39e6fbde0 [2025-01-09 00:06:45,971 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 00:06:45,975 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 00:06:45,980 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 00:06:45,980 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 00:06:45,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 00:06:45,989 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:06:45" (1/1) ... [2025-01-09 00:06:45,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a1b8949 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:45, skipping insertion in model container [2025-01-09 00:06:45,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:06:45" (1/1) ... [2025-01-09 00:06:46,053 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 00:06:46,215 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label20.c[2717,2730] [2025-01-09 00:06:46,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:06:46,479 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 00:06:46,492 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label20.c[2717,2730] [2025-01-09 00:06:46,603 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 00:06:46,615 INFO L204 MainTranslator]: Completed translation [2025-01-09 00:06:46,617 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46 WrapperNode [2025-01-09 00:06:46,617 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 00:06:46,618 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 00:06:46,618 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 00:06:46,619 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 00:06:46,623 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,649 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,749 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1767 [2025-01-09 00:06:46,749 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 00:06:46,750 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 00:06:46,750 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 00:06:46,750 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 00:06:46,757 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,757 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,783 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,881 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-01-09 00:06:46,882 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,882 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,921 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,929 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,938 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 00:06:46,962 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 00:06:46,962 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 00:06:46,962 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 00:06:46,967 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (1/1) ... [2025-01-09 00:06:46,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 00:06:46,990 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:06:47,017 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 00:06:47,027 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 00:06:47,045 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 00:06:47,045 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 00:06:47,045 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 00:06:47,046 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 00:06:47,100 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 00:06:47,102 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 00:06:48,800 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2025-01-09 00:06:48,801 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 00:06:48,814 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 00:06:48,814 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 00:06:48,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:06:48 BoogieIcfgContainer [2025-01-09 00:06:48,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 00:06:48,816 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 00:06:48,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 00:06:48,823 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 00:06:48,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:06:45" (1/3) ... [2025-01-09 00:06:48,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2cd601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:06:48, skipping insertion in model container [2025-01-09 00:06:48,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:06:46" (2/3) ... [2025-01-09 00:06:48,824 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e2cd601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:06:48, skipping insertion in model container [2025-01-09 00:06:48,824 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:06:48" (3/3) ... [2025-01-09 00:06:48,825 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem16_label20.c [2025-01-09 00:06:48,836 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 00:06:48,837 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem16_label20.c that has 1 procedures, 396 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 00:06:48,916 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 00:06:48,933 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;@1fd06c4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 00:06:48,937 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 00:06:48,945 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:48,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-01-09 00:06:48,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:48,950 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] [2025-01-09 00:06:48,950 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:48,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:48,954 INFO L85 PathProgramCache]: Analyzing trace with hash -85339630, now seen corresponding path program 1 times [2025-01-09 00:06:48,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:48,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870697276] [2025-01-09 00:06:48,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:48,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:49,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-01-09 00:06:49,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-01-09 00:06:49,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:49,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:49,187 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:06:49,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:49,187 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870697276] [2025-01-09 00:06:49,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870697276] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:49,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:49,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:06:49,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479494043] [2025-01-09 00:06:49,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:49,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:49,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:49,225 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:49,225 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:49,231 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.83248730964467) internal successors, (722), 395 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:50,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:50,878 INFO L93 Difference]: Finished difference Result 1122 states and 2100 transitions. [2025-01-09 00:06:50,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:50,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 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 24 [2025-01-09 00:06:50,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:50,890 INFO L225 Difference]: With dead ends: 1122 [2025-01-09 00:06:50,890 INFO L226 Difference]: Without dead ends: 662 [2025-01-09 00:06:50,893 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-01-09 00:06:50,895 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 336 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 336 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:50,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [336 Valid, 223 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:06:50,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2025-01-09 00:06:50,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2025-01-09 00:06:50,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5824508320726172) internal successors, (1046), 661 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:50,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1046 transitions. [2025-01-09 00:06:50,955 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1046 transitions. Word has length 24 [2025-01-09 00:06:50,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:50,955 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1046 transitions. [2025-01-09 00:06:50,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:50,956 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1046 transitions. [2025-01-09 00:06:50,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2025-01-09 00:06:50,958 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:50,958 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:06:50,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 00:06:50,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:50,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:50,959 INFO L85 PathProgramCache]: Analyzing trace with hash 2113654084, now seen corresponding path program 1 times [2025-01-09 00:06:50,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:50,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [5584173] [2025-01-09 00:06:50,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:50,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:50,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 95 statements into 1 equivalence classes. [2025-01-09 00:06:50,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 95 of 95 statements. [2025-01-09 00:06:50,995 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:50,995 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:06:51,121 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:51,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [5584173] [2025-01-09 00:06:51,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [5584173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:51,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:51,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:06:51,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380594238] [2025-01-09 00:06:51,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:51,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:51,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:51,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:51,123 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:51,123 INFO L87 Difference]: Start difference. First operand 662 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:52,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:52,293 INFO L93 Difference]: Finished difference Result 1651 states and 2539 transitions. [2025-01-09 00:06:52,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:52,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 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 95 [2025-01-09 00:06:52,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:52,297 INFO L225 Difference]: With dead ends: 1651 [2025-01-09 00:06:52,298 INFO L226 Difference]: Without dead ends: 991 [2025-01-09 00:06:52,299 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-01-09 00:06:52,300 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 338 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:52,300 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 77 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:06:52,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2025-01-09 00:06:52,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2025-01-09 00:06:52,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.3767676767676769) internal successors, (1363), 990 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:52,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1363 transitions. [2025-01-09 00:06:52,348 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1363 transitions. Word has length 95 [2025-01-09 00:06:52,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:52,348 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1363 transitions. [2025-01-09 00:06:52,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:52,348 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1363 transitions. [2025-01-09 00:06:52,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2025-01-09 00:06:52,349 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:52,350 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:06:52,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 00:06:52,350 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:52,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:52,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1968243554, now seen corresponding path program 1 times [2025-01-09 00:06:52,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:52,354 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986896440] [2025-01-09 00:06:52,355 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:52,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:52,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 96 statements into 1 equivalence classes. [2025-01-09 00:06:52,395 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 96 of 96 statements. [2025-01-09 00:06:52,395 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:52,395 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:52,603 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:06:52,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:52,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986896440] [2025-01-09 00:06:52,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986896440] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:52,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:52,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:06:52,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856189991] [2025-01-09 00:06:52,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:52,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:52,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:52,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:52,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:52,609 INFO L87 Difference]: Start difference. First operand 991 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:54,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:54,261 INFO L93 Difference]: Finished difference Result 2969 states and 4085 transitions. [2025-01-09 00:06:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:54,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96 [2025-01-09 00:06:54,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:54,274 INFO L225 Difference]: With dead ends: 2969 [2025-01-09 00:06:54,275 INFO L226 Difference]: Without dead ends: 1980 [2025-01-09 00:06:54,276 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-01-09 00:06:54,277 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 278 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 383 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 383 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:54,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 78 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [383 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-01-09 00:06:54,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1980 states. [2025-01-09 00:06:54,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1980 to 1978. [2025-01-09 00:06:54,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1977 states have (on average 1.3318158826504805) internal successors, (2633), 1977 states have internal predecessors, (2633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:54,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2633 transitions. [2025-01-09 00:06:54,319 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2633 transitions. Word has length 96 [2025-01-09 00:06:54,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:54,319 INFO L471 AbstractCegarLoop]: Abstraction has 1978 states and 2633 transitions. [2025-01-09 00:06:54,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:54,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2633 transitions. [2025-01-09 00:06:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2025-01-09 00:06:54,320 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:54,321 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:06:54,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 00:06:54,321 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:54,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:54,321 INFO L85 PathProgramCache]: Analyzing trace with hash 343526940, now seen corresponding path program 1 times [2025-01-09 00:06:54,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:54,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130937593] [2025-01-09 00:06:54,322 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:54,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:54,331 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 111 statements into 1 equivalence classes. [2025-01-09 00:06:54,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 111 of 111 statements. [2025-01-09 00:06:54,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:54,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:54,414 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 00:06:54,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:54,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130937593] [2025-01-09 00:06:54,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130937593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:54,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:54,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:54,419 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837279624] [2025-01-09 00:06:54,419 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:54,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:54,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:54,419 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:54,419 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:54,419 INFO L87 Difference]: Start difference. First operand 1978 states and 2633 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:55,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:55,663 INFO L93 Difference]: Finished difference Result 4612 states and 6278 transitions. [2025-01-09 00:06:55,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:55,663 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2025-01-09 00:06:55,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:55,671 INFO L225 Difference]: With dead ends: 4612 [2025-01-09 00:06:55,671 INFO L226 Difference]: Without dead ends: 2636 [2025-01-09 00:06:55,673 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-01-09 00:06:55,673 INFO L435 NwaCegarLoop]: 533 mSDtfsCounter, 360 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:55,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 539 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-01-09 00:06:55,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2025-01-09 00:06:55,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2025-01-09 00:06:55,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.2922201138519924) internal successors, (3405), 2635 states have internal predecessors, (3405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:55,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3405 transitions. [2025-01-09 00:06:55,703 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3405 transitions. Word has length 111 [2025-01-09 00:06:55,703 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:55,703 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3405 transitions. [2025-01-09 00:06:55,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:55,704 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3405 transitions. [2025-01-09 00:06:55,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2025-01-09 00:06:55,705 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:55,706 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:06:55,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 00:06:55,706 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:55,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:55,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1116959593, now seen corresponding path program 1 times [2025-01-09 00:06:55,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:55,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535233603] [2025-01-09 00:06:55,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:55,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:55,729 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 217 statements into 1 equivalence classes. [2025-01-09 00:06:55,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 217 of 217 statements. [2025-01-09 00:06:55,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:55,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:55,891 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 86 trivial. 0 not checked. [2025-01-09 00:06:55,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:55,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535233603] [2025-01-09 00:06:55,893 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535233603] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:55,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:55,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:06:55,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564360356] [2025-01-09 00:06:55,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:55,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:55,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:55,894 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:55,894 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:55,894 INFO L87 Difference]: Start difference. First operand 2636 states and 3405 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:57,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:57,014 INFO L93 Difference]: Finished difference Result 6586 states and 8594 transitions. [2025-01-09 00:06:57,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:57,014 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 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 217 [2025-01-09 00:06:57,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:57,023 INFO L225 Difference]: With dead ends: 6586 [2025-01-09 00:06:57,023 INFO L226 Difference]: Without dead ends: 3294 [2025-01-09 00:06:57,026 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-01-09 00:06:57,026 INFO L435 NwaCegarLoop]: 152 mSDtfsCounter, 339 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 339 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:57,027 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [339 Valid, 156 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:06:57,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2025-01-09 00:06:57,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3294. [2025-01-09 00:06:57,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.0853325235347708) internal successors, (3574), 3293 states have internal predecessors, (3574), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:57,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 3574 transitions. [2025-01-09 00:06:57,066 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 3574 transitions. Word has length 217 [2025-01-09 00:06:57,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:57,067 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 3574 transitions. [2025-01-09 00:06:57,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:57,067 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 3574 transitions. [2025-01-09 00:06:57,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 367 [2025-01-09 00:06:57,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:57,070 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:06:57,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 00:06:57,070 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:57,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:57,071 INFO L85 PathProgramCache]: Analyzing trace with hash -36743376, now seen corresponding path program 1 times [2025-01-09 00:06:57,071 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:57,071 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009607134] [2025-01-09 00:06:57,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:57,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:57,095 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 366 statements into 1 equivalence classes. [2025-01-09 00:06:57,104 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 366 of 366 statements. [2025-01-09 00:06:57,104 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:57,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:57,763 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 236 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-01-09 00:06:57,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:57,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009607134] [2025-01-09 00:06:57,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2009607134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:57,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:57,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 00:06:57,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [234536106] [2025-01-09 00:06:57,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:57,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:57,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:57,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:57,764 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:57,764 INFO L87 Difference]: Start difference. First operand 3294 states and 3574 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:58,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:06:58,844 INFO L93 Difference]: Finished difference Result 6915 states and 7486 transitions. [2025-01-09 00:06:58,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:06:58,844 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 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 366 [2025-01-09 00:06:58,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:06:58,853 INFO L225 Difference]: With dead ends: 6915 [2025-01-09 00:06:58,853 INFO L226 Difference]: Without dead ends: 3623 [2025-01-09 00:06:58,856 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-01-09 00:06:58,856 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 206 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 206 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-01-09 00:06:58,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [206 Valid, 108 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-01-09 00:06:58,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3623 states. [2025-01-09 00:06:58,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3623 to 3623. [2025-01-09 00:06:58,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3623 states, 3622 states have (on average 1.0781336278299283) internal successors, (3905), 3622 states have internal predecessors, (3905), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:58,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3623 states to 3623 states and 3905 transitions. [2025-01-09 00:06:58,892 INFO L78 Accepts]: Start accepts. Automaton has 3623 states and 3905 transitions. Word has length 366 [2025-01-09 00:06:58,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:06:58,892 INFO L471 AbstractCegarLoop]: Abstraction has 3623 states and 3905 transitions. [2025-01-09 00:06:58,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 2 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:06:58,893 INFO L276 IsEmpty]: Start isEmpty. Operand 3623 states and 3905 transitions. [2025-01-09 00:06:58,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 602 [2025-01-09 00:06:58,899 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:06:58,900 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:06:58,901 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 00:06:58,901 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:06:58,901 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:06:58,901 INFO L85 PathProgramCache]: Analyzing trace with hash 435142920, now seen corresponding path program 1 times [2025-01-09 00:06:58,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:06:58,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116230843] [2025-01-09 00:06:58,902 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:06:58,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:06:58,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 601 statements into 1 equivalence classes. [2025-01-09 00:06:59,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 601 of 601 statements. [2025-01-09 00:06:59,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:06:59,008 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:06:59,352 INFO L134 CoverageAnalysis]: Checked inductivity of 749 backedges. 603 proven. 0 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2025-01-09 00:06:59,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:06:59,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116230843] [2025-01-09 00:06:59,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116230843] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:06:59,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:06:59,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:06:59,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [166418504] [2025-01-09 00:06:59,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:06:59,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:06:59,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:06:59,354 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:06:59,354 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:06:59,354 INFO L87 Difference]: Start difference. First operand 3623 states and 3905 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:00,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:00,335 INFO L93 Difference]: Finished difference Result 9876 states and 10708 transitions. [2025-01-09 00:07:00,336 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:00,336 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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 601 [2025-01-09 00:07:00,337 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:00,352 INFO L225 Difference]: With dead ends: 9876 [2025-01-09 00:07:00,352 INFO L226 Difference]: Without dead ends: 6584 [2025-01-09 00:07:00,356 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-01-09 00:07:00,357 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:00,357 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 429 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 00:07:00,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6584 states. [2025-01-09 00:07:00,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6584 to 6255. [2025-01-09 00:07:00,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.0532459226095299) internal successors, (6587), 6254 states have internal predecessors, (6587), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:00,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6587 transitions. [2025-01-09 00:07:00,442 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6587 transitions. Word has length 601 [2025-01-09 00:07:00,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:00,444 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6587 transitions. [2025-01-09 00:07:00,444 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:00,445 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6587 transitions. [2025-01-09 00:07:00,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 665 [2025-01-09 00:07:00,458 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:00,458 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:00,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 00:07:00,458 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:00,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:00,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1568521039, now seen corresponding path program 1 times [2025-01-09 00:07:00,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:00,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683497927] [2025-01-09 00:07:00,460 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:00,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:00,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 664 statements into 1 equivalence classes. [2025-01-09 00:07:00,523 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 664 of 664 statements. [2025-01-09 00:07:00,523 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:00,523 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:01,199 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 691 proven. 0 refuted. 0 times theorem prover too weak. 150 trivial. 0 not checked. [2025-01-09 00:07:01,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:01,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683497927] [2025-01-09 00:07:01,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683497927] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:01,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:01,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:01,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864015111] [2025-01-09 00:07:01,200 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:01,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:01,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:01,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:01,207 INFO L87 Difference]: Start difference. First operand 6255 states and 6587 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:02,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:02,339 INFO L93 Difference]: Finished difference Result 15140 states and 16058 transitions. [2025-01-09 00:07:02,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:02,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 664 [2025-01-09 00:07:02,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:02,380 INFO L225 Difference]: With dead ends: 15140 [2025-01-09 00:07:02,380 INFO L226 Difference]: Without dead ends: 9216 [2025-01-09 00:07:02,391 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-01-09 00:07:02,392 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 172 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:02,393 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 428 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:07:02,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2025-01-09 00:07:02,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8229. [2025-01-09 00:07:02,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.048371414681575) internal successors, (8626), 8228 states have internal predecessors, (8626), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:02,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8626 transitions. [2025-01-09 00:07:02,531 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8626 transitions. Word has length 664 [2025-01-09 00:07:02,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:02,532 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8626 transitions. [2025-01-09 00:07:02,532 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:02,532 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8626 transitions. [2025-01-09 00:07:02,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2025-01-09 00:07:02,543 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:02,543 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:02,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 00:07:02,544 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:02,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:02,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1976757420, now seen corresponding path program 1 times [2025-01-09 00:07:02,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:02,544 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907828183] [2025-01-09 00:07:02,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:02,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:02,605 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-01-09 00:07:02,649 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-01-09 00:07:02,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:02,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:03,722 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 256 proven. 440 refuted. 0 times theorem prover too weak. 147 trivial. 0 not checked. [2025-01-09 00:07:03,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:03,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907828183] [2025-01-09 00:07:03,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907828183] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:07:03,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329796033] [2025-01-09 00:07:03,724 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:03,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:07:03,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:07:03,731 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:07:03,734 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 00:07:03,826 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 689 statements into 1 equivalence classes. [2025-01-09 00:07:03,952 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 689 of 689 statements. [2025-01-09 00:07:03,952 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:03,953 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:03,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 834 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:07:03,973 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:07:04,292 INFO L134 CoverageAnalysis]: Checked inductivity of 843 backedges. 382 proven. 0 refuted. 0 times theorem prover too weak. 461 trivial. 0 not checked. [2025-01-09 00:07:04,292 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:07:04,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329796033] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:04,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:07:04,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2025-01-09 00:07:04,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376957527] [2025-01-09 00:07:04,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:04,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:04,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:04,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:04,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:07:04,299 INFO L87 Difference]: Start difference. First operand 8229 states and 8626 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:05,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:05,500 INFO L93 Difference]: Finished difference Result 16127 states and 16919 transitions. [2025-01-09 00:07:05,501 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:05,501 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 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 689 [2025-01-09 00:07:05,502 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:05,518 INFO L225 Difference]: With dead ends: 16127 [2025-01-09 00:07:05,518 INFO L226 Difference]: Without dead ends: 8229 [2025-01-09 00:07:05,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 693 GetRequests, 689 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 00:07:05,526 INFO L435 NwaCegarLoop]: 371 mSDtfsCounter, 258 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:05,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 00:07:05,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8229 states. [2025-01-09 00:07:05,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8229 to 8229. [2025-01-09 00:07:05,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8229 states, 8228 states have (on average 1.0430238210986873) internal successors, (8582), 8228 states have internal predecessors, (8582), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:05,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8229 states to 8229 states and 8582 transitions. [2025-01-09 00:07:05,625 INFO L78 Accepts]: Start accepts. Automaton has 8229 states and 8582 transitions. Word has length 689 [2025-01-09 00:07:05,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:05,626 INFO L471 AbstractCegarLoop]: Abstraction has 8229 states and 8582 transitions. [2025-01-09 00:07:05,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:05,627 INFO L276 IsEmpty]: Start isEmpty. Operand 8229 states and 8582 transitions. [2025-01-09 00:07:05,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 778 [2025-01-09 00:07:05,638 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:05,638 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:07:05,647 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 00:07:05,839 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:07:05,839 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:05,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:05,844 INFO L85 PathProgramCache]: Analyzing trace with hash 799498196, now seen corresponding path program 1 times [2025-01-09 00:07:05,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:05,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73509024] [2025-01-09 00:07:05,844 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:05,844 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:05,936 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 777 statements into 1 equivalence classes. [2025-01-09 00:07:05,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 777 of 777 statements. [2025-01-09 00:07:05,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:05,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:06,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1216 backedges. 460 proven. 0 refuted. 0 times theorem prover too weak. 756 trivial. 0 not checked. [2025-01-09 00:07:06,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:06,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73509024] [2025-01-09 00:07:06,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [73509024] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:06,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:06,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:06,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073674725] [2025-01-09 00:07:06,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:06,443 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:06,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:06,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:06,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:06,444 INFO L87 Difference]: Start difference. First operand 8229 states and 8582 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:07,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:07,223 INFO L93 Difference]: Finished difference Result 18759 states and 19694 transitions. [2025-01-09 00:07:07,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:07,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 777 [2025-01-09 00:07:07,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:07,238 INFO L225 Difference]: With dead ends: 18759 [2025-01-09 00:07:07,238 INFO L226 Difference]: Without dead ends: 10861 [2025-01-09 00:07:07,244 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-01-09 00:07:07,245 INFO L435 NwaCegarLoop]: 75 mSDtfsCounter, 252 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 252 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 845 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:07,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [252 Valid, 79 Invalid, 845 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:07:07,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10861 states. [2025-01-09 00:07:07,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10861 to 10861. [2025-01-09 00:07:07,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.0404235727440148) internal successors, (11299), 10860 states have internal predecessors, (11299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11299 transitions. [2025-01-09 00:07:07,329 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11299 transitions. Word has length 777 [2025-01-09 00:07:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:07,330 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 11299 transitions. [2025-01-09 00:07:07,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:07,330 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11299 transitions. [2025-01-09 00:07:07,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1212 [2025-01-09 00:07:07,346 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:07,347 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:07,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 00:07:07,347 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:07,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:07,348 INFO L85 PathProgramCache]: Analyzing trace with hash 115556682, now seen corresponding path program 1 times [2025-01-09 00:07:07,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:07,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188589405] [2025-01-09 00:07:07,348 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:07,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:07,447 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1211 statements into 1 equivalence classes. [2025-01-09 00:07:07,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1211 of 1211 statements. [2025-01-09 00:07:07,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:07,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:07,874 INFO L134 CoverageAnalysis]: Checked inductivity of 2755 backedges. 1935 proven. 0 refuted. 0 times theorem prover too weak. 820 trivial. 0 not checked. [2025-01-09 00:07:07,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:07,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188589405] [2025-01-09 00:07:07,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1188589405] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:07,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:07,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:07,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [565203781] [2025-01-09 00:07:07,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:07,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:07,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:07,876 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:07,876 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:07,876 INFO L87 Difference]: Start difference. First operand 10861 states and 11299 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:08,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:08,642 INFO L93 Difference]: Finished difference Result 24352 states and 25468 transitions. [2025-01-09 00:07:08,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:08,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 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 1211 [2025-01-09 00:07:08,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:08,663 INFO L225 Difference]: With dead ends: 24352 [2025-01-09 00:07:08,663 INFO L226 Difference]: Without dead ends: 13822 [2025-01-09 00:07:08,674 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-01-09 00:07:08,675 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:08,675 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 433 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:07:08,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2025-01-09 00:07:08,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 12835. [2025-01-09 00:07:08,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12835 states, 12834 states have (on average 1.0363877201184355) internal successors, (13301), 12834 states have internal predecessors, (13301), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:08,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12835 states to 12835 states and 13301 transitions. [2025-01-09 00:07:08,782 INFO L78 Accepts]: Start accepts. Automaton has 12835 states and 13301 transitions. Word has length 1211 [2025-01-09 00:07:08,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:08,783 INFO L471 AbstractCegarLoop]: Abstraction has 12835 states and 13301 transitions. [2025-01-09 00:07:08,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:08,784 INFO L276 IsEmpty]: Start isEmpty. Operand 12835 states and 13301 transitions. [2025-01-09 00:07:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1213 [2025-01-09 00:07:08,799 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:08,800 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:08,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 00:07:08,801 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:08,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:08,803 INFO L85 PathProgramCache]: Analyzing trace with hash -1758698018, now seen corresponding path program 1 times [2025-01-09 00:07:08,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:08,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [358838593] [2025-01-09 00:07:08,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:08,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:08,859 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1212 statements into 1 equivalence classes. [2025-01-09 00:07:08,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1212 of 1212 statements. [2025-01-09 00:07:08,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:08,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:09,303 INFO L134 CoverageAnalysis]: Checked inductivity of 2761 backedges. 948 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2025-01-09 00:07:09,303 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:09,303 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [358838593] [2025-01-09 00:07:09,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [358838593] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:09,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:09,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:09,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999010749] [2025-01-09 00:07:09,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:09,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:09,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:09,304 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:09,304 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:09,304 INFO L87 Difference]: Start difference. First operand 12835 states and 13301 transitions. Second operand has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:09,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:09,989 INFO L93 Difference]: Finished difference Result 27642 states and 28662 transitions. [2025-01-09 00:07:09,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:09,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1212 [2025-01-09 00:07:09,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:10,006 INFO L225 Difference]: With dead ends: 27642 [2025-01-09 00:07:10,006 INFO L226 Difference]: Without dead ends: 14151 [2025-01-09 00:07:10,018 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:10,019 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 172 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 410 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:10,019 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 410 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:07:10,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2025-01-09 00:07:10,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 11848. [2025-01-09 00:07:10,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0297121634168989) internal successors, (12199), 11847 states have internal predecessors, (12199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:10,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12199 transitions. [2025-01-09 00:07:10,160 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12199 transitions. Word has length 1212 [2025-01-09 00:07:10,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:10,161 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12199 transitions. [2025-01-09 00:07:10,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.0) internal successors, (447), 3 states have internal predecessors, (447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:10,161 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12199 transitions. [2025-01-09 00:07:10,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1289 [2025-01-09 00:07:10,186 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:10,187 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:07:10,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 00:07:10,187 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:10,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:10,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1887481693, now seen corresponding path program 1 times [2025-01-09 00:07:10,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:10,188 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527249899] [2025-01-09 00:07:10,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:10,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:10,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1288 statements into 1 equivalence classes. [2025-01-09 00:07:10,327 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1288 of 1288 statements. [2025-01-09 00:07:10,328 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:10,328 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:10,799 INFO L134 CoverageAnalysis]: Checked inductivity of 2776 backedges. 1987 proven. 0 refuted. 0 times theorem prover too weak. 789 trivial. 0 not checked. [2025-01-09 00:07:10,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:10,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527249899] [2025-01-09 00:07:10,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527249899] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:10,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:10,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:10,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [340694467] [2025-01-09 00:07:10,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:10,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:10,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:10,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:10,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:10,802 INFO L87 Difference]: Start difference. First operand 11848 states and 12199 transitions. Second operand has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:11,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:11,686 INFO L93 Difference]: Finished difference Result 26984 states and 27815 transitions. [2025-01-09 00:07:11,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:11,687 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 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 1288 [2025-01-09 00:07:11,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:11,702 INFO L225 Difference]: With dead ends: 26984 [2025-01-09 00:07:11,703 INFO L226 Difference]: Without dead ends: 15138 [2025-01-09 00:07:11,712 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-01-09 00:07:11,713 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 800 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 854 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 800 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:11,713 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 431 Invalid, 854 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 800 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:07:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2025-01-09 00:07:11,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 14809. [2025-01-09 00:07:11,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14809 states, 14808 states have (on average 1.0280929227444624) internal successors, (15224), 14808 states have internal predecessors, (15224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:11,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14809 states to 14809 states and 15224 transitions. [2025-01-09 00:07:11,826 INFO L78 Accepts]: Start accepts. Automaton has 14809 states and 15224 transitions. Word has length 1288 [2025-01-09 00:07:11,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:11,827 INFO L471 AbstractCegarLoop]: Abstraction has 14809 states and 15224 transitions. [2025-01-09 00:07:11,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 239.66666666666666) internal successors, (719), 3 states have internal predecessors, (719), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:11,827 INFO L276 IsEmpty]: Start isEmpty. Operand 14809 states and 15224 transitions. [2025-01-09 00:07:11,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1314 [2025-01-09 00:07:11,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:11,857 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:07:11,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 00:07:11,857 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:11,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:11,858 INFO L85 PathProgramCache]: Analyzing trace with hash 1260235944, now seen corresponding path program 1 times [2025-01-09 00:07:11,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:11,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327134931] [2025-01-09 00:07:11,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:11,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:11,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1313 statements into 1 equivalence classes. [2025-01-09 00:07:12,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1313 of 1313 statements. [2025-01-09 00:07:12,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:12,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:13,252 INFO L134 CoverageAnalysis]: Checked inductivity of 2926 backedges. 1607 proven. 0 refuted. 0 times theorem prover too weak. 1319 trivial. 0 not checked. [2025-01-09 00:07:13,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:13,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327134931] [2025-01-09 00:07:13,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327134931] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:13,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:13,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:13,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797318910] [2025-01-09 00:07:13,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:13,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:13,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:13,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:13,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:13,255 INFO L87 Difference]: Start difference. First operand 14809 states and 15224 transitions. Second operand has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:13,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:13,855 INFO L93 Difference]: Finished difference Result 29945 states and 30784 transitions. [2025-01-09 00:07:13,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:13,855 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 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 1313 [2025-01-09 00:07:13,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:13,872 INFO L225 Difference]: With dead ends: 29945 [2025-01-09 00:07:13,872 INFO L226 Difference]: Without dead ends: 15467 [2025-01-09 00:07:13,882 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-01-09 00:07:13,883 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 756 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:13,883 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 434 Invalid, 756 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 00:07:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2025-01-09 00:07:13,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 15467. [2025-01-09 00:07:13,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.0272210009052114) internal successors, (15887), 15466 states have internal predecessors, (15887), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 15887 transitions. [2025-01-09 00:07:13,998 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 15887 transitions. Word has length 1313 [2025-01-09 00:07:13,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:13,998 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 15887 transitions. [2025-01-09 00:07:13,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 228.33333333333334) internal successors, (685), 3 states have internal predecessors, (685), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:13,999 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 15887 transitions. [2025-01-09 00:07:14,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1399 [2025-01-09 00:07:14,019 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:14,020 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:07:14,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-09 00:07:14,021 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:14,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:14,022 INFO L85 PathProgramCache]: Analyzing trace with hash 1891909565, now seen corresponding path program 1 times [2025-01-09 00:07:14,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:14,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989298354] [2025-01-09 00:07:14,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:14,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:14,091 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1398 statements into 1 equivalence classes. [2025-01-09 00:07:14,167 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1398 of 1398 statements. [2025-01-09 00:07:14,168 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:14,168 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:15,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3191 backedges. 2304 proven. 0 refuted. 0 times theorem prover too weak. 887 trivial. 0 not checked. [2025-01-09 00:07:15,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:15,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989298354] [2025-01-09 00:07:15,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989298354] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:15,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:15,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-01-09 00:07:15,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [120079456] [2025-01-09 00:07:15,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:15,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 00:07:15,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:15,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 00:07:15,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-01-09 00:07:15,836 INFO L87 Difference]: Start difference. First operand 15467 states and 15887 transitions. Second operand has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:17,413 INFO L93 Difference]: Finished difference Result 30604 states and 31442 transitions. [2025-01-09 00:07:17,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 00:07:17,413 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 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 1398 [2025-01-09 00:07:17,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:17,430 INFO L225 Difference]: With dead ends: 30604 [2025-01-09 00:07:17,430 INFO L226 Difference]: Without dead ends: 15468 [2025-01-09 00:07:17,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:07:17,441 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 427 mSDsluCounter, 461 mSDsCounter, 0 mSdLazyCounter, 3684 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 427 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 3695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 3684 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:17,441 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [427 Valid, 837 Invalid, 3695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 3684 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 00:07:17,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15468 states. [2025-01-09 00:07:17,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15468 to 15467. [2025-01-09 00:07:17,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.0268977111082374) internal successors, (15882), 15466 states have internal predecessors, (15882), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:17,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 15882 transitions. [2025-01-09 00:07:17,626 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 15882 transitions. Word has length 1398 [2025-01-09 00:07:17,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:17,626 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 15882 transitions. [2025-01-09 00:07:17,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 98.0) internal successors, (784), 8 states have internal predecessors, (784), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:17,627 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 15882 transitions. [2025-01-09 00:07:17,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1539 [2025-01-09 00:07:17,650 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:17,651 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:07:17,651 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-09 00:07:17,651 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:17,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:17,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1546202764, now seen corresponding path program 1 times [2025-01-09 00:07:17,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:17,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699701617] [2025-01-09 00:07:17,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:17,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:17,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1538 statements into 1 equivalence classes. [2025-01-09 00:07:17,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1538 of 1538 statements. [2025-01-09 00:07:17,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:17,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:18,788 INFO L134 CoverageAnalysis]: Checked inductivity of 4203 backedges. 2954 proven. 0 refuted. 0 times theorem prover too weak. 1249 trivial. 0 not checked. [2025-01-09 00:07:18,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:18,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699701617] [2025-01-09 00:07:18,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699701617] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:18,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:18,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:18,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67459323] [2025-01-09 00:07:18,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:18,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:18,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:18,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:18,790 INFO L87 Difference]: Start difference. First operand 15467 states and 15882 transitions. Second operand has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:19,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:19,420 INFO L93 Difference]: Finished difference Result 30603 states and 31431 transitions. [2025-01-09 00:07:19,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:19,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 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 1538 [2025-01-09 00:07:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:19,432 INFO L225 Difference]: With dead ends: 30603 [2025-01-09 00:07:19,433 INFO L226 Difference]: Without dead ends: 15467 [2025-01-09 00:07:19,441 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-01-09 00:07:19,442 INFO L435 NwaCegarLoop]: 423 mSDtfsCounter, 62 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:19,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 429 Invalid, 748 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:07:19,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15467 states. [2025-01-09 00:07:19,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15467 to 15467. [2025-01-09 00:07:19,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15467 states, 15466 states have (on average 1.0266390792706581) internal successors, (15878), 15466 states have internal predecessors, (15878), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15467 states to 15467 states and 15878 transitions. [2025-01-09 00:07:19,555 INFO L78 Accepts]: Start accepts. Automaton has 15467 states and 15878 transitions. Word has length 1538 [2025-01-09 00:07:19,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:19,556 INFO L471 AbstractCegarLoop]: Abstraction has 15467 states and 15878 transitions. [2025-01-09 00:07:19,556 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:19,556 INFO L276 IsEmpty]: Start isEmpty. Operand 15467 states and 15878 transitions. [2025-01-09 00:07:19,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1802 [2025-01-09 00:07:19,575 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:19,575 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-01-09 00:07:19,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-09 00:07:19,576 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:19,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:19,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1572077844, now seen corresponding path program 1 times [2025-01-09 00:07:19,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:19,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024720976] [2025-01-09 00:07:19,577 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:19,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:19,663 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1801 statements into 1 equivalence classes. [2025-01-09 00:07:19,713 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1801 of 1801 statements. [2025-01-09 00:07:19,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:19,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:20,562 INFO L134 CoverageAnalysis]: Checked inductivity of 6180 backedges. 219 proven. 0 refuted. 0 times theorem prover too weak. 5961 trivial. 0 not checked. [2025-01-09 00:07:20,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:20,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024720976] [2025-01-09 00:07:20,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024720976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:20,563 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:20,563 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:20,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917255331] [2025-01-09 00:07:20,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:20,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:20,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:20,564 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:20,564 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:20,564 INFO L87 Difference]: Start difference. First operand 15467 states and 15878 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:21,251 INFO L93 Difference]: Finished difference Result 31590 states and 32423 transitions. [2025-01-09 00:07:21,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:21,252 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 1801 [2025-01-09 00:07:21,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:21,264 INFO L225 Difference]: With dead ends: 31590 [2025-01-09 00:07:21,264 INFO L226 Difference]: Without dead ends: 15138 [2025-01-09 00:07:21,274 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-01-09 00:07:21,274 INFO L435 NwaCegarLoop]: 413 mSDtfsCounter, 313 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 751 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 751 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:21,275 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 419 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 751 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:07:21,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2025-01-09 00:07:21,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 15138. [2025-01-09 00:07:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 1.0227918345775253) internal successors, (15482), 15137 states have internal predecessors, (15482), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:21,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15482 transitions. [2025-01-09 00:07:21,371 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15482 transitions. Word has length 1801 [2025-01-09 00:07:21,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:21,373 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 15482 transitions. [2025-01-09 00:07:21,373 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 3 states have internal predecessors, (303), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:21,373 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15482 transitions. [2025-01-09 00:07:21,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1834 [2025-01-09 00:07:21,393 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:21,393 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2025-01-09 00:07:21,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-09 00:07:21,394 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:21,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:21,395 INFO L85 PathProgramCache]: Analyzing trace with hash 964073668, now seen corresponding path program 1 times [2025-01-09 00:07:21,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:21,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1503651077] [2025-01-09 00:07:21,396 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:21,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:21,468 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1833 statements into 1 equivalence classes. [2025-01-09 00:07:21,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1833 of 1833 statements. [2025-01-09 00:07:21,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:21,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:23,306 INFO L134 CoverageAnalysis]: Checked inductivity of 6404 backedges. 4921 proven. 91 refuted. 0 times theorem prover too weak. 1392 trivial. 0 not checked. [2025-01-09 00:07:23,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1503651077] [2025-01-09 00:07:23,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1503651077] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:07:23,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [588040903] [2025-01-09 00:07:23,307 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:23,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:07:23,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:07:23,313 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:07:23,315 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 00:07:23,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1833 statements into 1 equivalence classes. [2025-01-09 00:07:23,648 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1833 of 1833 statements. [2025-01-09 00:07:23,649 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:23,649 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:23,655 INFO L256 TraceCheckSpWp]: Trace formula consists of 2105 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 00:07:23,669 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:07:26,161 INFO L134 CoverageAnalysis]: Checked inductivity of 6404 backedges. 2615 proven. 201 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2025-01-09 00:07:26,162 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:07:29,583 INFO L134 CoverageAnalysis]: Checked inductivity of 6404 backedges. 2615 proven. 201 refuted. 0 times theorem prover too weak. 3588 trivial. 0 not checked. [2025-01-09 00:07:29,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [588040903] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 00:07:29,584 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 00:07:29,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-01-09 00:07:29,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808114892] [2025-01-09 00:07:29,584 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 00:07:29,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-01-09 00:07:29,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:29,588 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-01-09 00:07:29,588 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-01-09 00:07:29,588 INFO L87 Difference]: Start difference. First operand 15138 states and 15482 transitions. Second operand has 10 states, 10 states have (on average 187.9) internal successors, (1879), 10 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:33,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:33,281 INFO L93 Difference]: Finished difference Result 29946 states and 30632 transitions. [2025-01-09 00:07:33,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 00:07:33,282 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 187.9) internal successors, (1879), 10 states have internal predecessors, (1879), 0 states have call successors, (0), 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 1833 [2025-01-09 00:07:33,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:33,300 INFO L225 Difference]: With dead ends: 29946 [2025-01-09 00:07:33,300 INFO L226 Difference]: Without dead ends: 15139 [2025-01-09 00:07:33,308 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3676 GetRequests, 3665 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2025-01-09 00:07:33,308 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 845 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 6742 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 845 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 6863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 6742 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:33,309 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [845 Valid, 91 Invalid, 6863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 6742 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2025-01-09 00:07:33,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15139 states. [2025-01-09 00:07:33,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15139 to 15138. [2025-01-09 00:07:33,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15138 states, 15137 states have (on average 1.0207438726299796) internal successors, (15451), 15137 states have internal predecessors, (15451), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15138 states to 15138 states and 15451 transitions. [2025-01-09 00:07:33,438 INFO L78 Accepts]: Start accepts. Automaton has 15138 states and 15451 transitions. Word has length 1833 [2025-01-09 00:07:33,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:33,438 INFO L471 AbstractCegarLoop]: Abstraction has 15138 states and 15451 transitions. [2025-01-09 00:07:33,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 187.9) internal successors, (1879), 10 states have internal predecessors, (1879), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:33,439 INFO L276 IsEmpty]: Start isEmpty. Operand 15138 states and 15451 transitions. [2025-01-09 00:07:33,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1914 [2025-01-09 00:07:33,467 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:33,468 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-09 00:07:33,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 00:07:33,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-01-09 00:07:33,669 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:33,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:33,670 INFO L85 PathProgramCache]: Analyzing trace with hash -90412965, now seen corresponding path program 1 times [2025-01-09 00:07:33,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:33,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725102797] [2025-01-09 00:07:33,670 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:33,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:33,786 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1913 statements into 1 equivalence classes. [2025-01-09 00:07:33,811 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1913 of 1913 statements. [2025-01-09 00:07:33,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:33,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:35,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7592 backedges. 2847 proven. 0 refuted. 0 times theorem prover too weak. 4745 trivial. 0 not checked. [2025-01-09 00:07:35,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:35,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725102797] [2025-01-09 00:07:35,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [725102797] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:35,519 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:35,519 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:35,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070053366] [2025-01-09 00:07:35,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:35,521 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 00:07:35,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:35,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 00:07:35,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 00:07:35,522 INFO L87 Difference]: Start difference. First operand 15138 states and 15451 transitions. Second operand has 4 states, 4 states have (on average 171.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:36,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:36,971 INFO L93 Difference]: Finished difference Result 32248 states and 32918 transitions. [2025-01-09 00:07:36,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 00:07:36,972 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 171.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 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 1913 [2025-01-09 00:07:36,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:36,993 INFO L225 Difference]: With dead ends: 32248 [2025-01-09 00:07:36,993 INFO L226 Difference]: Without dead ends: 17441 [2025-01-09 00:07:37,006 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-01-09 00:07:37,006 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 368 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 1143 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 1143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:37,007 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 59 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 1143 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 00:07:37,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17441 states. [2025-01-09 00:07:37,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17441 to 16783. [2025-01-09 00:07:37,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16783 states, 16782 states have (on average 1.020676915743058) internal successors, (17129), 16782 states have internal predecessors, (17129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:37,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16783 states to 16783 states and 17129 transitions. [2025-01-09 00:07:37,214 INFO L78 Accepts]: Start accepts. Automaton has 16783 states and 17129 transitions. Word has length 1913 [2025-01-09 00:07:37,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:37,215 INFO L471 AbstractCegarLoop]: Abstraction has 16783 states and 17129 transitions. [2025-01-09 00:07:37,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 171.0) internal successors, (684), 3 states have internal predecessors, (684), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:37,215 INFO L276 IsEmpty]: Start isEmpty. Operand 16783 states and 17129 transitions. [2025-01-09 00:07:37,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1977 [2025-01-09 00:07:37,302 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:37,303 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 00:07:37,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-09 00:07:37,303 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:37,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:37,304 INFO L85 PathProgramCache]: Analyzing trace with hash -1511962035, now seen corresponding path program 1 times [2025-01-09 00:07:37,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:37,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486656599] [2025-01-09 00:07:37,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:37,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:37,414 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1976 statements into 1 equivalence classes. [2025-01-09 00:07:37,517 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1976 of 1976 statements. [2025-01-09 00:07:37,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:37,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:39,571 INFO L134 CoverageAnalysis]: Checked inductivity of 7843 backedges. 3830 proven. 0 refuted. 0 times theorem prover too weak. 4013 trivial. 0 not checked. [2025-01-09 00:07:39,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:39,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486656599] [2025-01-09 00:07:39,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [486656599] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:39,572 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 00:07:39,572 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 00:07:39,572 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [69460103] [2025-01-09 00:07:39,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:39,573 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:39,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:39,574 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:39,574 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 00:07:39,574 INFO L87 Difference]: Start difference. First operand 16783 states and 17129 transitions. Second operand has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:40,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:40,280 INFO L93 Difference]: Finished difference Result 35209 states and 35926 transitions. [2025-01-09 00:07:40,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:40,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 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 1976 [2025-01-09 00:07:40,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:40,306 INFO L225 Difference]: With dead ends: 35209 [2025-01-09 00:07:40,306 INFO L226 Difference]: Without dead ends: 18757 [2025-01-09 00:07:40,316 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-01-09 00:07:40,322 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 209 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:40,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 44 Invalid, 838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 00:07:40,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18757 states. [2025-01-09 00:07:40,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18757 to 17112. [2025-01-09 00:07:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17111 states have (on average 1.020396236339197) internal successors, (17460), 17111 states have internal predecessors, (17460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 17460 transitions. [2025-01-09 00:07:40,476 INFO L78 Accepts]: Start accepts. Automaton has 17112 states and 17460 transitions. Word has length 1976 [2025-01-09 00:07:40,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:40,477 INFO L471 AbstractCegarLoop]: Abstraction has 17112 states and 17460 transitions. [2025-01-09 00:07:40,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.33333333333334) internal successors, (652), 3 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 17112 states and 17460 transitions. [2025-01-09 00:07:40,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2014 [2025-01-09 00:07:40,499 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:40,500 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:07:40,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-09 00:07:40,500 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:40,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:40,501 INFO L85 PathProgramCache]: Analyzing trace with hash 5940474, now seen corresponding path program 1 times [2025-01-09 00:07:40,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:40,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801780959] [2025-01-09 00:07:40,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:40,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:40,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2013 statements into 1 equivalence classes. [2025-01-09 00:07:40,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2013 of 2013 statements. [2025-01-09 00:07:40,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:40,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:42,760 INFO L134 CoverageAnalysis]: Checked inductivity of 7960 backedges. 5708 proven. 153 refuted. 0 times theorem prover too weak. 2099 trivial. 0 not checked. [2025-01-09 00:07:42,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:42,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801780959] [2025-01-09 00:07:42,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801780959] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:07:42,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922587118] [2025-01-09 00:07:42,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:42,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:07:42,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:07:42,763 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:07:42,764 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 00:07:42,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2013 statements into 1 equivalence classes. [2025-01-09 00:07:43,160 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2013 of 2013 statements. [2025-01-09 00:07:43,161 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:43,161 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:43,169 INFO L256 TraceCheckSpWp]: Trace formula consists of 2307 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 00:07:43,198 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:07:43,818 INFO L134 CoverageAnalysis]: Checked inductivity of 7960 backedges. 1378 proven. 0 refuted. 0 times theorem prover too weak. 6582 trivial. 0 not checked. [2025-01-09 00:07:43,818 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 00:07:43,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922587118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 00:07:43,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 00:07:43,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2025-01-09 00:07:43,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411813799] [2025-01-09 00:07:43,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:07:43,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:07:43,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:07:43,822 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:07:43,822 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:07:43,822 INFO L87 Difference]: Start difference. First operand 17112 states and 17460 transitions. Second operand has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:44,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:07:44,696 INFO L93 Difference]: Finished difference Result 36854 states and 37606 transitions. [2025-01-09 00:07:44,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:07:44,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 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 2013 [2025-01-09 00:07:44,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:07:44,716 INFO L225 Difference]: With dead ends: 36854 [2025-01-09 00:07:44,717 INFO L226 Difference]: Without dead ends: 20073 [2025-01-09 00:07:44,729 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2018 GetRequests, 2013 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:07:44,730 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 216 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 758 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 216 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 758 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:07:44,731 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [216 Valid, 34 Invalid, 851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 758 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:07:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20073 states. [2025-01-09 00:07:44,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20073 to 17441. [2025-01-09 00:07:44,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17441 states, 17440 states have (on average 1.020355504587156) internal successors, (17795), 17440 states have internal predecessors, (17795), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:44,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17441 states to 17441 states and 17795 transitions. [2025-01-09 00:07:44,954 INFO L78 Accepts]: Start accepts. Automaton has 17441 states and 17795 transitions. Word has length 2013 [2025-01-09 00:07:44,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:07:44,955 INFO L471 AbstractCegarLoop]: Abstraction has 17441 states and 17795 transitions. [2025-01-09 00:07:44,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.0) internal successors, (423), 3 states have internal predecessors, (423), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:07:44,956 INFO L276 IsEmpty]: Start isEmpty. Operand 17441 states and 17795 transitions. [2025-01-09 00:07:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2080 [2025-01-09 00:07:45,011 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:07:45,012 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-09 00:07:45,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 00:07:45,216 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:07:45,216 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:07:45,217 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:07:45,217 INFO L85 PathProgramCache]: Analyzing trace with hash 440154549, now seen corresponding path program 1 times [2025-01-09 00:07:45,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:07:45,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936831525] [2025-01-09 00:07:45,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:45,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:07:45,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2079 statements into 1 equivalence classes. [2025-01-09 00:07:45,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2079 of 2079 statements. [2025-01-09 00:07:45,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:45,549 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:47,727 INFO L134 CoverageAnalysis]: Checked inductivity of 8304 backedges. 5986 proven. 153 refuted. 0 times theorem prover too weak. 2165 trivial. 0 not checked. [2025-01-09 00:07:47,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:07:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936831525] [2025-01-09 00:07:47,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936831525] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:07:47,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593542958] [2025-01-09 00:07:47,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:07:47,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:07:47,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:07:47,730 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:07:47,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 00:07:47,857 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2079 statements into 1 equivalence classes. [2025-01-09 00:07:48,184 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2079 of 2079 statements. [2025-01-09 00:07:48,185 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:07:48,185 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:07:48,192 INFO L256 TraceCheckSpWp]: Trace formula consists of 2373 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:07:48,204 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:07:58,965 INFO L134 CoverageAnalysis]: Checked inductivity of 8304 backedges. 5420 proven. 67 refuted. 0 times theorem prover too weak. 2817 trivial. 0 not checked. [2025-01-09 00:07:58,966 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:08:01,627 INFO L134 CoverageAnalysis]: Checked inductivity of 8304 backedges. 4366 proven. 0 refuted. 0 times theorem prover too weak. 3938 trivial. 0 not checked. [2025-01-09 00:08:01,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593542958] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:01,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:08:01,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [6, 4] total 9 [2025-01-09 00:08:01,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832024114] [2025-01-09 00:08:01,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:01,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:01,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:01,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:01,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:08:01,630 INFO L87 Difference]: Start difference. First operand 17441 states and 17795 transitions. Second operand has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:02,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:02,508 INFO L93 Difference]: Finished difference Result 35538 states and 36263 transitions. [2025-01-09 00:08:02,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:02,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 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 2079 [2025-01-09 00:08:02,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:02,528 INFO L225 Difference]: With dead ends: 35538 [2025-01-09 00:08:02,529 INFO L226 Difference]: Without dead ends: 18428 [2025-01-09 00:08:02,540 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4162 GetRequests, 4155 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-01-09 00:08:02,541 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 269 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 734 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:02,541 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 33 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 734 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 00:08:02,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2025-01-09 00:08:02,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 16454. [2025-01-09 00:08:02,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.017869081626451) internal successors, (16747), 16453 states have internal predecessors, (16747), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 16747 transitions. [2025-01-09 00:08:02,659 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 16747 transitions. Word has length 2079 [2025-01-09 00:08:02,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:02,660 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 16747 transitions. [2025-01-09 00:08:02,660 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 199.33333333333334) internal successors, (598), 3 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:02,661 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 16747 transitions. [2025-01-09 00:08:02,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2084 [2025-01-09 00:08:02,683 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:02,683 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:08:02,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 00:08:02,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-09 00:08:02,884 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:02,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:02,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1242571350, now seen corresponding path program 1 times [2025-01-09 00:08:02,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:02,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1389689588] [2025-01-09 00:08:02,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:02,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:02,972 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2083 statements into 1 equivalence classes. [2025-01-09 00:08:03,040 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2083 of 2083 statements. [2025-01-09 00:08:03,040 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:03,040 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:05,423 INFO L134 CoverageAnalysis]: Checked inductivity of 8919 backedges. 5749 proven. 79 refuted. 0 times theorem prover too weak. 3091 trivial. 0 not checked. [2025-01-09 00:08:05,423 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:05,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1389689588] [2025-01-09 00:08:05,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1389689588] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:05,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [610456962] [2025-01-09 00:08:05,423 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:05,423 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:05,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:05,425 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:08:05,431 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 00:08:05,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2083 statements into 1 equivalence classes. [2025-01-09 00:08:05,827 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2083 of 2083 statements. [2025-01-09 00:08:05,827 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:05,827 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:05,837 INFO L256 TraceCheckSpWp]: Trace formula consists of 2401 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 00:08:05,848 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 00:08:06,565 INFO L134 CoverageAnalysis]: Checked inductivity of 8919 backedges. 5320 proven. 250 refuted. 0 times theorem prover too weak. 3349 trivial. 0 not checked. [2025-01-09 00:08:06,565 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 00:08:08,028 INFO L134 CoverageAnalysis]: Checked inductivity of 8919 backedges. 4389 proven. 0 refuted. 0 times theorem prover too weak. 4530 trivial. 0 not checked. [2025-01-09 00:08:08,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [610456962] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:08,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-09 00:08:08,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 4] total 7 [2025-01-09 00:08:08,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443072552] [2025-01-09 00:08:08,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 00:08:08,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 00:08:08,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 00:08:08,034 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 00:08:08,034 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:08,034 INFO L87 Difference]: Start difference. First operand 16454 states and 16747 transitions. Second operand has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:08,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 00:08:08,780 INFO L93 Difference]: Finished difference Result 32577 states and 33161 transitions. [2025-01-09 00:08:08,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 00:08:08,780 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 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 2083 [2025-01-09 00:08:08,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 00:08:08,802 INFO L225 Difference]: With dead ends: 32577 [2025-01-09 00:08:08,803 INFO L226 Difference]: Without dead ends: 16454 [2025-01-09 00:08:08,811 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4168 GetRequests, 4163 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2025-01-09 00:08:08,812 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 86 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 738 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 00:08:08,812 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 16 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 738 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 00:08:08,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2025-01-09 00:08:08,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 16454. [2025-01-09 00:08:08,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16454 states, 16453 states have (on average 1.0170181729775725) internal successors, (16733), 16453 states have internal predecessors, (16733), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:08,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16454 states to 16454 states and 16733 transitions. [2025-01-09 00:08:08,920 INFO L78 Accepts]: Start accepts. Automaton has 16454 states and 16733 transitions. Word has length 2083 [2025-01-09 00:08:08,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 00:08:08,921 INFO L471 AbstractCegarLoop]: Abstraction has 16454 states and 16733 transitions. [2025-01-09 00:08:08,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 256.6666666666667) internal successors, (770), 3 states have internal predecessors, (770), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 00:08:08,921 INFO L276 IsEmpty]: Start isEmpty. Operand 16454 states and 16733 transitions. [2025-01-09 00:08:08,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 2151 [2025-01-09 00:08:08,944 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 00:08:08,945 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 14, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 13, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 12, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-01-09 00:08:08,952 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-09 00:08:09,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2025-01-09 00:08:09,146 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 00:08:09,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 00:08:09,147 INFO L85 PathProgramCache]: Analyzing trace with hash -805721836, now seen corresponding path program 1 times [2025-01-09 00:08:09,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 00:08:09,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491381455] [2025-01-09 00:08:09,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:09,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 00:08:09,240 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2150 statements into 1 equivalence classes. [2025-01-09 00:08:09,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2150 of 2150 statements. [2025-01-09 00:08:09,311 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:09,311 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:11,690 INFO L134 CoverageAnalysis]: Checked inductivity of 9744 backedges. 6150 proven. 79 refuted. 0 times theorem prover too weak. 3515 trivial. 0 not checked. [2025-01-09 00:08:11,690 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 00:08:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491381455] [2025-01-09 00:08:11,690 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491381455] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 00:08:11,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513778576] [2025-01-09 00:08:11,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 00:08:11,691 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 00:08:11,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 00:08:11,693 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 00:08:11,694 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 00:08:11,965 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 2150 statements into 1 equivalence classes. [2025-01-09 00:08:12,307 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 2150 of 2150 statements. [2025-01-09 00:08:12,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 00:08:12,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 00:08:12,315 INFO L256 TraceCheckSpWp]: Trace formula consists of 2488 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 00:08:12,336 INFO L279 TraceCheckSpWp]: Computing forward predicates...