./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label22.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/Problem11_label22.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 782212e92ca4a15b07e81f4c0ca47da63585acb1e5a128bc81275e5c438e9fe1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-08 23:41:36,838 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-08 23:41:36,878 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:41:36,881 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-08 23:41:36,882 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-08 23:41:36,901 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-08 23:41:36,901 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-08 23:41:36,901 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-08 23:41:36,901 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-08 23:41:36,901 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-08 23:41:36,901 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-08 23:41:36,902 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-08 23:41:36,902 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-08 23:41:36,902 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-08 23:41:36,902 INFO L153 SettingsManager]: * Use SBE=true [2025-01-08 23:41:36,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-08 23:41:36,902 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-08 23:41:36,902 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-08 23:41:36,902 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-08 23:41:36,902 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-08 23:41:36,903 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-08 23:41:36,903 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-08 23:41:36,903 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-08 23:41:36,903 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-08 23:41:36,903 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-08 23:41:36,903 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-08 23:41:36,903 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-08 23:41:36,903 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-08 23:41:36,903 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-08 23:41:36,903 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:41:36,903 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:41:36,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:41:36,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:36,904 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-08 23:41:36,904 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-08 23:41:36,904 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-08 23:41:36,904 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-08 23:41:36,904 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:36,904 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-08 23:41:36,904 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-08 23:41:36,904 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-08 23:41:36,904 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-08 23:41:36,905 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-08 23:41:36,905 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-08 23:41:36,905 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-08 23:41:36,905 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-08 23:41:36,905 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-08 23:41:36,905 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-08 23:41:36,905 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 -> 782212e92ca4a15b07e81f4c0ca47da63585acb1e5a128bc81275e5c438e9fe1 [2025-01-08 23:41:37,127 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-08 23:41:37,135 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-08 23:41:37,138 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-08 23:41:37,139 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-08 23:41:37,140 INFO L274 PluginConnector]: CDTParser initialized [2025-01-08 23:41:37,141 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label22.c [2025-01-08 23:41:38,334 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a6458bcf/1973f851c2fb49a6a97816d75a777b99/FLAG705515ca2 [2025-01-08 23:41:38,679 INFO L384 CDTParser]: Found 1 translation units. [2025-01-08 23:41:38,679 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label22.c [2025-01-08 23:41:38,693 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a6458bcf/1973f851c2fb49a6a97816d75a777b99/FLAG705515ca2 [2025-01-08 23:41:38,882 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2a6458bcf/1973f851c2fb49a6a97816d75a777b99 [2025-01-08 23:41:38,884 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-08 23:41:38,886 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-08 23:41:38,887 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-08 23:41:38,888 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-08 23:41:38,893 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-08 23:41:38,893 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:41:38" (1/1) ... [2025-01-08 23:41:38,894 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6f5732c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:38, skipping insertion in model container [2025-01-08 23:41:38,894 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.01 11:41:38" (1/1) ... [2025-01-08 23:41:38,926 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-08 23:41:39,078 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/Problem11_label22.c[8004,8017] [2025-01-08 23:41:39,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:41:39,222 INFO L200 MainTranslator]: Completed pre-run [2025-01-08 23:41:39,242 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/Problem11_label22.c[8004,8017] [2025-01-08 23:41:39,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-08 23:41:39,331 INFO L204 MainTranslator]: Completed translation [2025-01-08 23:41:39,331 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39 WrapperNode [2025-01-08 23:41:39,331 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-08 23:41:39,332 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-08 23:41:39,332 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-08 23:41:39,332 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-08 23:41:39,337 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:41:39" (1/1) ... [2025-01-08 23:41:39,357 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:41:39" (1/1) ... [2025-01-08 23:41:39,438 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 997 [2025-01-08 23:41:39,439 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-08 23:41:39,439 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-08 23:41:39,439 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-08 23:41:39,439 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-08 23:41:39,447 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39" (1/1) ... [2025-01-08 23:41:39,447 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39" (1/1) ... [2025-01-08 23:41:39,460 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39" (1/1) ... [2025-01-08 23:41:39,524 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:41:39,527 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39" (1/1) ... [2025-01-08 23:41:39,530 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39" (1/1) ... [2025-01-08 23:41:39,561 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39" (1/1) ... [2025-01-08 23:41:39,566 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39" (1/1) ... [2025-01-08 23:41:39,577 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39" (1/1) ... [2025-01-08 23:41:39,583 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39" (1/1) ... [2025-01-08 23:41:39,587 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39" (1/1) ... [2025-01-08 23:41:39,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-08 23:41:39,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-08 23:41:39,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-08 23:41:39,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-08 23:41:39,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39" (1/1) ... [2025-01-08 23:41:39,601 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-08 23:41:39,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:39,621 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:41:39,624 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:41:39,650 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-08 23:41:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-08 23:41:39,651 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-08 23:41:39,651 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-08 23:41:39,695 INFO L234 CfgBuilder]: Building ICFG [2025-01-08 23:41:39,696 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-08 23:41:40,815 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2025-01-08 23:41:40,815 INFO L283 CfgBuilder]: Performing block encoding [2025-01-08 23:41:40,828 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-08 23:41:40,831 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-08 23:41:40,831 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:40 BoogieIcfgContainer [2025-01-08 23:41:40,831 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-08 23:41:40,833 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-08 23:41:40,833 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-08 23:41:40,836 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-08 23:41:40,836 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.01 11:41:38" (1/3) ... [2025-01-08 23:41:40,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622dfe5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:41:40, skipping insertion in model container [2025-01-08 23:41:40,837 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.01 11:41:39" (2/3) ... [2025-01-08 23:41:40,837 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@622dfe5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.01 11:41:40, skipping insertion in model container [2025-01-08 23:41:40,838 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:40" (3/3) ... [2025-01-08 23:41:40,838 INFO L128 eAbstractionObserver]: Analyzing ICFG Problem11_label22.c [2025-01-08 23:41:40,848 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-08 23:41:40,849 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Problem11_label22.c that has 1 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-08 23:41:40,914 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-08 23:41:40,924 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;@425d30c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-08 23:41:40,924 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-08 23:41:40,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 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:41:40,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2025-01-08 23:41:40,930 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:40,931 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:40,931 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:40,933 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:40,934 INFO L85 PathProgramCache]: Analyzing trace with hash -257801140, now seen corresponding path program 1 times [2025-01-08 23:41:40,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:40,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620117873] [2025-01-08 23:41:40,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:40,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:40,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 55 statements into 1 equivalence classes. [2025-01-08 23:41:41,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 55 of 55 statements. [2025-01-08 23:41:41,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:41,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:41,217 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:41:41,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:41,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620117873] [2025-01-08 23:41:41,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620117873] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:41,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:41,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:41,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1079554009] [2025-01-08 23:41:41,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:41,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:41,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:41,233 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:41,233 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:41,235 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7117437722419928) internal successors, (481), 282 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:42,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:42,091 INFO L93 Difference]: Finished difference Result 761 states and 1342 transitions. [2025-01-08 23:41:42,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:42,093 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 55 [2025-01-08 23:41:42,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:42,100 INFO L225 Difference]: With dead ends: 761 [2025-01-08 23:41:42,101 INFO L226 Difference]: Without dead ends: 413 [2025-01-08 23:41:42,103 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:41:42,105 INFO L435 NwaCegarLoop]: 191 mSDtfsCounter, 173 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:42,106 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 223 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:41:42,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2025-01-08 23:41:42,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2025-01-08 23:41:42,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 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:41:42,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2025-01-08 23:41:42,141 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 55 [2025-01-08 23:41:42,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:42,141 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2025-01-08 23:41:42,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.333333333333332) internal successors, (55), 2 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:42,142 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2025-01-08 23:41:42,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2025-01-08 23:41:42,144 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:42,144 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:42,145 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-08 23:41:42,145 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:42,145 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:42,145 INFO L85 PathProgramCache]: Analyzing trace with hash -336487565, now seen corresponding path program 1 times [2025-01-08 23:41:42,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:42,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474105346] [2025-01-08 23:41:42,146 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:42,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:42,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 123 statements into 1 equivalence classes. [2025-01-08 23:41:42,199 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 123 of 123 statements. [2025-01-08 23:41:42,200 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:42,200 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:42,330 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:42,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:42,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474105346] [2025-01-08 23:41:42,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474105346] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:42,330 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:42,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:42,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590676952] [2025-01-08 23:41:42,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:42,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:42,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:42,332 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:42,332 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:42,333 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:41:42,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:42,936 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2025-01-08 23:41:42,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:42,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2025-01-08 23:41:42,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:42,939 INFO L225 Difference]: With dead ends: 1211 [2025-01-08 23:41:42,939 INFO L226 Difference]: Without dead ends: 800 [2025-01-08 23:41:42,940 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:41:42,941 INFO L435 NwaCegarLoop]: 102 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:42,941 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 121 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:42,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-08 23:41:42,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2025-01-08 23:41:42,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 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:41:42,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2025-01-08 23:41:42,979 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 123 [2025-01-08 23:41:42,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:42,980 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2025-01-08 23:41:42,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 0 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:41:42,981 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2025-01-08 23:41:42,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2025-01-08 23:41:42,982 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:42,982 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:42,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-08 23:41:42,983 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:42,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:42,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1012257192, now seen corresponding path program 1 times [2025-01-08 23:41:42,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:42,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357746917] [2025-01-08 23:41:42,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:42,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:42,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 125 statements into 1 equivalence classes. [2025-01-08 23:41:43,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 125 of 125 statements. [2025-01-08 23:41:43,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:43,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:43,203 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:43,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:43,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357746917] [2025-01-08 23:41:43,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357746917] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:43,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:43,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:41:43,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190027432] [2025-01-08 23:41:43,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:43,203 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:43,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:43,204 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:43,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:43,204 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:41:43,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:43,812 INFO L93 Difference]: Finished difference Result 2316 states and 3182 transitions. [2025-01-08 23:41:43,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:43,813 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 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 125 [2025-01-08 23:41:43,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:43,830 INFO L225 Difference]: With dead ends: 2316 [2025-01-08 23:41:43,830 INFO L226 Difference]: Without dead ends: 1529 [2025-01-08 23:41:43,831 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:41:43,831 INFO L435 NwaCegarLoop]: 170 mSDtfsCounter, 121 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:43,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 194 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:43,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1529 states. [2025-01-08 23:41:43,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1529 to 1526. [2025-01-08 23:41:43,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1526 states, 1525 states have (on average 1.2177049180327868) internal successors, (1857), 1525 states have internal predecessors, (1857), 0 states have call successors, (0), 0 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:41:43,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1526 states to 1526 states and 1857 transitions. [2025-01-08 23:41:43,853 INFO L78 Accepts]: Start accepts. Automaton has 1526 states and 1857 transitions. Word has length 125 [2025-01-08 23:41:43,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:43,853 INFO L471 AbstractCegarLoop]: Abstraction has 1526 states and 1857 transitions. [2025-01-08 23:41:43,853 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 2 states have internal predecessors, (125), 0 states have call successors, (0), 0 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:41:43,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1526 states and 1857 transitions. [2025-01-08 23:41:43,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2025-01-08 23:41:43,855 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:43,855 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:43,855 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-08 23:41:43,855 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:43,855 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:43,856 INFO L85 PathProgramCache]: Analyzing trace with hash -527083811, now seen corresponding path program 1 times [2025-01-08 23:41:43,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:43,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330645448] [2025-01-08 23:41:43,856 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:43,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:43,872 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 182 statements into 1 equivalence classes. [2025-01-08 23:41:43,886 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 182 of 182 statements. [2025-01-08 23:41:43,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:43,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:44,055 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:44,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:44,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330645448] [2025-01-08 23:41:44,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [330645448] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:44,056 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:44,056 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:44,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123386806] [2025-01-08 23:41:44,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:44,056 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:44,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:44,057 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:44,057 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:44,057 INFO L87 Difference]: Start difference. First operand 1526 states and 1857 transitions. Second operand has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:44,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:44,608 INFO L93 Difference]: Finished difference Result 3257 states and 4125 transitions. [2025-01-08 23:41:44,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:44,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 182 [2025-01-08 23:41:44,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:44,613 INFO L225 Difference]: With dead ends: 3257 [2025-01-08 23:41:44,613 INFO L226 Difference]: Without dead ends: 1917 [2025-01-08 23:41:44,614 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:41:44,614 INFO L435 NwaCegarLoop]: 288 mSDtfsCounter, 180 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:44,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 320 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:41:44,619 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1917 states. [2025-01-08 23:41:44,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1917 to 1914. [2025-01-08 23:41:44,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1914 states, 1913 states have (on average 1.246732880292734) internal successors, (2385), 1913 states have internal predecessors, (2385), 0 states have call successors, (0), 0 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:41:44,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1914 states to 1914 states and 2385 transitions. [2025-01-08 23:41:44,649 INFO L78 Accepts]: Start accepts. Automaton has 1914 states and 2385 transitions. Word has length 182 [2025-01-08 23:41:44,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:44,649 INFO L471 AbstractCegarLoop]: Abstraction has 1914 states and 2385 transitions. [2025-01-08 23:41:44,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 60.666666666666664) internal successors, (182), 3 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:44,650 INFO L276 IsEmpty]: Start isEmpty. Operand 1914 states and 2385 transitions. [2025-01-08 23:41:44,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2025-01-08 23:41:44,651 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:44,652 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:44,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-08 23:41:44,652 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:44,652 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:44,652 INFO L85 PathProgramCache]: Analyzing trace with hash -879184069, now seen corresponding path program 1 times [2025-01-08 23:41:44,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:44,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10657260] [2025-01-08 23:41:44,653 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:44,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:44,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 237 statements into 1 equivalence classes. [2025-01-08 23:41:44,721 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 237 of 237 statements. [2025-01-08 23:41:44,721 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:44,721 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:44,867 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2025-01-08 23:41:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:44,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10657260] [2025-01-08 23:41:44,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10657260] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:44,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:44,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912417348] [2025-01-08 23:41:44,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:44,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:44,869 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:44,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:44,869 INFO L87 Difference]: Start difference. First operand 1914 states and 2385 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) 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:41:45,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:45,485 INFO L93 Difference]: Finished difference Result 4389 states and 5592 transitions. [2025-01-08 23:41:45,485 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:45,486 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) 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 237 [2025-01-08 23:41:45,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:45,493 INFO L225 Difference]: With dead ends: 4389 [2025-01-08 23:41:45,493 INFO L226 Difference]: Without dead ends: 2661 [2025-01-08 23:41:45,495 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:41:45,497 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 142 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:45,497 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 391 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:45,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2661 states. [2025-01-08 23:41:45,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2661 to 2467. [2025-01-08 23:41:45,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2467 states, 2466 states have (on average 1.235198702351987) internal successors, (3046), 2466 states have internal predecessors, (3046), 0 states have call successors, (0), 0 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:41:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2467 states to 2467 states and 3046 transitions. [2025-01-08 23:41:45,529 INFO L78 Accepts]: Start accepts. Automaton has 2467 states and 3046 transitions. Word has length 237 [2025-01-08 23:41:45,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:45,530 INFO L471 AbstractCegarLoop]: Abstraction has 2467 states and 3046 transitions. [2025-01-08 23:41:45,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) 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:41:45,531 INFO L276 IsEmpty]: Start isEmpty. Operand 2467 states and 3046 transitions. [2025-01-08 23:41:45,533 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 244 [2025-01-08 23:41:45,533 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:45,533 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:45,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-08 23:41:45,533 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:45,533 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:45,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1788902998, now seen corresponding path program 1 times [2025-01-08 23:41:45,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:45,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157377159] [2025-01-08 23:41:45,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:45,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:45,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-08 23:41:45,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-08 23:41:45,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:45,598 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:45,986 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 91 proven. 14 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 23:41:45,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:45,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157377159] [2025-01-08 23:41:45,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157377159] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:41:45,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [987846499] [2025-01-08 23:41:45,988 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:45,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:45,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:45,993 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:41:45,995 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:41:46,038 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 243 statements into 1 equivalence classes. [2025-01-08 23:41:46,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 243 of 243 statements. [2025-01-08 23:41:46,080 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:46,080 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:46,082 INFO L256 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-08 23:41:46,092 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:41:46,178 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2025-01-08 23:41:46,179 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:41:46,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [987846499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:46,179 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:41:46,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2025-01-08 23:41:46,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083608691] [2025-01-08 23:41:46,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:46,179 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:46,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:46,180 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:46,180 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:41:46,180 INFO L87 Difference]: Start difference. First operand 2467 states and 3046 transitions. Second operand has 3 states, 3 states have (on average 56.333333333333336) 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:41:46,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:46,805 INFO L93 Difference]: Finished difference Result 6409 states and 8063 transitions. [2025-01-08 23:41:46,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:46,806 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 56.333333333333336) 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 243 [2025-01-08 23:41:46,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:46,815 INFO L225 Difference]: With dead ends: 6409 [2025-01-08 23:41:46,815 INFO L226 Difference]: Without dead ends: 3944 [2025-01-08 23:41:46,818 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 247 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:41:46,818 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 175 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 507 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 695 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:46,819 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 270 Invalid, 695 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 507 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:46,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3944 states. [2025-01-08 23:41:46,855 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3944 to 3941. [2025-01-08 23:41:46,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3941 states, 3940 states have (on average 1.232233502538071) internal successors, (4855), 3940 states have internal predecessors, (4855), 0 states have call successors, (0), 0 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:41:46,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3941 states to 3941 states and 4855 transitions. [2025-01-08 23:41:46,867 INFO L78 Accepts]: Start accepts. Automaton has 3941 states and 4855 transitions. Word has length 243 [2025-01-08 23:41:46,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:46,867 INFO L471 AbstractCegarLoop]: Abstraction has 3941 states and 4855 transitions. [2025-01-08 23:41:46,867 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 56.333333333333336) 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:41:46,867 INFO L276 IsEmpty]: Start isEmpty. Operand 3941 states and 4855 transitions. [2025-01-08 23:41:46,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2025-01-08 23:41:46,871 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:46,871 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:41:46,881 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:41:47,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:47,075 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:47,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:47,076 INFO L85 PathProgramCache]: Analyzing trace with hash 537416411, now seen corresponding path program 1 times [2025-01-08 23:41:47,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:47,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918953664] [2025-01-08 23:41:47,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:47,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:47,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 282 statements into 1 equivalence classes. [2025-01-08 23:41:47,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 282 of 282 statements. [2025-01-08 23:41:47,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:47,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:47,314 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 204 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:47,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:47,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918953664] [2025-01-08 23:41:47,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918953664] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:47,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:47,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:47,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49983593] [2025-01-08 23:41:47,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:47,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:41:47,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:47,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:41:47,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:41:47,316 INFO L87 Difference]: Start difference. First operand 3941 states and 4855 transitions. Second operand has 4 states, 4 states have (on average 70.5) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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:41:48,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:48,301 INFO L93 Difference]: Finished difference Result 12152 states and 15361 transitions. [2025-01-08 23:41:48,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:41:48,301 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 70.5) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 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 282 [2025-01-08 23:41:48,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:48,322 INFO L225 Difference]: With dead ends: 12152 [2025-01-08 23:41:48,323 INFO L226 Difference]: Without dead ends: 8397 [2025-01-08 23:41:48,327 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:41:48,328 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 289 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 1078 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 1250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 1078 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:48,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 86 Invalid, 1250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 1078 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:41:48,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8397 states. [2025-01-08 23:41:48,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8397 to 8395. [2025-01-08 23:41:48,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8395 states, 8394 states have (on average 1.2445794615201333) internal successors, (10447), 8394 states have internal predecessors, (10447), 0 states have call successors, (0), 0 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:41:48,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8395 states to 8395 states and 10447 transitions. [2025-01-08 23:41:48,477 INFO L78 Accepts]: Start accepts. Automaton has 8395 states and 10447 transitions. Word has length 282 [2025-01-08 23:41:48,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:48,478 INFO L471 AbstractCegarLoop]: Abstraction has 8395 states and 10447 transitions. [2025-01-08 23:41:48,478 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 70.5) internal successors, (282), 3 states have internal predecessors, (282), 0 states have call successors, (0), 0 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:41:48,478 INFO L276 IsEmpty]: Start isEmpty. Operand 8395 states and 10447 transitions. [2025-01-08 23:41:48,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2025-01-08 23:41:48,482 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:48,482 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:41:48,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-08 23:41:48,483 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:48,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:48,483 INFO L85 PathProgramCache]: Analyzing trace with hash -1987693624, now seen corresponding path program 1 times [2025-01-08 23:41:48,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:48,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804511686] [2025-01-08 23:41:48,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:48,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:48,506 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 291 statements into 1 equivalence classes. [2025-01-08 23:41:48,522 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 291 of 291 statements. [2025-01-08 23:41:48,522 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:48,522 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:48,658 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2025-01-08 23:41:48,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:48,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804511686] [2025-01-08 23:41:48,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804511686] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:48,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:48,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:48,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945997656] [2025-01-08 23:41:48,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:48,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:48,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:48,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:48,661 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:48,661 INFO L87 Difference]: Start difference. First operand 8395 states and 10447 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 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:41:49,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:49,323 INFO L93 Difference]: Finished difference Result 19009 states and 23854 transitions. [2025-01-08 23:41:49,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:49,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 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 291 [2025-01-08 23:41:49,324 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:49,351 INFO L225 Difference]: With dead ends: 19009 [2025-01-08 23:41:49,352 INFO L226 Difference]: Without dead ends: 10800 [2025-01-08 23:41:49,363 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:41:49,363 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 141 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 580 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 672 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:49,363 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 384 Invalid, 672 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 580 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:49,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10800 states. [2025-01-08 23:41:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10800 to 10786. [2025-01-08 23:41:49,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10786 states, 10785 states have (on average 1.2123319425127492) internal successors, (13075), 10785 states have internal predecessors, (13075), 0 states have call successors, (0), 0 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:41:49,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10786 states to 10786 states and 13075 transitions. [2025-01-08 23:41:49,492 INFO L78 Accepts]: Start accepts. Automaton has 10786 states and 13075 transitions. Word has length 291 [2025-01-08 23:41:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:49,493 INFO L471 AbstractCegarLoop]: Abstraction has 10786 states and 13075 transitions. [2025-01-08 23:41:49,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 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:41:49,493 INFO L276 IsEmpty]: Start isEmpty. Operand 10786 states and 13075 transitions. [2025-01-08 23:41:49,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2025-01-08 23:41:49,500 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:49,500 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:49,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-08 23:41:49,500 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:49,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:49,501 INFO L85 PathProgramCache]: Analyzing trace with hash -717897635, now seen corresponding path program 1 times [2025-01-08 23:41:49,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:49,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444120586] [2025-01-08 23:41:49,501 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:49,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:49,525 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-08 23:41:49,542 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-08 23:41:49,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:49,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:50,131 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 173 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:50,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:50,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444120586] [2025-01-08 23:41:50,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444120586] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:41:50,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1242767962] [2025-01-08 23:41:50,132 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:50,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:50,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:50,135 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:41:50,137 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:41:50,202 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 329 statements into 1 equivalence classes. [2025-01-08 23:41:50,260 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 329 of 329 statements. [2025-01-08 23:41:50,260 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:50,260 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:50,261 INFO L256 TraceCheckSpWp]: Trace formula consists of 439 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-08 23:41:50,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:41:51,544 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 173 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:51,545 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:41:53,193 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 173 proven. 43 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:53,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1242767962] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:41:53,194 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:41:53,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-01-08 23:41:53,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306031785] [2025-01-08 23:41:53,194 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:41:53,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-08 23:41:53,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:53,197 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-08 23:41:53,197 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:41:53,197 INFO L87 Difference]: Start difference. First operand 10786 states and 13075 transitions. Second operand has 8 states, 8 states have (on average 72.625) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 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:41:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:55,247 INFO L93 Difference]: Finished difference Result 24936 states and 30414 transitions. [2025-01-08 23:41:55,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-08 23:41:55,248 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 72.625) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 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 329 [2025-01-08 23:41:55,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:55,271 INFO L225 Difference]: With dead ends: 24936 [2025-01-08 23:41:55,272 INFO L226 Difference]: Without dead ends: 14889 [2025-01-08 23:41:55,280 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 667 GetRequests, 654 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=135, Unknown=0, NotChecked=0, Total=210 [2025-01-08 23:41:55,281 INFO L435 NwaCegarLoop]: 111 mSDtfsCounter, 997 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 997 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 2759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:55,281 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [997 Valid, 180 Invalid, 2759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2025-01-08 23:41:55,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14889 states. [2025-01-08 23:41:55,498 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14889 to 11495. [2025-01-08 23:41:55,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11495 states, 11494 states have (on average 1.1814859926918393) internal successors, (13580), 11494 states have internal predecessors, (13580), 0 states have call successors, (0), 0 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:41:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11495 states to 11495 states and 13580 transitions. [2025-01-08 23:41:55,546 INFO L78 Accepts]: Start accepts. Automaton has 11495 states and 13580 transitions. Word has length 329 [2025-01-08 23:41:55,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:55,546 INFO L471 AbstractCegarLoop]: Abstraction has 11495 states and 13580 transitions. [2025-01-08 23:41:55,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.625) internal successors, (581), 7 states have internal predecessors, (581), 0 states have call successors, (0), 0 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:41:55,546 INFO L276 IsEmpty]: Start isEmpty. Operand 11495 states and 13580 transitions. [2025-01-08 23:41:55,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 350 [2025-01-08 23:41:55,562 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:55,562 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-01-08 23:41:55,575 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:41:55,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:55,763 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:55,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:55,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1647839721, now seen corresponding path program 1 times [2025-01-08 23:41:55,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:55,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968122802] [2025-01-08 23:41:55,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:55,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:55,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 349 statements into 1 equivalence classes. [2025-01-08 23:41:55,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 349 of 349 statements. [2025-01-08 23:41:55,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:55,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:56,031 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 367 proven. 0 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-01-08 23:41:56,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:56,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968122802] [2025-01-08 23:41:56,032 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968122802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:56,032 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:56,032 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:56,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075242915] [2025-01-08 23:41:56,032 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:56,032 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:56,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:56,033 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:56,033 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:56,033 INFO L87 Difference]: Start difference. First operand 11495 states and 13580 transitions. Second operand has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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:41:56,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:56,681 INFO L93 Difference]: Finished difference Result 27977 states and 33232 transitions. [2025-01-08 23:41:56,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:56,682 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 349 [2025-01-08 23:41:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:56,718 INFO L225 Difference]: With dead ends: 27977 [2025-01-08 23:41:56,719 INFO L226 Difference]: Without dead ends: 17220 [2025-01-08 23:41:56,728 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:41:56,728 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 139 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 594 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 594 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:56,729 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [139 Valid, 142 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 594 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17220 states. [2025-01-08 23:41:56,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17220 to 17216. [2025-01-08 23:41:56,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17216 states, 17215 states have (on average 1.1631135637525414) internal successors, (20023), 17215 states have internal predecessors, (20023), 0 states have call successors, (0), 0 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:41:56,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17216 states to 17216 states and 20023 transitions. [2025-01-08 23:41:56,873 INFO L78 Accepts]: Start accepts. Automaton has 17216 states and 20023 transitions. Word has length 349 [2025-01-08 23:41:56,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:56,874 INFO L471 AbstractCegarLoop]: Abstraction has 17216 states and 20023 transitions. [2025-01-08 23:41:56,874 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 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:41:56,874 INFO L276 IsEmpty]: Start isEmpty. Operand 17216 states and 20023 transitions. [2025-01-08 23:41:56,883 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 358 [2025-01-08 23:41:56,883 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:56,883 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2025-01-08 23:41:56,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-08 23:41:56,884 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:56,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash 1914048236, now seen corresponding path program 1 times [2025-01-08 23:41:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:56,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132255157] [2025-01-08 23:41:56,885 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:56,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:56,906 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 357 statements into 1 equivalence classes. [2025-01-08 23:41:56,923 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 357 of 357 statements. [2025-01-08 23:41:56,923 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:56,923 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 229 backedges. 229 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-08 23:41:57,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:57,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132255157] [2025-01-08 23:41:57,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132255157] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:57,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:57,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:57,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823007333] [2025-01-08 23:41:57,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:57,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:41:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:57,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:41:57,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:41:57,100 INFO L87 Difference]: Start difference. First operand 17216 states and 20023 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:57,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:57,725 INFO L93 Difference]: Finished difference Result 36646 states and 42669 transitions. [2025-01-08 23:41:57,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:41:57,725 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 357 [2025-01-08 23:41:57,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:57,752 INFO L225 Difference]: With dead ends: 36646 [2025-01-08 23:41:57,752 INFO L226 Difference]: Without dead ends: 20536 [2025-01-08 23:41:57,765 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:41:57,766 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 58 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:57,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 76 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:41:57,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20536 states. [2025-01-08 23:41:57,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20536 to 20528. [2025-01-08 23:41:57,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20528 states, 20527 states have (on average 1.152579529400302) internal successors, (23659), 20527 states have internal predecessors, (23659), 0 states have call successors, (0), 0 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:41:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20528 states to 20528 states and 23659 transitions. [2025-01-08 23:41:58,005 INFO L78 Accepts]: Start accepts. Automaton has 20528 states and 23659 transitions. Word has length 357 [2025-01-08 23:41:58,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:58,006 INFO L471 AbstractCegarLoop]: Abstraction has 20528 states and 23659 transitions. [2025-01-08 23:41:58,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:41:58,006 INFO L276 IsEmpty]: Start isEmpty. Operand 20528 states and 23659 transitions. [2025-01-08 23:41:58,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2025-01-08 23:41:58,020 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:58,020 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 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] [2025-01-08 23:41:58,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-08 23:41:58,021 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:58,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:58,021 INFO L85 PathProgramCache]: Analyzing trace with hash 687626192, now seen corresponding path program 1 times [2025-01-08 23:41:58,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:58,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850566497] [2025-01-08 23:41:58,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:58,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:58,054 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 359 statements into 1 equivalence classes. [2025-01-08 23:41:58,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 359 of 359 statements. [2025-01-08 23:41:58,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:58,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:58,317 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 339 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2025-01-08 23:41:58,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:58,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850566497] [2025-01-08 23:41:58,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850566497] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:41:58,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:41:58,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:41:58,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732316925] [2025-01-08 23:41:58,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:41:58,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:41:58,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:41:58,319 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:41:58,319 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:41:58,319 INFO L87 Difference]: Start difference. First operand 20528 states and 23659 transitions. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 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:41:59,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:41:59,315 INFO L93 Difference]: Finished difference Result 44954 states and 52367 transitions. [2025-01-08 23:41:59,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:41:59,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 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 359 [2025-01-08 23:41:59,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:41:59,346 INFO L225 Difference]: With dead ends: 44954 [2025-01-08 23:41:59,346 INFO L226 Difference]: Without dead ends: 26454 [2025-01-08 23:41:59,357 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:41:59,357 INFO L435 NwaCegarLoop]: 64 mSDtfsCounter, 260 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1092 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 260 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 1257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1092 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:41:59,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [260 Valid, 101 Invalid, 1257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1092 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:41:59,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26454 states. [2025-01-08 23:41:59,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26454 to 22569. [2025-01-08 23:41:59,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22569 states, 22568 states have (on average 1.152339595887983) internal successors, (26006), 22568 states have internal predecessors, (26006), 0 states have call successors, (0), 0 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:41:59,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22569 states to 22569 states and 26006 transitions. [2025-01-08 23:41:59,518 INFO L78 Accepts]: Start accepts. Automaton has 22569 states and 26006 transitions. Word has length 359 [2025-01-08 23:41:59,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:41:59,518 INFO L471 AbstractCegarLoop]: Abstraction has 22569 states and 26006 transitions. [2025-01-08 23:41:59,518 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 3 states have internal predecessors, (279), 0 states have call successors, (0), 0 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:41:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 22569 states and 26006 transitions. [2025-01-08 23:41:59,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 361 [2025-01-08 23:41:59,525 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:41:59,525 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:41:59,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-08 23:41:59,525 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:41:59,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:41:59,525 INFO L85 PathProgramCache]: Analyzing trace with hash -1066619863, now seen corresponding path program 1 times [2025-01-08 23:41:59,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:41:59,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620240049] [2025-01-08 23:41:59,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:59,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:41:59,546 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-08 23:41:59,559 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-08 23:41:59,559 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:41:59,559 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:41:59,905 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-08 23:41:59,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:41:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620240049] [2025-01-08 23:41:59,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620240049] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:41:59,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951334003] [2025-01-08 23:41:59,905 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:41:59,905 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:41:59,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:41:59,907 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:41:59,909 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:41:59,950 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 360 statements into 1 equivalence classes. [2025-01-08 23:42:00,001 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 360 of 360 statements. [2025-01-08 23:42:00,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:00,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:00,003 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-08 23:42:00,007 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:00,623 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 0 proven. 105 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-08 23:42:00,623 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:42:03,696 INFO L134 CoverageAnalysis]: Checked inductivity of 247 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-08 23:42:03,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951334003] provided 1 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:03,696 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-01-08 23:42:03,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3, 3] total 5 [2025-01-08 23:42:03,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375488219] [2025-01-08 23:42:03,696 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:03,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:03,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:03,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:03,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:42:03,697 INFO L87 Difference]: Start difference. First operand 22569 states and 26006 transitions. Second operand has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 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:42:04,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:04,739 INFO L93 Difference]: Finished difference Result 51623 states and 60004 transitions. [2025-01-08 23:42:04,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:04,740 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 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 360 [2025-01-08 23:42:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:04,765 INFO L225 Difference]: With dead ends: 51623 [2025-01-08 23:42:04,766 INFO L226 Difference]: Without dead ends: 31082 [2025-01-08 23:42:04,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 721 GetRequests, 716 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-01-08 23:42:04,780 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 313 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 313 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:04,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [313 Valid, 180 Invalid, 1036 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-08 23:42:04,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31082 states. [2025-01-08 23:42:04,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31082 to 23121. [2025-01-08 23:42:05,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23121 states, 23120 states have (on average 1.1491782006920415) internal successors, (26569), 23120 states have internal predecessors, (26569), 0 states have call successors, (0), 0 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:42:05,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23121 states to 23121 states and 26569 transitions. [2025-01-08 23:42:05,057 INFO L78 Accepts]: Start accepts. Automaton has 23121 states and 26569 transitions. Word has length 360 [2025-01-08 23:42:05,057 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:05,057 INFO L471 AbstractCegarLoop]: Abstraction has 23121 states and 26569 transitions. [2025-01-08 23:42:05,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.75) internal successors, (219), 3 states have internal predecessors, (219), 0 states have call successors, (0), 0 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:42:05,057 INFO L276 IsEmpty]: Start isEmpty. Operand 23121 states and 26569 transitions. [2025-01-08 23:42:05,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-08 23:42:05,067 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:05,068 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:05,074 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:42:05,268 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:42:05,269 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:05,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:05,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1896650119, now seen corresponding path program 1 times [2025-01-08 23:42:05,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:05,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328104251] [2025-01-08 23:42:05,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:05,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:05,296 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-08 23:42:05,318 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-08 23:42:05,320 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:05,320 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:05,517 INFO L134 CoverageAnalysis]: Checked inductivity of 670 backedges. 552 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2025-01-08 23:42:05,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:05,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328104251] [2025-01-08 23:42:05,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328104251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:05,517 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:05,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:05,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549904145] [2025-01-08 23:42:05,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:05,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:05,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:05,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:05,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:05,522 INFO L87 Difference]: Start difference. First operand 23121 states and 26569 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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:42:06,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:06,192 INFO L93 Difference]: Finished difference Result 45694 states and 52534 transitions. [2025-01-08 23:42:06,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:06,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 430 [2025-01-08 23:42:06,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:06,213 INFO L225 Difference]: With dead ends: 45694 [2025-01-08 23:42:06,214 INFO L226 Difference]: Without dead ends: 24601 [2025-01-08 23:42:06,235 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:42:06,239 INFO L435 NwaCegarLoop]: 125 mSDtfsCounter, 141 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:06,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 145 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:06,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24601 states. [2025-01-08 23:42:06,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24601 to 23123. [2025-01-08 23:42:06,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23123 states, 23122 states have (on average 1.1489058039961941) internal successors, (26565), 23122 states have internal predecessors, (26565), 0 states have call successors, (0), 0 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:42:06,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23123 states to 23123 states and 26565 transitions. [2025-01-08 23:42:06,548 INFO L78 Accepts]: Start accepts. Automaton has 23123 states and 26565 transitions. Word has length 430 [2025-01-08 23:42:06,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:06,548 INFO L471 AbstractCegarLoop]: Abstraction has 23123 states and 26565 transitions. [2025-01-08 23:42:06,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 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:42:06,549 INFO L276 IsEmpty]: Start isEmpty. Operand 23123 states and 26565 transitions. [2025-01-08 23:42:06,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-01-08 23:42:06,558 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:06,559 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:06,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-01-08 23:42:06,559 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:06,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:06,559 INFO L85 PathProgramCache]: Analyzing trace with hash -663006833, now seen corresponding path program 1 times [2025-01-08 23:42:06,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:06,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1776088049] [2025-01-08 23:42:06,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:06,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:06,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-01-08 23:42:06,592 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-01-08 23:42:06,592 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:06,592 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:06,705 INFO L134 CoverageAnalysis]: Checked inductivity of 677 backedges. 487 proven. 0 refuted. 0 times theorem prover too weak. 190 trivial. 0 not checked. [2025-01-08 23:42:06,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:06,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1776088049] [2025-01-08 23:42:06,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1776088049] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:06,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:06,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:06,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034673808] [2025-01-08 23:42:06,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:06,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:06,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:06,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:06,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:06,706 INFO L87 Difference]: Start difference. First operand 23123 states and 26565 transitions. Second operand has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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:42:07,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:07,488 INFO L93 Difference]: Finished difference Result 42942 states and 49453 transitions. [2025-01-08 23:42:07,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:07,488 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 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 433 [2025-01-08 23:42:07,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:07,511 INFO L225 Difference]: With dead ends: 42942 [2025-01-08 23:42:07,511 INFO L226 Difference]: Without dead ends: 21847 [2025-01-08 23:42:07,524 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:42:07,525 INFO L435 NwaCegarLoop]: 317 mSDtfsCounter, 137 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 639 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:07,525 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 334 Invalid, 639 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:42:07,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21847 states. [2025-01-08 23:42:07,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21847 to 21829. [2025-01-08 23:42:07,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21829 states, 21828 states have (on average 1.123556899395272) internal successors, (24525), 21828 states have internal predecessors, (24525), 0 states have call successors, (0), 0 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:42:07,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21829 states to 21829 states and 24525 transitions. [2025-01-08 23:42:07,749 INFO L78 Accepts]: Start accepts. Automaton has 21829 states and 24525 transitions. Word has length 433 [2025-01-08 23:42:07,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:07,749 INFO L471 AbstractCegarLoop]: Abstraction has 21829 states and 24525 transitions. [2025-01-08 23:42:07,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 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:42:07,750 INFO L276 IsEmpty]: Start isEmpty. Operand 21829 states and 24525 transitions. [2025-01-08 23:42:07,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-01-08 23:42:07,759 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:07,759 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:07,759 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-01-08 23:42:07,759 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:07,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:07,760 INFO L85 PathProgramCache]: Analyzing trace with hash 1222230979, now seen corresponding path program 1 times [2025-01-08 23:42:07,760 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:07,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993458209] [2025-01-08 23:42:07,760 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:07,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:07,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-01-08 23:42:07,799 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-01-08 23:42:07,799 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:07,799 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:07,883 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 304 proven. 0 refuted. 0 times theorem prover too weak. 177 trivial. 0 not checked. [2025-01-08 23:42:07,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:07,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993458209] [2025-01-08 23:42:07,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993458209] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:07,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:07,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-08 23:42:07,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017185092] [2025-01-08 23:42:07,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:07,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:07,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:07,885 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:07,885 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:07,885 INFO L87 Difference]: Start difference. First operand 21829 states and 24525 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 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:42:08,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:08,241 INFO L93 Difference]: Finished difference Result 40879 states and 45971 transitions. [2025-01-08 23:42:08,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:08,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 437 [2025-01-08 23:42:08,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:08,259 INFO L225 Difference]: With dead ends: 40879 [2025-01-08 23:42:08,259 INFO L226 Difference]: Without dead ends: 21078 [2025-01-08 23:42:08,272 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:42:08,273 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 189 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 189 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:08,273 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [189 Valid, 40 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-08 23:42:08,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21078 states. [2025-01-08 23:42:08,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21078 to 21069. [2025-01-08 23:42:08,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21069 states, 21068 states have (on average 1.121701158154547) internal successors, (23632), 21068 states have internal predecessors, (23632), 0 states have call successors, (0), 0 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:42:08,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21069 states to 21069 states and 23632 transitions. [2025-01-08 23:42:08,435 INFO L78 Accepts]: Start accepts. Automaton has 21069 states and 23632 transitions. Word has length 437 [2025-01-08 23:42:08,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:08,436 INFO L471 AbstractCegarLoop]: Abstraction has 21069 states and 23632 transitions. [2025-01-08 23:42:08,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 2 states have internal predecessors, (262), 0 states have call successors, (0), 0 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:42:08,436 INFO L276 IsEmpty]: Start isEmpty. Operand 21069 states and 23632 transitions. [2025-01-08 23:42:08,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 454 [2025-01-08 23:42:08,444 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:08,445 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 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:42:08,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-01-08 23:42:08,445 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:08,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:08,445 INFO L85 PathProgramCache]: Analyzing trace with hash -190441191, now seen corresponding path program 1 times [2025-01-08 23:42:08,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:08,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1570099607] [2025-01-08 23:42:08,446 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:08,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:08,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 453 statements into 1 equivalence classes. [2025-01-08 23:42:08,485 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 453 of 453 statements. [2025-01-08 23:42:08,485 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:08,485 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:08,606 INFO L134 CoverageAnalysis]: Checked inductivity of 481 backedges. 357 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-08 23:42:08,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:08,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1570099607] [2025-01-08 23:42:08,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1570099607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:08,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:08,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:08,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801162336] [2025-01-08 23:42:08,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:08,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:08,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:08,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:08,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:08,607 INFO L87 Difference]: Start difference. First operand 21069 states and 23632 transitions. Second operand has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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:42:09,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:09,106 INFO L93 Difference]: Finished difference Result 36586 states and 40844 transitions. [2025-01-08 23:42:09,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:09,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 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 453 [2025-01-08 23:42:09,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:09,119 INFO L225 Difference]: With dead ends: 36586 [2025-01-08 23:42:09,119 INFO L226 Difference]: Without dead ends: 17359 [2025-01-08 23:42:09,128 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:42:09,128 INFO L435 NwaCegarLoop]: 115 mSDtfsCounter, 135 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:09,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 135 Invalid, 549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:09,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17359 states. [2025-01-08 23:42:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17359 to 17175. [2025-01-08 23:42:09,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17175 states, 17174 states have (on average 1.1043437754745546) internal successors, (18966), 17174 states have internal predecessors, (18966), 0 states have call successors, (0), 0 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:42:09,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17175 states to 17175 states and 18966 transitions. [2025-01-08 23:42:09,238 INFO L78 Accepts]: Start accepts. Automaton has 17175 states and 18966 transitions. Word has length 453 [2025-01-08 23:42:09,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:09,239 INFO L471 AbstractCegarLoop]: Abstraction has 17175 states and 18966 transitions. [2025-01-08 23:42:09,239 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.0) internal successors, (330), 3 states have internal predecessors, (330), 0 states have call successors, (0), 0 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:42:09,239 INFO L276 IsEmpty]: Start isEmpty. Operand 17175 states and 18966 transitions. [2025-01-08 23:42:09,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 492 [2025-01-08 23:42:09,248 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:09,248 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:09,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-01-08 23:42:09,248 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:09,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:09,249 INFO L85 PathProgramCache]: Analyzing trace with hash 240493074, now seen corresponding path program 1 times [2025-01-08 23:42:09,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:09,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220155404] [2025-01-08 23:42:09,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:09,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:09,274 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 491 statements into 1 equivalence classes. [2025-01-08 23:42:09,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 491 of 491 statements. [2025-01-08 23:42:09,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:09,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:09,626 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2025-01-08 23:42:09,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:09,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220155404] [2025-01-08 23:42:09,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220155404] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:09,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:09,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:09,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758296718] [2025-01-08 23:42:09,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:09,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-08 23:42:09,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:09,627 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-08 23:42:09,627 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-08 23:42:09,627 INFO L87 Difference]: Start difference. First operand 17175 states and 18966 transitions. Second operand has 5 states, 5 states have (on average 73.6) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:42:10,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:10,487 INFO L93 Difference]: Finished difference Result 32586 states and 36025 transitions. [2025-01-08 23:42:10,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 23:42:10,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 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 491 [2025-01-08 23:42:10,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:10,502 INFO L225 Difference]: With dead ends: 32586 [2025-01-08 23:42:10,502 INFO L226 Difference]: Without dead ends: 17439 [2025-01-08 23:42:10,510 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:42:10,511 INFO L435 NwaCegarLoop]: 30 mSDtfsCounter, 268 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 1245 mSolverCounterSat, 132 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 1377 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 132 IncrementalHoareTripleChecker+Valid, 1245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:10,511 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 55 Invalid, 1377 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [132 Valid, 1245 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:10,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17439 states. [2025-01-08 23:42:10,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17439 to 17360. [2025-01-08 23:42:10,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17360 states, 17359 states have (on average 1.1028861109510917) internal successors, (19145), 17359 states have internal predecessors, (19145), 0 states have call successors, (0), 0 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:42:10,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17360 states to 17360 states and 19145 transitions. [2025-01-08 23:42:10,637 INFO L78 Accepts]: Start accepts. Automaton has 17360 states and 19145 transitions. Word has length 491 [2025-01-08 23:42:10,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:10,638 INFO L471 AbstractCegarLoop]: Abstraction has 17360 states and 19145 transitions. [2025-01-08 23:42:10,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.6) internal successors, (368), 4 states have internal predecessors, (368), 0 states have call successors, (0), 0 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:42:10,638 INFO L276 IsEmpty]: Start isEmpty. Operand 17360 states and 19145 transitions. [2025-01-08 23:42:10,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 514 [2025-01-08 23:42:10,648 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:10,649 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:10,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-01-08 23:42:10,649 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:10,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:10,649 INFO L85 PathProgramCache]: Analyzing trace with hash 1493507914, now seen corresponding path program 1 times [2025-01-08 23:42:10,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:10,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364375251] [2025-01-08 23:42:10,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:10,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:10,676 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 513 statements into 1 equivalence classes. [2025-01-08 23:42:10,692 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 513 of 513 statements. [2025-01-08 23:42:10,692 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:10,692 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:10,832 INFO L134 CoverageAnalysis]: Checked inductivity of 841 backedges. 685 proven. 0 refuted. 0 times theorem prover too weak. 156 trivial. 0 not checked. [2025-01-08 23:42:10,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:10,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364375251] [2025-01-08 23:42:10,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1364375251] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:10,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:10,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:10,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603347393] [2025-01-08 23:42:10,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:10,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:10,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:10,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:10,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:10,833 INFO L87 Difference]: Start difference. First operand 17360 states and 19145 transitions. Second operand has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:11,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:11,532 INFO L93 Difference]: Finished difference Result 35270 states and 38918 transitions. [2025-01-08 23:42:11,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:11,533 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 513 [2025-01-08 23:42:11,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:11,549 INFO L225 Difference]: With dead ends: 35270 [2025-01-08 23:42:11,549 INFO L226 Difference]: Without dead ends: 19016 [2025-01-08 23:42:11,554 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:42:11,555 INFO L435 NwaCegarLoop]: 344 mSDtfsCounter, 63 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:11,555 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 368 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:11,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19016 states. [2025-01-08 23:42:11,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19016 to 18096. [2025-01-08 23:42:11,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18096 states, 18095 states have (on average 1.100690798563139) internal successors, (19917), 18095 states have internal predecessors, (19917), 0 states have call successors, (0), 0 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:42:11,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18096 states to 18096 states and 19917 transitions. [2025-01-08 23:42:11,763 INFO L78 Accepts]: Start accepts. Automaton has 18096 states and 19917 transitions. Word has length 513 [2025-01-08 23:42:11,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:11,767 INFO L471 AbstractCegarLoop]: Abstraction has 18096 states and 19917 transitions. [2025-01-08 23:42:11,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 18096 states and 19917 transitions. [2025-01-08 23:42:11,797 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 546 [2025-01-08 23:42:11,800 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:11,801 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:11,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-01-08 23:42:11,801 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:11,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:11,802 INFO L85 PathProgramCache]: Analyzing trace with hash 232279912, now seen corresponding path program 1 times [2025-01-08 23:42:11,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:11,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674656859] [2025-01-08 23:42:11,802 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:11,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:11,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 545 statements into 1 equivalence classes. [2025-01-08 23:42:11,887 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 545 of 545 statements. [2025-01-08 23:42:11,888 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:11,888 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:12,169 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 470 proven. 0 refuted. 0 times theorem prover too weak. 142 trivial. 0 not checked. [2025-01-08 23:42:12,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:12,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674656859] [2025-01-08 23:42:12,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674656859] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:12,169 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:12,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:12,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881924170] [2025-01-08 23:42:12,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:12,170 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:12,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:12,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:12,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:12,171 INFO L87 Difference]: Start difference. First operand 18096 states and 19917 transitions. Second operand has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 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:42:12,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:12,742 INFO L93 Difference]: Finished difference Result 37850 states and 41678 transitions. [2025-01-08 23:42:12,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:12,743 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 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 545 [2025-01-08 23:42:12,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:12,765 INFO L225 Difference]: With dead ends: 37850 [2025-01-08 23:42:12,765 INFO L226 Difference]: Without dead ends: 20860 [2025-01-08 23:42:12,777 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:42:12,778 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 55 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 133 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 133 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:12,778 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 64 Invalid, 664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [133 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:12,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20860 states. [2025-01-08 23:42:12,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20860 to 18280. [2025-01-08 23:42:12,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18280 states, 18279 states have (on average 1.1000054707587943) internal successors, (20107), 18279 states have internal predecessors, (20107), 0 states have call successors, (0), 0 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:42:12,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18280 states to 18280 states and 20107 transitions. [2025-01-08 23:42:12,948 INFO L78 Accepts]: Start accepts. Automaton has 18280 states and 20107 transitions. Word has length 545 [2025-01-08 23:42:12,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:12,948 INFO L471 AbstractCegarLoop]: Abstraction has 18280 states and 20107 transitions. [2025-01-08 23:42:12,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 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:42:12,949 INFO L276 IsEmpty]: Start isEmpty. Operand 18280 states and 20107 transitions. [2025-01-08 23:42:12,960 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 556 [2025-01-08 23:42:12,961 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:12,961 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:12,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-01-08 23:42:12,961 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:12,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:12,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1346142147, now seen corresponding path program 1 times [2025-01-08 23:42:12,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:12,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1491074919] [2025-01-08 23:42:12,962 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:12,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:12,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 555 statements into 1 equivalence classes. [2025-01-08 23:42:13,013 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 555 of 555 statements. [2025-01-08 23:42:13,014 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:13,014 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 859 backedges. 653 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-01-08 23:42:13,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:13,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1491074919] [2025-01-08 23:42:13,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1491074919] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:13,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:13,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-08 23:42:13,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26018586] [2025-01-08 23:42:13,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:13,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-08 23:42:13,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:13,773 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-08 23:42:13,773 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-01-08 23:42:13,773 INFO L87 Difference]: Start difference. First operand 18280 states and 20107 transitions. Second operand has 7 states, 7 states have (on average 57.714285714285715) internal successors, (404), 6 states have internal predecessors, (404), 0 states have call successors, (0), 0 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:42:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:14,993 INFO L93 Difference]: Finished difference Result 37115 states and 40805 transitions. [2025-01-08 23:42:14,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-01-08 23:42:14,993 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 57.714285714285715) internal successors, (404), 6 states have internal predecessors, (404), 0 states have call successors, (0), 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 555 [2025-01-08 23:42:14,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:15,013 INFO L225 Difference]: With dead ends: 37115 [2025-01-08 23:42:15,014 INFO L226 Difference]: Without dead ends: 21231 [2025-01-08 23:42:15,025 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-08 23:42:15,026 INFO L435 NwaCegarLoop]: 112 mSDtfsCounter, 251 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 1973 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 2002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 1973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:15,026 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 207 Invalid, 2002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 1973 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-08 23:42:15,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21231 states. [2025-01-08 23:42:15,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21231 to 18832. [2025-01-08 23:42:15,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18832 states, 18831 states have (on average 1.1005788327757422) internal successors, (20725), 18831 states have internal predecessors, (20725), 0 states have call successors, (0), 0 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:42:15,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18832 states to 18832 states and 20725 transitions. [2025-01-08 23:42:15,243 INFO L78 Accepts]: Start accepts. Automaton has 18832 states and 20725 transitions. Word has length 555 [2025-01-08 23:42:15,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:15,243 INFO L471 AbstractCegarLoop]: Abstraction has 18832 states and 20725 transitions. [2025-01-08 23:42:15,243 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.714285714285715) internal successors, (404), 6 states have internal predecessors, (404), 0 states have call successors, (0), 0 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:42:15,243 INFO L276 IsEmpty]: Start isEmpty. Operand 18832 states and 20725 transitions. [2025-01-08 23:42:15,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 566 [2025-01-08 23:42:15,253 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:15,254 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:15,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-01-08 23:42:15,254 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:15,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:15,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1134685764, now seen corresponding path program 1 times [2025-01-08 23:42:15,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:15,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520215607] [2025-01-08 23:42:15,254 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:15,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:15,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-01-08 23:42:15,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-01-08 23:42:15,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:15,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:16,209 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 665 proven. 8 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-01-08 23:42:16,210 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:16,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520215607] [2025-01-08 23:42:16,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520215607] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:16,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [184578785] [2025-01-08 23:42:16,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:16,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:16,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:16,217 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:42:16,219 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-08 23:42:16,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 565 statements into 1 equivalence classes. [2025-01-08 23:42:16,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 565 of 565 statements. [2025-01-08 23:42:16,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:16,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:16,360 INFO L256 TraceCheckSpWp]: Trace formula consists of 729 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-08 23:42:16,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:17,064 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 552 proven. 121 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-01-08 23:42:17,065 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-08 23:42:19,038 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 552 proven. 121 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-01-08 23:42:19,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [184578785] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-08 23:42:19,038 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-08 23:42:19,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 3, 3] total 10 [2025-01-08 23:42:19,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380679170] [2025-01-08 23:42:19,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-08 23:42:19,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-08 23:42:19,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:19,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-08 23:42:19,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-01-08 23:42:19,040 INFO L87 Difference]: Start difference. First operand 18832 states and 20725 transitions. Second operand has 11 states, 11 states have (on average 89.27272727272727) internal successors, (982), 10 states have internal predecessors, (982), 0 states have call successors, (0), 0 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:42:21,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:21,985 INFO L93 Difference]: Finished difference Result 41167 states and 45185 transitions. [2025-01-08 23:42:21,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-08 23:42:21,990 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 89.27272727272727) internal successors, (982), 10 states have internal predecessors, (982), 0 states have call successors, (0), 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 565 [2025-01-08 23:42:21,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:22,028 INFO L225 Difference]: With dead ends: 41167 [2025-01-08 23:42:22,028 INFO L226 Difference]: Without dead ends: 24363 [2025-01-08 23:42:22,040 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1152 GetRequests, 1127 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=227, Invalid=475, Unknown=0, NotChecked=0, Total=702 [2025-01-08 23:42:22,041 INFO L435 NwaCegarLoop]: 42 mSDtfsCounter, 1479 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 4051 mSolverCounterSat, 528 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1479 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 4579 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 528 IncrementalHoareTripleChecker+Valid, 4051 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:22,042 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1479 Valid, 165 Invalid, 4579 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [528 Valid, 4051 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2025-01-08 23:42:22,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24363 states. [2025-01-08 23:42:22,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24363 to 15148. [2025-01-08 23:42:22,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15148 states, 15147 states have (on average 1.0748663101604279) internal successors, (16281), 15147 states have internal predecessors, (16281), 0 states have call successors, (0), 0 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:42:22,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15148 states to 15148 states and 16281 transitions. [2025-01-08 23:42:22,196 INFO L78 Accepts]: Start accepts. Automaton has 15148 states and 16281 transitions. Word has length 565 [2025-01-08 23:42:22,196 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:22,196 INFO L471 AbstractCegarLoop]: Abstraction has 15148 states and 16281 transitions. [2025-01-08 23:42:22,196 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.27272727272727) internal successors, (982), 10 states have internal predecessors, (982), 0 states have call successors, (0), 0 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:42:22,196 INFO L276 IsEmpty]: Start isEmpty. Operand 15148 states and 16281 transitions. [2025-01-08 23:42:22,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-01-08 23:42:22,205 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:22,205 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2025-01-08 23:42:22,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-08 23:42:22,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2025-01-08 23:42:22,408 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:22,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:22,409 INFO L85 PathProgramCache]: Analyzing trace with hash 1367410928, now seen corresponding path program 1 times [2025-01-08 23:42:22,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:22,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204800709] [2025-01-08 23:42:22,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:22,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:22,477 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-01-08 23:42:22,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-01-08 23:42:22,498 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:22,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 885 backedges. 679 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-01-08 23:42:22,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:22,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204800709] [2025-01-08 23:42:22,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204800709] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:22,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:22,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:22,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004913827] [2025-01-08 23:42:22,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:22,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:22,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:22,802 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:22,802 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:22,802 INFO L87 Difference]: Start difference. First operand 15148 states and 16281 transitions. Second operand has 4 states, 4 states have (on average 109.5) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 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:42:23,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:23,611 INFO L93 Difference]: Finished difference Result 32873 states and 35356 transitions. [2025-01-08 23:42:23,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:23,612 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 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 589 [2025-01-08 23:42:23,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:23,628 INFO L225 Difference]: With dead ends: 32873 [2025-01-08 23:42:23,628 INFO L226 Difference]: Without dead ends: 18095 [2025-01-08 23:42:23,638 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:42:23,638 INFO L435 NwaCegarLoop]: 85 mSDtfsCounter, 102 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 970 mSolverCounterSat, 178 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 1148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 178 IncrementalHoareTripleChecker+Valid, 970 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:23,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [102 Valid, 116 Invalid, 1148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [178 Valid, 970 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:42:23,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18095 states. [2025-01-08 23:42:23,772 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18095 to 17723. [2025-01-08 23:42:23,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17723 states, 17722 states have (on average 1.065850355490351) internal successors, (18889), 17722 states have internal predecessors, (18889), 0 states have call successors, (0), 0 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:42:23,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17723 states to 17723 states and 18889 transitions. [2025-01-08 23:42:23,798 INFO L78 Accepts]: Start accepts. Automaton has 17723 states and 18889 transitions. Word has length 589 [2025-01-08 23:42:23,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:23,798 INFO L471 AbstractCegarLoop]: Abstraction has 17723 states and 18889 transitions. [2025-01-08 23:42:23,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 109.5) internal successors, (438), 3 states have internal predecessors, (438), 0 states have call successors, (0), 0 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:42:23,799 INFO L276 IsEmpty]: Start isEmpty. Operand 17723 states and 18889 transitions. [2025-01-08 23:42:23,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 608 [2025-01-08 23:42:23,808 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:23,809 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:23,809 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-01-08 23:42:23,809 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:23,809 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:23,809 INFO L85 PathProgramCache]: Analyzing trace with hash 313472729, now seen corresponding path program 1 times [2025-01-08 23:42:23,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:23,809 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [41602464] [2025-01-08 23:42:23,810 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:23,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:23,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 607 statements into 1 equivalence classes. [2025-01-08 23:42:23,860 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 607 of 607 statements. [2025-01-08 23:42:23,860 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:23,860 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:24,267 INFO L134 CoverageAnalysis]: Checked inductivity of 1255 backedges. 1049 proven. 0 refuted. 0 times theorem prover too weak. 206 trivial. 0 not checked. [2025-01-08 23:42:24,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:24,268 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [41602464] [2025-01-08 23:42:24,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [41602464] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:24,268 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:24,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:24,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078017952] [2025-01-08 23:42:24,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:24,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:24,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:24,269 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:24,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:24,269 INFO L87 Difference]: Start difference. First operand 17723 states and 18889 transitions. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 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:42:25,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:25,207 INFO L93 Difference]: Finished difference Result 35820 states and 38239 transitions. [2025-01-08 23:42:25,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:25,207 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 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 607 [2025-01-08 23:42:25,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:25,224 INFO L225 Difference]: With dead ends: 35820 [2025-01-08 23:42:25,224 INFO L226 Difference]: Without dead ends: 20495 [2025-01-08 23:42:25,234 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:25,234 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 228 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 998 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 1082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:25,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 127 Invalid, 1082 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 998 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:25,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20495 states. [2025-01-08 23:42:25,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20495 to 18276. [2025-01-08 23:42:25,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18276 states, 18275 states have (on average 1.0634746922024625) internal successors, (19435), 18275 states have internal predecessors, (19435), 0 states have call successors, (0), 0 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:42:25,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18276 states to 18276 states and 19435 transitions. [2025-01-08 23:42:25,464 INFO L78 Accepts]: Start accepts. Automaton has 18276 states and 19435 transitions. Word has length 607 [2025-01-08 23:42:25,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:25,464 INFO L471 AbstractCegarLoop]: Abstraction has 18276 states and 19435 transitions. [2025-01-08 23:42:25,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 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:42:25,465 INFO L276 IsEmpty]: Start isEmpty. Operand 18276 states and 19435 transitions. [2025-01-08 23:42:25,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 749 [2025-01-08 23:42:25,481 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:25,482 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:25,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2025-01-08 23:42:25,482 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:25,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:25,482 INFO L85 PathProgramCache]: Analyzing trace with hash 436669801, now seen corresponding path program 1 times [2025-01-08 23:42:25,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:25,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945187097] [2025-01-08 23:42:25,483 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:25,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:25,544 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 748 statements into 1 equivalence classes. [2025-01-08 23:42:25,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 748 of 748 statements. [2025-01-08 23:42:25,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:25,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:27,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 834 proven. 931 refuted. 0 times theorem prover too weak. 188 trivial. 0 not checked. [2025-01-08 23:42:27,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945187097] [2025-01-08 23:42:27,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945187097] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-08 23:42:27,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513220976] [2025-01-08 23:42:27,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:27,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-08 23:42:27,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-08 23:42:27,044 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-08 23:42:27,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-08 23:42:27,109 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 748 statements into 1 equivalence classes. [2025-01-08 23:42:27,233 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 748 of 748 statements. [2025-01-08 23:42:27,233 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:27,233 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:27,236 INFO L256 TraceCheckSpWp]: Trace formula consists of 968 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-08 23:42:27,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-08 23:42:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 1953 backedges. 816 proven. 0 refuted. 0 times theorem prover too weak. 1137 trivial. 0 not checked. [2025-01-08 23:42:27,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-08 23:42:27,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513220976] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:27,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-08 23:42:27,579 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2025-01-08 23:42:27,579 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858531550] [2025-01-08 23:42:27,579 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:27,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:27,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:27,583 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:27,584 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:42:27,584 INFO L87 Difference]: Start difference. First operand 18276 states and 19435 transitions. Second operand has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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:42:28,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:28,167 INFO L93 Difference]: Finished difference Result 35079 states and 37358 transitions. [2025-01-08 23:42:28,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:28,168 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 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 748 [2025-01-08 23:42:28,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:28,184 INFO L225 Difference]: With dead ends: 35079 [2025-01-08 23:42:28,185 INFO L226 Difference]: Without dead ends: 19201 [2025-01-08 23:42:28,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 755 GetRequests, 749 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-01-08 23:42:28,194 INFO L435 NwaCegarLoop]: 330 mSDtfsCounter, 88 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:28,194 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 348 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 525 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-08 23:42:28,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19201 states. [2025-01-08 23:42:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19201 to 18828. [2025-01-08 23:42:28,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18828 states, 18827 states have (on average 1.0601264141923832) internal successors, (19959), 18827 states have internal predecessors, (19959), 0 states have call successors, (0), 0 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:42:28,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18828 states to 18828 states and 19959 transitions. [2025-01-08 23:42:28,333 INFO L78 Accepts]: Start accepts. Automaton has 18828 states and 19959 transitions. Word has length 748 [2025-01-08 23:42:28,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:28,333 INFO L471 AbstractCegarLoop]: Abstraction has 18828 states and 19959 transitions. [2025-01-08 23:42:28,334 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 0 states have call successors, (0), 0 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:42:28,334 INFO L276 IsEmpty]: Start isEmpty. Operand 18828 states and 19959 transitions. [2025-01-08 23:42:28,344 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 761 [2025-01-08 23:42:28,344 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:28,344 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:42:28,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-01-08 23:42:28,545 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-01-08 23:42:28,545 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:28,546 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:28,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1373241701, now seen corresponding path program 1 times [2025-01-08 23:42:28,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:28,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062396729] [2025-01-08 23:42:28,546 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:28,546 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:28,603 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 760 statements into 1 equivalence classes. [2025-01-08 23:42:28,629 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 760 of 760 statements. [2025-01-08 23:42:28,630 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:28,630 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:29,149 INFO L134 CoverageAnalysis]: Checked inductivity of 1825 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 1027 trivial. 0 not checked. [2025-01-08 23:42:29,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:29,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062396729] [2025-01-08 23:42:29,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062396729] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:29,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:29,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-08 23:42:29,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306233993] [2025-01-08 23:42:29,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:29,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-08 23:42:29,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:29,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-08 23:42:29,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-08 23:42:29,151 INFO L87 Difference]: Start difference. First operand 18828 states and 19959 transitions. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:29,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:29,640 INFO L93 Difference]: Finished difference Result 36183 states and 38406 transitions. [2025-01-08 23:42:29,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-08 23:42:29,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 760 [2025-01-08 23:42:29,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:29,659 INFO L225 Difference]: With dead ends: 36183 [2025-01-08 23:42:29,659 INFO L226 Difference]: Without dead ends: 19753 [2025-01-08 23:42:29,667 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:42:29,668 INFO L435 NwaCegarLoop]: 140 mSDtfsCounter, 89 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 513 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 513 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:29,668 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 157 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 513 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-08 23:42:29,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19753 states. [2025-01-08 23:42:29,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19753 to 18460. [2025-01-08 23:42:29,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18460 states, 18459 states have (on average 1.0603499647868249) internal successors, (19573), 18459 states have internal predecessors, (19573), 0 states have call successors, (0), 0 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:42:29,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18460 states to 18460 states and 19573 transitions. [2025-01-08 23:42:29,807 INFO L78 Accepts]: Start accepts. Automaton has 18460 states and 19573 transitions. Word has length 760 [2025-01-08 23:42:29,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:29,807 INFO L471 AbstractCegarLoop]: Abstraction has 18460 states and 19573 transitions. [2025-01-08 23:42:29,807 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:29,807 INFO L276 IsEmpty]: Start isEmpty. Operand 18460 states and 19573 transitions. [2025-01-08 23:42:29,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 762 [2025-01-08 23:42:29,818 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:29,818 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2025-01-08 23:42:29,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-01-08 23:42:29,819 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:29,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:29,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1798834859, now seen corresponding path program 1 times [2025-01-08 23:42:29,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:29,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481546979] [2025-01-08 23:42:29,819 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:29,819 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:29,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 761 statements into 1 equivalence classes. [2025-01-08 23:42:29,879 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 761 of 761 statements. [2025-01-08 23:42:29,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:29,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:30,297 INFO L134 CoverageAnalysis]: Checked inductivity of 1824 backedges. 798 proven. 0 refuted. 0 times theorem prover too weak. 1026 trivial. 0 not checked. [2025-01-08 23:42:30,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:30,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481546979] [2025-01-08 23:42:30,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1481546979] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:30,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:30,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:30,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832350058] [2025-01-08 23:42:30,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:30,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:30,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:30,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:30,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:30,298 INFO L87 Difference]: Start difference. First operand 18460 states and 19573 transitions. Second operand has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:42:31,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:31,019 INFO L93 Difference]: Finished difference Result 34886 states and 37018 transitions. [2025-01-08 23:42:31,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:31,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 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 761 [2025-01-08 23:42:31,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:31,043 INFO L225 Difference]: With dead ends: 34886 [2025-01-08 23:42:31,043 INFO L226 Difference]: Without dead ends: 18456 [2025-01-08 23:42:31,052 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:31,053 INFO L435 NwaCegarLoop]: 114 mSDtfsCounter, 285 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 1059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:31,053 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 149 Invalid, 1059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-08 23:42:31,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18456 states. [2025-01-08 23:42:31,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18456 to 16981. [2025-01-08 23:42:31,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16981 states, 16980 states have (on average 1.0581272084805653) internal successors, (17967), 16980 states have internal predecessors, (17967), 0 states have call successors, (0), 0 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:42:31,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16981 states to 16981 states and 17967 transitions. [2025-01-08 23:42:31,200 INFO L78 Accepts]: Start accepts. Automaton has 16981 states and 17967 transitions. Word has length 761 [2025-01-08 23:42:31,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:31,200 INFO L471 AbstractCegarLoop]: Abstraction has 16981 states and 17967 transitions. [2025-01-08 23:42:31,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 80.25) internal successors, (321), 4 states have internal predecessors, (321), 0 states have call successors, (0), 0 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:42:31,200 INFO L276 IsEmpty]: Start isEmpty. Operand 16981 states and 17967 transitions. [2025-01-08 23:42:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 935 [2025-01-08 23:42:31,213 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:31,213 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:31,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2025-01-08 23:42:31,214 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:31,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:31,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1386953725, now seen corresponding path program 1 times [2025-01-08 23:42:31,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:31,214 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137102974] [2025-01-08 23:42:31,214 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:31,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:31,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 934 statements into 1 equivalence classes. [2025-01-08 23:42:31,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 934 of 934 statements. [2025-01-08 23:42:31,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:31,289 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:31,881 INFO L134 CoverageAnalysis]: Checked inductivity of 2554 backedges. 2015 proven. 0 refuted. 0 times theorem prover too weak. 539 trivial. 0 not checked. [2025-01-08 23:42:31,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:31,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137102974] [2025-01-08 23:42:31,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137102974] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:31,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:31,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:31,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405446344] [2025-01-08 23:42:31,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:31,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:31,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:31,882 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:31,882 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:31,883 INFO L87 Difference]: Start difference. First operand 16981 states and 17967 transitions. Second operand has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 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:42:32,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:32,777 INFO L93 Difference]: Finished difference Result 38019 states and 40220 transitions. [2025-01-08 23:42:32,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:32,777 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 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 934 [2025-01-08 23:42:32,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:32,793 INFO L225 Difference]: With dead ends: 38019 [2025-01-08 23:42:32,793 INFO L226 Difference]: Without dead ends: 21412 [2025-01-08 23:42:32,802 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:32,803 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 220 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 1026 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 1183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 1026 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:32,803 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 62 Invalid, 1183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 1026 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-08 23:42:32,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21412 states. [2025-01-08 23:42:32,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21412 to 14769. [2025-01-08 23:42:32,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14769 states, 14768 states have (on average 1.0547806067172265) internal successors, (15577), 14768 states have internal predecessors, (15577), 0 states have call successors, (0), 0 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:42:32,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14769 states to 14769 states and 15577 transitions. [2025-01-08 23:42:32,925 INFO L78 Accepts]: Start accepts. Automaton has 14769 states and 15577 transitions. Word has length 934 [2025-01-08 23:42:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:32,926 INFO L471 AbstractCegarLoop]: Abstraction has 14769 states and 15577 transitions. [2025-01-08 23:42:32,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 139.5) internal successors, (558), 4 states have internal predecessors, (558), 0 states have call successors, (0), 0 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:42:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 14769 states and 15577 transitions. [2025-01-08 23:42:32,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1027 [2025-01-08 23:42:32,936 INFO L210 NwaCegarLoop]: Found error trace [2025-01-08 23:42:32,937 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:32,937 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-01-08 23:42:32,937 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-08 23:42:32,938 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-08 23:42:32,938 INFO L85 PathProgramCache]: Analyzing trace with hash 873572441, now seen corresponding path program 1 times [2025-01-08 23:42:32,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-08 23:42:32,938 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947931005] [2025-01-08 23:42:32,938 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-08 23:42:32,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-08 23:42:32,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 1026 statements into 1 equivalence classes. [2025-01-08 23:42:33,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 1026 of 1026 statements. [2025-01-08 23:42:33,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-08 23:42:33,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-08 23:42:33,661 INFO L134 CoverageAnalysis]: Checked inductivity of 2814 backedges. 2143 proven. 0 refuted. 0 times theorem prover too weak. 671 trivial. 0 not checked. [2025-01-08 23:42:33,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-08 23:42:33,662 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947931005] [2025-01-08 23:42:33,662 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947931005] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-08 23:42:33,662 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-08 23:42:33,662 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-08 23:42:33,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797958139] [2025-01-08 23:42:33,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-08 23:42:33,662 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-08 23:42:33,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-08 23:42:33,663 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-08 23:42:33,663 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:33,663 INFO L87 Difference]: Start difference. First operand 14769 states and 15577 transitions. Second operand has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 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:42:34,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-08 23:42:34,388 INFO L93 Difference]: Finished difference Result 27867 states and 29392 transitions. [2025-01-08 23:42:34,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-08 23:42:34,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 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 1026 [2025-01-08 23:42:34,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-08 23:42:34,390 INFO L225 Difference]: With dead ends: 27867 [2025-01-08 23:42:34,390 INFO L226 Difference]: Without dead ends: 0 [2025-01-08 23:42:34,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-08 23:42:34,399 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 207 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 908 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 908 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-08 23:42:34,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 36 Invalid, 990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 908 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-08 23:42:34,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-01-08 23:42:34,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-01-08 23:42:34,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-08 23:42:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-01-08 23:42:34,400 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1026 [2025-01-08 23:42:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-08 23:42:34,401 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-01-08 23:42:34,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 141.5) internal successors, (566), 4 states have internal predecessors, (566), 0 states have call successors, (0), 0 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:42:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-01-08 23:42:34,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-01-08 23:42:34,404 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-08 23:42:34,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2025-01-08 23:42:34,406 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-08 23:42:34,407 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-01-08 23:42:40,835 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-08 23:42:40,872 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.01 11:42:40 BoogieIcfgContainer [2025-01-08 23:42:40,872 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-08 23:42:40,873 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-08 23:42:40,873 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-08 23:42:40,873 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-08 23:42:40,874 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.01 11:41:40" (3/4) ... [2025-01-08 23:42:40,876 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-01-08 23:42:40,889 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-01-08 23:42:40,890 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-01-08 23:42:40,891 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-01-08 23:42:40,892 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-01-08 23:42:40,985 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-01-08 23:42:40,986 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-01-08 23:42:40,986 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-08 23:42:40,987 INFO L158 Benchmark]: Toolchain (without parser) took 62100.44ms. Allocated memory was 142.6MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 107.0MB in the beginning and 837.5MB in the end (delta: -730.6MB). Peak memory consumption was 921.3MB. Max. memory is 16.1GB. [2025-01-08 23:42:40,987 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-08 23:42:40,987 INFO L158 Benchmark]: CACSL2BoogieTranslator took 444.24ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 62.3MB in the end (delta: 44.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2025-01-08 23:42:40,987 INFO L158 Benchmark]: Boogie Procedure Inliner took 106.82ms. Allocated memory is still 142.6MB. Free memory was 62.3MB in the beginning and 45.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:42:40,987 INFO L158 Benchmark]: Boogie Preprocessor took 155.98ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 82.5MB in the end (delta: -37.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2025-01-08 23:42:40,988 INFO L158 Benchmark]: RCFGBuilder took 1235.19ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 81.9MB in the beginning and 276.0MB in the end (delta: -194.2MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. [2025-01-08 23:42:40,988 INFO L158 Benchmark]: TraceAbstraction took 60039.68ms. Allocated memory was 327.2MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 276.0MB in the beginning and 854.3MB in the end (delta: -578.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. [2025-01-08 23:42:40,988 INFO L158 Benchmark]: Witness Printer took 113.14ms. Allocated memory is still 1.8GB. Free memory was 854.3MB in the beginning and 837.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-08 23:42:40,989 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 201.3MB. Free memory is still 125.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 444.24ms. Allocated memory is still 142.6MB. Free memory was 107.0MB in the beginning and 62.3MB in the end (delta: 44.7MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 106.82ms. Allocated memory is still 142.6MB. Free memory was 62.3MB in the beginning and 45.5MB in the end (delta: 16.7MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 155.98ms. Allocated memory is still 142.6MB. Free memory was 45.5MB in the beginning and 82.5MB in the end (delta: -37.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * RCFGBuilder took 1235.19ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 81.9MB in the beginning and 276.0MB in the end (delta: -194.2MB). Peak memory consumption was 57.0MB. Max. memory is 16.1GB. * TraceAbstraction took 60039.68ms. Allocated memory was 327.2MB in the beginning and 1.8GB in the end (delta: 1.5GB). Free memory was 276.0MB in the beginning and 854.3MB in the end (delta: -578.3MB). Peak memory consumption was 1.2GB. Max. memory is 16.1GB. * Witness Printer took 113.14ms. Allocated memory is still 1.8GB. Free memory was 854.3MB in the beginning and 837.5MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 181]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 53.5s, OverallIterations: 29, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 25.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7067 SdHoareTripleChecker+Valid, 22.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7067 mSDsluCounter, 5176 SdHoareTripleChecker+Invalid, 18.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 894 mSDsCounter, 3746 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 26527 IncrementalHoareTripleChecker+Invalid, 30273 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3746 mSolverCounterUnsat, 4282 mSDtfsCounter, 26527 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3624 GetRequests, 3529 SyntacticMatches, 1 SemanticMatches, 94 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23123occurred in iteration=14, InterpolantAutomatonStates: 132, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.1s AutomataMinimizationTime, 29 MinimizatonAttempts, 44739 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 20.0s InterpolantComputationTime, 15384 NumberOfCodeBlocks, 15384 NumberOfCodeBlocksAsserted, 34 NumberOfCheckSat, 16601 ConstructedInterpolants, 0 QuantifiedInterpolants, 73922 SizeOfPredicates, 9 NumberOfNonLiveVariables, 2958 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 37 InterpolantComputations, 27 PerfectInterpolantSequences, 24890/26424 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((a25 == 12) && ((a23 < 307) || (a29 < 278))) && (139 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) || ((((((((long long) a23 + 55) <= 0) && (a25 == 12)) && (a4 == 0)) && (((long long) 28470 + a29) <= 0)) && (a3 == 1)) && (a8 == 15))) || ((((((a23 <= 600000) && (260 <= a29)) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((a23 <= 600000) && ((((((((a29 <= 275) && (a25 == 12)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15)) || ((((((a25 == 11) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (312 <= a23)) && (a8 == 15))))) || (((((((260 <= a29) && (a25 == 11)) && (a3 == 1)) && (a4 == 1)) && (a23 <= 312)) && (a8 == 15)) && (0 <= ((long long) a23 + 42)))) || ((((((a4 == 0) && (a25 <= 10)) && (((long long) 28470 + a29) <= 0)) && (a3 == 1)) && (((long long) 119992 + a23) <= 0)) && (a8 == 15))) || ((((long long) a23 + 55) <= 0) && ((((((((long long) 28445 + a29) <= 0) && (a4 == 0)) && (a3 == 1)) && (a8 == 15)) && (a25 == 10)) || (((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) && (a3 == 1)) && (a8 == 15))))) || ((((((a23 <= 599997) && (a25 <= 10)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && ((0 < ((long long) a23 + 43)) || (a25 != 9)))) || ((((((((a23 <= 600000) && (260 <= a29)) && (a25 == 12)) && (307 <= a23)) && (a29 <= 277)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a29 <= 275) && (a25 == 12)) && (a4 == 0)) && (141 <= a29)) && (a3 == 1)) && (a8 == 15))) || ((((((((long long) a23 + 55) <= 0) && (a25 == 12)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15)) && (a29 <= 130))) || ((((((a29 <= 275) && (a25 <= 10)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 11) && (a29 <= 274)) && (141 <= a29)) && (((long long) 119992 + a23) <= 0)) && (a4 == 1)) && (a8 == 15))) || ((((((260 <= a29) && (((long long) a23 + 43) <= 0)) && (a4 == 0)) && (a25 == 9)) && (a3 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (141 <= a29)) && (a3 == 1)) && (((long long) a23 + 599772) <= 0)) && (a4 == 1)) && (a8 == 15))) || ((((((((long long) a23 + 43) <= 0) && (a4 == 0)) && (((long long) 28470 + a29) <= 0)) && (a25 == 9)) && (a3 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a23 <= 599997)) && (139 <= a23)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((a25 == 13) && (((long long) a23 + 55) <= 0)) && (a29 <= 274)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || (((((((a23 <= 599997) && (a25 == 11)) && (a29 <= 274)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) || ((((((a25 == 13) && (a29 <= 240)) && (141 <= a29)) && (a3 == 1)) && (a4 == 1)) && (a8 == 15))) RESULT: Ultimate proved your program to be correct! [2025-01-08 23:42:41,009 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE