./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label41.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/Problem13_label41.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 cd32d11e922bf190beba4edd20222f6e5b4dfc210b3394b8307f2a4d7f2efc9e --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:54:31,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:54:31,720 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-08 23:54:31,724 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:54:31,724 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:54:31,740 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:54:31,740 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:54:31,740 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:54:31,741 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:54:31,741 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:54:31,741 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:54:31,741 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:54:31,741 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:54:31,741 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:54:31,741 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:54:31,742 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:54:31,742 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:54:31,742 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:54:31,742 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:54:31,742 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:54:31,742 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:54:31,742 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:54:31,742 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:54:31,742 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:54:31,742 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:54:31,742 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:54:31,742 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:54:31,742 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:54:31,743 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:54:31,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:54:31,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:54:31,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:54:31,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:54:31,743 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:54:31,743 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:54:31,743 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:54:31,743 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:54:31,743 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:54:31,744 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:54:31,744 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:54:31,744 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:54:31,744 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:54:31,744 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:54:31,744 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:54:31,744 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:54:31,744 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:54:31,744 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:54:31,744 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:54:31,744 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 -> cd32d11e922bf190beba4edd20222f6e5b4dfc210b3394b8307f2a4d7f2efc9e [2025-01-08 23:54:31,962 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:54:31,971 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:54:31,972 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:54:31,974 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:54:31,975 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:54:31,976 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label41.c [2025-01-08 23:54:33,076 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edadf691a/f3e04b948b7047f0b5ca28cc7629acaa/FLAGc200a3298 [2025-01-08 23:54:33,548 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:54:33,548 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label41.c [2025-01-08 23:54:33,575 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edadf691a/f3e04b948b7047f0b5ca28cc7629acaa/FLAGc200a3298 [2025-01-08 23:54:33,630 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/edadf691a/f3e04b948b7047f0b5ca28cc7629acaa [2025-01-08 23:54:33,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:54:33,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:54:33,637 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:54:33,637 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:54:33,640 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:54:33,641 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:33,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48bf0c62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:33, skipping insertion in model container [2025-01-08 23:54:33,642 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:54:33" (1/1) ... [2025-01-08 23:54:33,763 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:54:33,966 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/Problem13_label41.c[6347,6360] [2025-01-08 23:54:34,434 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:54:34,442 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:54:34,454 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/Problem13_label41.c[6347,6360] [2025-01-08 23:54:34,754 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:54:34,771 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:54:34,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34 WrapperNode [2025-01-08 23:54:34,773 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:54:34,774 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:54:34,774 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:54:34,774 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:54:34,780 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:34,831 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:35,153 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5584 [2025-01-08 23:54:35,153 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:54:35,154 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:54:35,155 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:54:35,155 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:54:35,161 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:35,161 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:35,227 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:35,432 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-08 23:54:35,433 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:35,433 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:35,552 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:35,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:35,597 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:35,619 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:35,643 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:35,695 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:54:35,696 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:54:35,696 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:54:35,696 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:54:35,697 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (1/1) ... [2025-01-08 23:54:35,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:54:35,709 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:54:35,721 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-08 23:54:35,723 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-08 23:54:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:54:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:54:35,742 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:54:35,742 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:54:35,785 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:54:35,786 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:54:39,957 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2025-01-08 23:54:39,957 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:54:39,991 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:54:39,991 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:54:39,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:54:39 BoogieIcfgContainer [2025-01-08 23:54:39,992 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:54:39,994 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:54:39,994 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:54:39,997 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:54:39,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:54:33" (1/3) ... [2025-01-08 23:54:39,998 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f6abe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:54:39, skipping insertion in model container [2025-01-08 23:54:39,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:54:34" (2/3) ... [2025-01-08 23:54:39,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f6abe1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:54:39, skipping insertion in model container [2025-01-08 23:54:39,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:54:39" (3/3) ... [2025-01-08 23:54:40,001 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem13_label41.c [2025-01-08 23:54:40,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:54:40,012 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem13_label41.c that has 1 procedures, 1098 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:54:40,081 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:54:40,091 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;@607dc771, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:54:40,092 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:54:40,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 0 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-08 23:54:40,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-01-08 23:54:40,104 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:40,105 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:40,105 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:40,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:40,110 INFO L85 PathProgramCache]: Analyzing trace with hash -730872606, now seen corresponding path program 1 times [2025-01-08 23:54:40,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:40,116 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298561524] [2025-01-08 23:54:40,116 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:40,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:40,177 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-01-08 23:54:40,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-01-08 23:54:40,218 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:40,218 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:40,578 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-08 23:54:40,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:40,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298561524] [2025-01-08 23:54:40,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298561524] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:40,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:40,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:40,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787985697] [2025-01-08 23:54:40,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:40,584 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:54:40,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:40,598 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:54:40,599 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:54:40,602 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8266423357664234) internal successors, (2002), 1097 states have internal predecessors, (2002), 0 states have call successors, (0), 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 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-08 23:54:45,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:45,361 INFO L93 Difference]: Finished difference Result 3829 states and 7202 transitions. [2025-01-08 23:54:45,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:54:45,363 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 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 44 [2025-01-08 23:54:45,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:45,382 INFO L225 Difference]: With dead ends: 3829 [2025-01-08 23:54:45,382 INFO L226 Difference]: Without dead ends: 2664 [2025-01-08 23:54:45,391 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:54:45,394 INFO L435 NwaCegarLoop]: 757 mSDtfsCounter, 2705 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 4246 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2705 SdHoareTripleChecker+Valid, 1059 SdHoareTripleChecker+Invalid, 5853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 4246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:45,395 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2705 Valid, 1059 Invalid, 5853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 4246 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-08 23:54:45,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2664 states. [2025-01-08 23:54:45,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2664 to 2663. [2025-01-08 23:54:45,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2663 states, 2662 states have (on average 1.460931630353118) internal successors, (3889), 2662 states have internal predecessors, (3889), 0 states have call successors, (0), 0 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-08 23:54:45,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2663 states to 2663 states and 3889 transitions. [2025-01-08 23:54:45,484 INFO L78 Accepts]: Start accepts. Automaton has 2663 states and 3889 transitions. Word has length 44 [2025-01-08 23:54:45,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:45,484 INFO L471 AbstractCegarLoop]: Abstraction has 2663 states and 3889 transitions. [2025-01-08 23:54:45,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 0 states have call successors, (0), 0 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-08 23:54:45,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 3889 transitions. [2025-01-08 23:54:45,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2025-01-08 23:54:45,488 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:45,489 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-08 23:54:45,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:54:45,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:45,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:45,491 INFO L85 PathProgramCache]: Analyzing trace with hash 1092460936, now seen corresponding path program 1 times [2025-01-08 23:54:45,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:45,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630757254] [2025-01-08 23:54:45,491 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:45,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:45,509 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 169 statements into 1 equivalence classes. [2025-01-08 23:54:45,539 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 169 of 169 statements. [2025-01-08 23:54:45,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:45,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:45,748 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:54:45,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:45,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630757254] [2025-01-08 23:54:45,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1630757254] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:45,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:45,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:45,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [508909972] [2025-01-08 23:54:45,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:45,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:54:45,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:45,749 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:54:45,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:54:45,750 INFO L87 Difference]: Start difference. First operand 2663 states and 3889 transitions. Second operand has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-08 23:54:50,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:50,459 INFO L93 Difference]: Finished difference Result 7864 states and 12669 transitions. [2025-01-08 23:54:50,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:54:50,459 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 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 169 [2025-01-08 23:54:50,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:50,476 INFO L225 Difference]: With dead ends: 7864 [2025-01-08 23:54:50,476 INFO L226 Difference]: Without dead ends: 5990 [2025-01-08 23:54:50,479 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-08 23:54:50,479 INFO L435 NwaCegarLoop]: 893 mSDtfsCounter, 1712 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 5283 mSolverCounterSat, 843 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1712 SdHoareTripleChecker+Valid, 1068 SdHoareTripleChecker+Invalid, 6126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 843 IncrementalHoareTripleChecker+Valid, 5283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:50,480 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1712 Valid, 1068 Invalid, 6126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [843 Valid, 5283 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-01-08 23:54:50,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5990 states. [2025-01-08 23:54:50,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5990 to 5859. [2025-01-08 23:54:50,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5859 states, 5858 states have (on average 1.4452031410037556) internal successors, (8466), 5858 states have internal predecessors, (8466), 0 states have call successors, (0), 0 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-08 23:54:50,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5859 states to 5859 states and 8466 transitions. [2025-01-08 23:54:50,571 INFO L78 Accepts]: Start accepts. Automaton has 5859 states and 8466 transitions. Word has length 169 [2025-01-08 23:54:50,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:50,573 INFO L471 AbstractCegarLoop]: Abstraction has 5859 states and 8466 transitions. [2025-01-08 23:54:50,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 42.25) internal successors, (169), 3 states have internal predecessors, (169), 0 states have call successors, (0), 0 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-08 23:54:50,574 INFO L276 IsEmpty]: Start isEmpty. Operand 5859 states and 8466 transitions. [2025-01-08 23:54:50,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2025-01-08 23:54:50,581 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:50,581 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:54:50,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:54:50,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:50,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:50,582 INFO L85 PathProgramCache]: Analyzing trace with hash 632569941, now seen corresponding path program 1 times [2025-01-08 23:54:50,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:50,582 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119683175] [2025-01-08 23:54:50,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:50,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:50,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 211 statements into 1 equivalence classes. [2025-01-08 23:54:50,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 211 of 211 statements. [2025-01-08 23:54:50,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:50,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:50,764 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2025-01-08 23:54:50,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:50,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119683175] [2025-01-08 23:54:50,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119683175] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:50,765 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:50,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:50,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314106643] [2025-01-08 23:54:50,765 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:50,765 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:50,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:50,766 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:50,766 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:50,766 INFO L87 Difference]: Start difference. First operand 5859 states and 8466 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:53,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:53,216 INFO L93 Difference]: Finished difference Result 15687 states and 23390 transitions. [2025-01-08 23:54:53,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:53,218 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2025-01-08 23:54:53,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:53,242 INFO L225 Difference]: With dead ends: 15687 [2025-01-08 23:54:53,243 INFO L226 Difference]: Without dead ends: 10617 [2025-01-08 23:54:53,247 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-08 23:54:53,248 INFO L435 NwaCegarLoop]: 784 mSDtfsCounter, 919 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2554 mSolverCounterSat, 756 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 919 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 3310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 756 IncrementalHoareTripleChecker+Valid, 2554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:53,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [919 Valid, 917 Invalid, 3310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [756 Valid, 2554 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-01-08 23:54:53,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10617 states. [2025-01-08 23:54:53,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10617 to 10608. [2025-01-08 23:54:53,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10608 states, 10607 states have (on average 1.3551428302064674) internal successors, (14374), 10607 states have internal predecessors, (14374), 0 states have call successors, (0), 0 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-08 23:54:53,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10608 states to 10608 states and 14374 transitions. [2025-01-08 23:54:53,366 INFO L78 Accepts]: Start accepts. Automaton has 10608 states and 14374 transitions. Word has length 211 [2025-01-08 23:54:53,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:53,367 INFO L471 AbstractCegarLoop]: Abstraction has 10608 states and 14374 transitions. [2025-01-08 23:54:53,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:53,367 INFO L276 IsEmpty]: Start isEmpty. Operand 10608 states and 14374 transitions. [2025-01-08 23:54:53,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2025-01-08 23:54:53,370 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:53,371 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:53,371 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:54:53,371 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:53,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:53,372 INFO L85 PathProgramCache]: Analyzing trace with hash 277406962, now seen corresponding path program 1 times [2025-01-08 23:54:53,372 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:53,373 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436760118] [2025-01-08 23:54:53,373 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:53,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:53,392 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 225 statements into 1 equivalence classes. [2025-01-08 23:54:53,405 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 225 of 225 statements. [2025-01-08 23:54:53,405 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:53,405 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:53,520 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2025-01-08 23:54:53,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:53,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436760118] [2025-01-08 23:54:53,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436760118] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:53,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:53,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:54:53,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [898574207] [2025-01-08 23:54:53,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:53,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:53,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:53,523 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:53,523 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:53,523 INFO L87 Difference]: Start difference. First operand 10608 states and 14374 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:56,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:56,308 INFO L93 Difference]: Finished difference Result 28351 states and 39240 transitions. [2025-01-08 23:54:56,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:56,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 225 [2025-01-08 23:54:56,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:56,343 INFO L225 Difference]: With dead ends: 28351 [2025-01-08 23:54:56,343 INFO L226 Difference]: Without dead ends: 18532 [2025-01-08 23:54:56,350 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-08 23:54:56,351 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 909 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 2872 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 909 SdHoareTripleChecker+Valid, 616 SdHoareTripleChecker+Invalid, 3416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2872 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:56,351 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [909 Valid, 616 Invalid, 3416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2872 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-01-08 23:54:56,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18532 states. [2025-01-08 23:54:56,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18532 to 18523. [2025-01-08 23:54:56,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18523 states, 18522 states have (on average 1.3251268761472843) internal successors, (24544), 18522 states have internal predecessors, (24544), 0 states have call successors, (0), 0 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-08 23:54:56,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18523 states to 18523 states and 24544 transitions. [2025-01-08 23:54:56,585 INFO L78 Accepts]: Start accepts. Automaton has 18523 states and 24544 transitions. Word has length 225 [2025-01-08 23:54:56,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:56,585 INFO L471 AbstractCegarLoop]: Abstraction has 18523 states and 24544 transitions. [2025-01-08 23:54:56,586 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:56,586 INFO L276 IsEmpty]: Start isEmpty. Operand 18523 states and 24544 transitions. [2025-01-08 23:54:56,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-01-08 23:54:56,589 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:56,589 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:56,590 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:54:56,590 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:56,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:56,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1643105029, now seen corresponding path program 1 times [2025-01-08 23:54:56,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:56,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242225598] [2025-01-08 23:54:56,590 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:56,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:56,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-08 23:54:56,622 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-08 23:54:56,622 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:56,623 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:54:56,733 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:54:56,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:54:56,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242225598] [2025-01-08 23:54:56,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242225598] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:54:56,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:54:56,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:54:56,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179367952] [2025-01-08 23:54:56,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:54:56,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:54:56,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:54:56,735 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:54:56,735 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:54:56,735 INFO L87 Difference]: Start difference. First operand 18523 states and 24544 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:59,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:54:59,372 INFO L93 Difference]: Finished difference Result 52015 states and 69799 transitions. [2025-01-08 23:54:59,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:54:59,373 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 243 [2025-01-08 23:54:59,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:54:59,425 INFO L225 Difference]: With dead ends: 52015 [2025-01-08 23:54:59,425 INFO L226 Difference]: Without dead ends: 34281 [2025-01-08 23:54:59,439 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-08 23:54:59,440 INFO L435 NwaCegarLoop]: 832 mSDtfsCounter, 852 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 915 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 852 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 3308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 915 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:54:59,440 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [852 Valid, 950 Invalid, 3308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [915 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:54:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34281 states. [2025-01-08 23:54:59,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34281 to 34271. [2025-01-08 23:54:59,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34271 states, 34270 states have (on average 1.25503355704698) internal successors, (43010), 34270 states have internal predecessors, (43010), 0 states have call successors, (0), 0 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-08 23:54:59,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34271 states to 34271 states and 43010 transitions. [2025-01-08 23:54:59,882 INFO L78 Accepts]: Start accepts. Automaton has 34271 states and 43010 transitions. Word has length 243 [2025-01-08 23:54:59,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:54:59,883 INFO L471 AbstractCegarLoop]: Abstraction has 34271 states and 43010 transitions. [2025-01-08 23:54:59,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:54:59,883 INFO L276 IsEmpty]: Start isEmpty. Operand 34271 states and 43010 transitions. [2025-01-08 23:54:59,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2025-01-08 23:54:59,886 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:54:59,886 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:54:59,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:54:59,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:54:59,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:54:59,887 INFO L85 PathProgramCache]: Analyzing trace with hash -451680997, now seen corresponding path program 1 times [2025-01-08 23:54:59,888 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:54:59,888 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408062816] [2025-01-08 23:54:59,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:54:59,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:54:59,938 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 274 statements into 1 equivalence classes. [2025-01-08 23:54:59,955 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 274 of 274 statements. [2025-01-08 23:54:59,955 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:54:59,955 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:00,119 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 83 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2025-01-08 23:55:00,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:00,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408062816] [2025-01-08 23:55:00,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408062816] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:00,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:00,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:55:00,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627569813] [2025-01-08 23:55:00,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:00,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:00,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:00,122 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:00,122 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:00,122 INFO L87 Difference]: Start difference. First operand 34271 states and 43010 transitions. Second operand has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-08 23:55:02,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:02,694 INFO L93 Difference]: Finished difference Result 92929 states and 117620 transitions. [2025-01-08 23:55:02,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:02,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 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 274 [2025-01-08 23:55:02,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:02,764 INFO L225 Difference]: With dead ends: 92929 [2025-01-08 23:55:02,765 INFO L226 Difference]: Without dead ends: 59447 [2025-01-08 23:55:02,789 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-08 23:55:02,791 INFO L435 NwaCegarLoop]: 839 mSDtfsCounter, 857 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 2308 mSolverCounterSat, 869 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 3177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 869 IncrementalHoareTripleChecker+Valid, 2308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:02,791 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 986 Invalid, 3177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [869 Valid, 2308 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:55:02,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59447 states. [2025-01-08 23:55:03,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59447 to 57869. [2025-01-08 23:55:03,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57869 states, 57868 states have (on average 1.1960496301928527) internal successors, (69213), 57868 states have internal predecessors, (69213), 0 states have call successors, (0), 0 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-08 23:55:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57869 states to 57869 states and 69213 transitions. [2025-01-08 23:55:03,299 INFO L78 Accepts]: Start accepts. Automaton has 57869 states and 69213 transitions. Word has length 274 [2025-01-08 23:55:03,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:03,300 INFO L471 AbstractCegarLoop]: Abstraction has 57869 states and 69213 transitions. [2025-01-08 23:55:03,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 57.0) internal successors, (171), 2 states have internal predecessors, (171), 0 states have call successors, (0), 0 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-08 23:55:03,301 INFO L276 IsEmpty]: Start isEmpty. Operand 57869 states and 69213 transitions. [2025-01-08 23:55:03,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2025-01-08 23:55:03,305 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:03,305 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:03,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-08 23:55:03,305 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:03,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:03,306 INFO L85 PathProgramCache]: Analyzing trace with hash -469333426, now seen corresponding path program 1 times [2025-01-08 23:55:03,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:03,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909307038] [2025-01-08 23:55:03,306 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:03,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:03,327 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 312 statements into 1 equivalence classes. [2025-01-08 23:55:03,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 312 of 312 statements. [2025-01-08 23:55:03,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:03,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:03,526 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 319 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-08 23:55:03,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:03,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909307038] [2025-01-08 23:55:03,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909307038] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:03,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:03,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:03,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475966480] [2025-01-08 23:55:03,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:03,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:55:03,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:03,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:55:03,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:55:03,527 INFO L87 Difference]: Start difference. First operand 57869 states and 69213 transitions. Second operand has 4 states, 4 states have (on average 67.75) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:08,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:08,423 INFO L93 Difference]: Finished difference Result 156096 states and 188759 transitions. [2025-01-08 23:55:08,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:55:08,424 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312 [2025-01-08 23:55:08,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:08,715 INFO L225 Difference]: With dead ends: 156096 [2025-01-08 23:55:08,715 INFO L226 Difference]: Without dead ends: 99016 [2025-01-08 23:55:08,733 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-08 23:55:08,733 INFO L435 NwaCegarLoop]: 502 mSDtfsCounter, 1744 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 6069 mSolverCounterSat, 1183 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1744 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 7252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1183 IncrementalHoareTripleChecker+Valid, 6069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:08,733 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1744 Valid, 702 Invalid, 7252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1183 Valid, 6069 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2025-01-08 23:55:08,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99016 states. [2025-01-08 23:55:09,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99016 to 97314. [2025-01-08 23:55:09,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97314 states, 97313 states have (on average 1.1924511627429017) internal successors, (116041), 97313 states have internal predecessors, (116041), 0 states have call successors, (0), 0 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-08 23:55:09,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97314 states to 97314 states and 116041 transitions. [2025-01-08 23:55:09,408 INFO L78 Accepts]: Start accepts. Automaton has 97314 states and 116041 transitions. Word has length 312 [2025-01-08 23:55:09,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:09,409 INFO L471 AbstractCegarLoop]: Abstraction has 97314 states and 116041 transitions. [2025-01-08 23:55:09,410 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.75) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:09,410 INFO L276 IsEmpty]: Start isEmpty. Operand 97314 states and 116041 transitions. [2025-01-08 23:55:09,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2025-01-08 23:55:09,413 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:09,413 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 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-08 23:55:09,413 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:55:09,413 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:09,414 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:09,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1277921101, now seen corresponding path program 1 times [2025-01-08 23:55:09,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:09,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32957588] [2025-01-08 23:55:09,414 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:09,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:09,432 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-08 23:55:09,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-08 23:55:09,444 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:09,444 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:10,252 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 294 proven. 25 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-08 23:55:10,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:10,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32957588] [2025-01-08 23:55:10,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32957588] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:55:10,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [37293626] [2025-01-08 23:55:10,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:10,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:10,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:55:10,255 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-08 23:55:10,256 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-08 23:55:10,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 327 statements into 1 equivalence classes. [2025-01-08 23:55:10,361 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 327 of 327 statements. [2025-01-08 23:55:10,361 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:10,361 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:10,363 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:55:10,372 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:55:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 266 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2025-01-08 23:55:10,479 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:55:10,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [37293626] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:10,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:55:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:55:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500141695] [2025-01-08 23:55:10,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:10,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:10,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:10,480 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:10,480 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:55:10,480 INFO L87 Difference]: Start difference. First operand 97314 states and 116041 transitions. Second operand has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:12,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:12,949 INFO L93 Difference]: Finished difference Result 193050 states and 230135 transitions. [2025-01-08 23:55:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:12,950 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 327 [2025-01-08 23:55:12,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:13,076 INFO L225 Difference]: With dead ends: 193050 [2025-01-08 23:55:13,076 INFO L226 Difference]: Without dead ends: 96525 [2025-01-08 23:55:13,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:55:13,136 INFO L435 NwaCegarLoop]: 1363 mSDtfsCounter, 1138 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 451 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1138 SdHoareTripleChecker+Valid, 1445 SdHoareTripleChecker+Invalid, 2918 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 451 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:13,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1138 Valid, 1445 Invalid, 2918 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [451 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-01-08 23:55:13,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96525 states. [2025-01-08 23:55:13,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96525 to 96524. [2025-01-08 23:55:13,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96524 states, 96523 states have (on average 1.1417175181044932) internal successors, (110202), 96523 states have internal predecessors, (110202), 0 states have call successors, (0), 0 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-08 23:55:14,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96524 states to 96524 states and 110202 transitions. [2025-01-08 23:55:14,218 INFO L78 Accepts]: Start accepts. Automaton has 96524 states and 110202 transitions. Word has length 327 [2025-01-08 23:55:14,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:14,219 INFO L471 AbstractCegarLoop]: Abstraction has 96524 states and 110202 transitions. [2025-01-08 23:55:14,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.66666666666667) internal successors, (233), 3 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:55:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 96524 states and 110202 transitions. [2025-01-08 23:55:14,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 362 [2025-01-08 23:55:14,223 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:14,224 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:14,230 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-08 23:55:14,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:14,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:14,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:14,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1842129019, now seen corresponding path program 1 times [2025-01-08 23:55:14,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:14,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581935754] [2025-01-08 23:55:14,429 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:14,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:14,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 361 statements into 1 equivalence classes. [2025-01-08 23:55:14,464 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 361 of 361 statements. [2025-01-08 23:55:14,464 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:14,464 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:14,539 INFO L134 CoverageAnalysis]: Checked inductivity of 404 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2025-01-08 23:55:14,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:14,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581935754] [2025-01-08 23:55:14,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581935754] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:14,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:14,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:14,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957739764] [2025-01-08 23:55:14,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:14,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:14,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:14,540 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:14,540 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:14,540 INFO L87 Difference]: Start difference. First operand 96524 states and 110202 transitions. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-08 23:55:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:17,321 INFO L93 Difference]: Finished difference Result 192231 states and 219297 transitions. [2025-01-08 23:55:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:17,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 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 361 [2025-01-08 23:55:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:17,439 INFO L225 Difference]: With dead ends: 192231 [2025-01-08 23:55:17,439 INFO L226 Difference]: Without dead ends: 96496 [2025-01-08 23:55:17,497 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-08 23:55:17,497 INFO L435 NwaCegarLoop]: 1514 mSDtfsCounter, 1035 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 2354 mSolverCounterSat, 593 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1035 SdHoareTripleChecker+Valid, 1650 SdHoareTripleChecker+Invalid, 2947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 593 IncrementalHoareTripleChecker+Valid, 2354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:17,498 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1035 Valid, 1650 Invalid, 2947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [593 Valid, 2354 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-01-08 23:55:17,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96496 states. [2025-01-08 23:55:18,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96496 to 92551. [2025-01-08 23:55:18,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92551 states, 92550 states have (on average 1.0987250135062128) internal successors, (101687), 92550 states have internal predecessors, (101687), 0 states have call successors, (0), 0 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-08 23:55:18,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92551 states to 92551 states and 101687 transitions. [2025-01-08 23:55:18,402 INFO L78 Accepts]: Start accepts. Automaton has 92551 states and 101687 transitions. Word has length 361 [2025-01-08 23:55:18,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:18,402 INFO L471 AbstractCegarLoop]: Abstraction has 92551 states and 101687 transitions. [2025-01-08 23:55:18,402 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 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-08 23:55:18,402 INFO L276 IsEmpty]: Start isEmpty. Operand 92551 states and 101687 transitions. [2025-01-08 23:55:18,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 372 [2025-01-08 23:55:18,406 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:18,406 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:18,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-08 23:55:18,406 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:18,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:18,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1810718707, now seen corresponding path program 1 times [2025-01-08 23:55:18,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:18,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2062727307] [2025-01-08 23:55:18,407 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:18,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:18,426 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 371 statements into 1 equivalence classes. [2025-01-08 23:55:18,441 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 371 of 371 statements. [2025-01-08 23:55:18,443 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:18,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:18,642 INFO L134 CoverageAnalysis]: Checked inductivity of 397 backedges. 125 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:55:18,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:18,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2062727307] [2025-01-08 23:55:18,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2062727307] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:18,642 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:18,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:18,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885582795] [2025-01-08 23:55:18,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:18,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:55:18,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:18,643 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:55:18,643 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:55:18,643 INFO L87 Difference]: Start difference. First operand 92551 states and 101687 transitions. Second operand has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-08 23:55:23,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:23,720 INFO L93 Difference]: Finished difference Result 203278 states and 225392 transitions. [2025-01-08 23:55:23,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:55:23,721 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 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 371 [2025-01-08 23:55:23,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:23,846 INFO L225 Difference]: With dead ends: 203278 [2025-01-08 23:55:23,846 INFO L226 Difference]: Without dead ends: 124905 [2025-01-08 23:55:23,877 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-08 23:55:23,878 INFO L435 NwaCegarLoop]: 639 mSDtfsCounter, 1631 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 5232 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1631 SdHoareTripleChecker+Valid, 866 SdHoareTripleChecker+Invalid, 6100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 5232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:23,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1631 Valid, 866 Invalid, 6100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 5232 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2025-01-08 23:55:23,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124905 states. [2025-01-08 23:55:25,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124905 to 109097. [2025-01-08 23:55:25,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109097 states, 109096 states have (on average 1.090443279313632) internal successors, (118963), 109096 states have internal predecessors, (118963), 0 states have call successors, (0), 0 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-08 23:55:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109097 states to 109097 states and 118963 transitions. [2025-01-08 23:55:25,227 INFO L78 Accepts]: Start accepts. Automaton has 109097 states and 118963 transitions. Word has length 371 [2025-01-08 23:55:25,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:25,227 INFO L471 AbstractCegarLoop]: Abstraction has 109097 states and 118963 transitions. [2025-01-08 23:55:25,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 47.25) internal successors, (189), 3 states have internal predecessors, (189), 0 states have call successors, (0), 0 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-08 23:55:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 109097 states and 118963 transitions. [2025-01-08 23:55:25,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 374 [2025-01-08 23:55:25,231 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:25,231 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:25,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:55:25,231 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:25,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:25,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1753383117, now seen corresponding path program 1 times [2025-01-08 23:55:25,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:25,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736390342] [2025-01-08 23:55:25,232 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:25,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:25,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 373 statements into 1 equivalence classes. [2025-01-08 23:55:25,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 373 of 373 statements. [2025-01-08 23:55:25,265 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:25,265 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:25,507 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 167 proven. 0 refuted. 0 times theorem prover too weak. 445 trivial. 0 not checked. [2025-01-08 23:55:25,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:25,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736390342] [2025-01-08 23:55:25,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [736390342] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:25,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:25,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:25,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373859861] [2025-01-08 23:55:25,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:25,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:25,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:25,509 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:25,509 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:25,509 INFO L87 Difference]: Start difference. First operand 109097 states and 118963 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-08 23:55:28,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:28,521 INFO L93 Difference]: Finished difference Result 253633 states and 275868 transitions. [2025-01-08 23:55:28,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:28,522 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 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 373 [2025-01-08 23:55:28,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:28,669 INFO L225 Difference]: With dead ends: 253633 [2025-01-08 23:55:28,669 INFO L226 Difference]: Without dead ends: 145325 [2025-01-08 23:55:28,720 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-08 23:55:28,721 INFO L435 NwaCegarLoop]: 1268 mSDtfsCounter, 1059 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 2470 mSolverCounterSat, 713 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 713 IncrementalHoareTripleChecker+Valid, 2470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:28,721 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 1318 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [713 Valid, 2470 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:55:28,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145325 states. [2025-01-08 23:55:29,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145325 to 137417. [2025-01-08 23:55:30,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137417 states, 137416 states have (on average 1.0783605984747044) internal successors, (148184), 137416 states have internal predecessors, (148184), 0 states have call successors, (0), 0 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-08 23:55:30,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137417 states to 137417 states and 148184 transitions. [2025-01-08 23:55:30,205 INFO L78 Accepts]: Start accepts. Automaton has 137417 states and 148184 transitions. Word has length 373 [2025-01-08 23:55:30,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:30,206 INFO L471 AbstractCegarLoop]: Abstraction has 137417 states and 148184 transitions. [2025-01-08 23:55:30,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 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-08 23:55:30,206 INFO L276 IsEmpty]: Start isEmpty. Operand 137417 states and 148184 transitions. [2025-01-08 23:55:30,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 410 [2025-01-08 23:55:30,212 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:30,212 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 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-08 23:55:30,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:55:30,213 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:30,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:30,213 INFO L85 PathProgramCache]: Analyzing trace with hash -584133654, now seen corresponding path program 1 times [2025-01-08 23:55:30,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:30,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631013949] [2025-01-08 23:55:30,213 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:30,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:30,247 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-08 23:55:30,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-08 23:55:30,262 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:30,262 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:30,930 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 457 proven. 25 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-01-08 23:55:30,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:30,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631013949] [2025-01-08 23:55:30,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631013949] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:55:30,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1688124094] [2025-01-08 23:55:30,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:30,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:30,931 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:55:30,933 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-08 23:55:30,934 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-08 23:55:30,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 409 statements into 1 equivalence classes. [2025-01-08 23:55:31,038 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 409 of 409 statements. [2025-01-08 23:55:31,038 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:31,038 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:31,040 INFO L256 TraceCheckSpWp]: Trace formula consists of 572 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:55:31,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:55:31,310 INFO L134 CoverageAnalysis]: Checked inductivity of 634 backedges. 482 proven. 0 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-01-08 23:55:31,311 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:55:31,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1688124094] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:31,311 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:55:31,311 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2025-01-08 23:55:31,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807230737] [2025-01-08 23:55:31,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:31,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:31,311 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:31,312 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:31,312 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:55:31,312 INFO L87 Difference]: Start difference. First operand 137417 states and 148184 transitions. Second operand has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-08 23:55:34,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:34,493 INFO L93 Difference]: Finished difference Result 322041 states and 349345 transitions. [2025-01-08 23:55:34,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 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 409 [2025-01-08 23:55:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:34,918 INFO L225 Difference]: With dead ends: 322041 [2025-01-08 23:55:34,918 INFO L226 Difference]: Without dead ends: 186989 [2025-01-08 23:55:34,976 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 412 GetRequests, 408 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:55:34,976 INFO L435 NwaCegarLoop]: 942 mSDtfsCounter, 729 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 2438 mSolverCounterSat, 759 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 3197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 759 IncrementalHoareTripleChecker+Valid, 2438 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:34,976 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1103 Invalid, 3197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [759 Valid, 2438 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2025-01-08 23:55:35,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186989 states. [2025-01-08 23:55:36,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186989 to 185411. [2025-01-08 23:55:36,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185411 states, 185410 states have (on average 1.0617927835607572) internal successors, (196867), 185410 states have internal predecessors, (196867), 0 states have call successors, (0), 0 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-08 23:55:36,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185411 states to 185411 states and 196867 transitions. [2025-01-08 23:55:36,865 INFO L78 Accepts]: Start accepts. Automaton has 185411 states and 196867 transitions. Word has length 409 [2025-01-08 23:55:36,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:36,865 INFO L471 AbstractCegarLoop]: Abstraction has 185411 states and 196867 transitions. [2025-01-08 23:55:36,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.33333333333333) internal successors, (301), 3 states have internal predecessors, (301), 0 states have call successors, (0), 0 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-08 23:55:36,866 INFO L276 IsEmpty]: Start isEmpty. Operand 185411 states and 196867 transitions. [2025-01-08 23:55:36,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 468 [2025-01-08 23:55:36,875 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:36,875 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 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, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:36,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-08 23:55:37,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:37,076 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:37,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:37,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1364175384, now seen corresponding path program 1 times [2025-01-08 23:55:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:37,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231578561] [2025-01-08 23:55:37,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:37,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-01-08 23:55:37,129 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-01-08 23:55:37,129 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:37,129 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:38,522 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 441 proven. 113 refuted. 0 times theorem prover too weak. 152 trivial. 0 not checked. [2025-01-08 23:55:38,522 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:38,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231578561] [2025-01-08 23:55:38,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231578561] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:55:38,522 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749646706] [2025-01-08 23:55:38,522 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:38,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:38,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:55:38,524 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-08 23:55:38,526 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-08 23:55:38,577 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 467 statements into 1 equivalence classes. [2025-01-08 23:55:38,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 467 of 467 statements. [2025-01-08 23:55:38,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:38,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:38,636 INFO L256 TraceCheckSpWp]: Trace formula consists of 626 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:55:38,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:55:39,101 INFO L134 CoverageAnalysis]: Checked inductivity of 706 backedges. 441 proven. 0 refuted. 0 times theorem prover too weak. 265 trivial. 0 not checked. [2025-01-08 23:55:39,102 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:55:39,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [749646706] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:39,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:55:39,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [7] total 8 [2025-01-08 23:55:39,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993391004] [2025-01-08 23:55:39,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:39,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:39,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:39,103 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:39,103 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:55:39,103 INFO L87 Difference]: Start difference. First operand 185411 states and 196867 transitions. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-08 23:55:41,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:41,548 INFO L93 Difference]: Finished difference Result 362955 states and 385622 transitions. [2025-01-08 23:55:41,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:41,548 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 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 467 [2025-01-08 23:55:41,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:41,770 INFO L225 Difference]: With dead ends: 362955 [2025-01-08 23:55:41,770 INFO L226 Difference]: Without dead ends: 190148 [2025-01-08 23:55:41,865 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 473 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:55:41,865 INFO L435 NwaCegarLoop]: 979 mSDtfsCounter, 685 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2413 mSolverCounterSat, 149 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 1110 SdHoareTripleChecker+Invalid, 2562 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 149 IncrementalHoareTripleChecker+Valid, 2413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:41,866 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 1110 Invalid, 2562 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [149 Valid, 2413 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-08 23:55:42,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190148 states. [2025-01-08 23:55:43,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190148 to 185415. [2025-01-08 23:55:43,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185415 states, 185414 states have (on average 1.0570992481689625) internal successors, (196001), 185414 states have internal predecessors, (196001), 0 states have call successors, (0), 0 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-08 23:55:44,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185415 states to 185415 states and 196001 transitions. [2025-01-08 23:55:44,323 INFO L78 Accepts]: Start accepts. Automaton has 185415 states and 196001 transitions. Word has length 467 [2025-01-08 23:55:44,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:44,323 INFO L471 AbstractCegarLoop]: Abstraction has 185415 states and 196001 transitions. [2025-01-08 23:55:44,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 2 states have internal predecessors, (247), 0 states have call successors, (0), 0 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-08 23:55:44,323 INFO L276 IsEmpty]: Start isEmpty. Operand 185415 states and 196001 transitions. [2025-01-08 23:55:44,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 476 [2025-01-08 23:55:44,329 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:44,329 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:55:44,335 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-08 23:55:44,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:55:44,530 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:44,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:44,530 INFO L85 PathProgramCache]: Analyzing trace with hash -183196298, now seen corresponding path program 1 times [2025-01-08 23:55:44,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:44,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174655433] [2025-01-08 23:55:44,531 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:44,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:44,554 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 475 statements into 1 equivalence classes. [2025-01-08 23:55:44,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 475 of 475 statements. [2025-01-08 23:55:44,572 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:44,572 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:44,742 INFO L134 CoverageAnalysis]: Checked inductivity of 738 backedges. 466 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2025-01-08 23:55:44,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:44,742 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174655433] [2025-01-08 23:55:44,742 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174655433] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:44,742 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:44,742 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:44,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [923919728] [2025-01-08 23:55:44,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:44,743 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:44,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:44,743 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:44,743 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:44,743 INFO L87 Difference]: Start difference. First operand 185415 states and 196001 transitions. Second operand has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 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-08 23:55:48,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:48,393 INFO L93 Difference]: Finished difference Result 417278 states and 442774 transitions. [2025-01-08 23:55:48,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:48,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 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 475 [2025-01-08 23:55:48,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:48,678 INFO L225 Difference]: With dead ends: 417278 [2025-01-08 23:55:48,678 INFO L226 Difference]: Without dead ends: 231078 [2025-01-08 23:55:48,977 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-08 23:55:48,977 INFO L435 NwaCegarLoop]: 1727 mSDtfsCounter, 734 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2480 mSolverCounterSat, 554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 734 SdHoareTripleChecker+Valid, 1867 SdHoareTripleChecker+Invalid, 3034 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 554 IncrementalHoareTripleChecker+Valid, 2480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:48,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [734 Valid, 1867 Invalid, 3034 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [554 Valid, 2480 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2025-01-08 23:55:49,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231078 states. [2025-01-08 23:55:50,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231078 to 226338. [2025-01-08 23:55:50,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226338 states, 226337 states have (on average 1.0490595881362748) internal successors, (237441), 226337 states have internal predecessors, (237441), 0 states have call successors, (0), 0 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-08 23:55:51,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226338 states to 226338 states and 237441 transitions. [2025-01-08 23:55:51,277 INFO L78 Accepts]: Start accepts. Automaton has 226338 states and 237441 transitions. Word has length 475 [2025-01-08 23:55:51,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:55:51,278 INFO L471 AbstractCegarLoop]: Abstraction has 226338 states and 237441 transitions. [2025-01-08 23:55:51,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.66666666666667) internal successors, (293), 3 states have internal predecessors, (293), 0 states have call successors, (0), 0 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-08 23:55:51,278 INFO L276 IsEmpty]: Start isEmpty. Operand 226338 states and 237441 transitions. [2025-01-08 23:55:51,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-01-08 23:55:51,287 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:55:51,288 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 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, 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] [2025-01-08 23:55:51,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:55:51,288 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:55:51,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:55:51,288 INFO L85 PathProgramCache]: Analyzing trace with hash -1435172564, now seen corresponding path program 1 times [2025-01-08 23:55:51,288 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:55:51,288 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422994650] [2025-01-08 23:55:51,289 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:55:51,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:55:51,325 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-01-08 23:55:51,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-01-08 23:55:51,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:55:51,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:55:51,747 INFO L134 CoverageAnalysis]: Checked inductivity of 966 backedges. 533 proven. 0 refuted. 0 times theorem prover too weak. 433 trivial. 0 not checked. [2025-01-08 23:55:51,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:55:51,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422994650] [2025-01-08 23:55:51,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422994650] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:55:51,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:55:51,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:55:51,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324955231] [2025-01-08 23:55:51,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:55:51,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:55:51,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:55:51,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:55:51,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:55:51,748 INFO L87 Difference]: Start difference. First operand 226338 states and 237441 transitions. Second operand has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 0 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-08 23:55:55,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:55:55,197 INFO L93 Difference]: Finished difference Result 492033 states and 518072 transitions. [2025-01-08 23:55:55,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:55:55,197 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 86.33333333333333) internal successors, (259), 3 states have internal predecessors, (259), 0 states have call successors, (0), 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 484 [2025-01-08 23:55:55,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:55:55,506 INFO L225 Difference]: With dead ends: 492033 [2025-01-08 23:55:55,507 INFO L226 Difference]: Without dead ends: 266484 [2025-01-08 23:55:55,603 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-08 23:55:55,604 INFO L435 NwaCegarLoop]: 586 mSDtfsCounter, 912 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 857 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 912 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 857 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:55:55,604 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [912 Valid, 661 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [857 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:55:55,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266484 states.