./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-65.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc 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/hardness-nfm22/hardness_operatoramount_amount500_file-65.i -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 7b2bcc7df245eb8532aef0f4bc8850b1854aeae0739980c240eae862b80a07ff --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:42:44,910 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:42:44,986 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:42:44,991 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:42:44,991 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:42:45,012 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:42:45,013 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:42:45,013 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:42:45,013 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:42:45,014 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:42:45,014 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:42:45,014 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:42:45,014 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:42:45,014 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:42:45,014 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:42:45,015 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:42:45,015 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:42:45,015 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:42:45,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:42:45,015 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:42:45,015 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:42:45,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:42:45,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:42:45,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:42:45,016 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:42:45,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:42:45,016 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:42:45,016 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:42:45,016 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:42:45,016 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:42:45,016 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:42:45,016 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:42:45,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:42:45,017 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:42:45,017 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:42:45,017 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:42:45,017 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:42:45,017 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:42:45,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:42:45,017 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:42:45,017 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:42:45,018 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:42:45,018 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:42:45,018 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 -> 7b2bcc7df245eb8532aef0f4bc8850b1854aeae0739980c240eae862b80a07ff [2025-02-06 02:42:45,291 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:42:45,304 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:42:45,308 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:42:45,309 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:42:45,310 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:42:45,311 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-65.i [2025-02-06 02:42:46,662 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ca75a4a2/b6e9698175374ad99cca608fe1e6657e/FLAGf9543e950 [2025-02-06 02:42:47,032 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:42:47,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-65.i [2025-02-06 02:42:47,053 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ca75a4a2/b6e9698175374ad99cca608fe1e6657e/FLAGf9543e950 [2025-02-06 02:42:47,070 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9ca75a4a2/b6e9698175374ad99cca608fe1e6657e [2025-02-06 02:42:47,072 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:42:47,073 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:42:47,074 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:42:47,074 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:42:47,077 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:42:47,078 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:47,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4424c496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47, skipping insertion in model container [2025-02-06 02:42:47,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:47,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:42:47,262 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/hardness-nfm22/hardness_operatoramount_amount500_file-65.i[916,929] [2025-02-06 02:42:47,472 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:42:47,488 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:42:47,498 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/hardness-nfm22/hardness_operatoramount_amount500_file-65.i[916,929] [2025-02-06 02:42:47,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:42:47,653 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:42:47,654 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47 WrapperNode [2025-02-06 02:42:47,655 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:42:47,657 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:42:47,657 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:42:47,657 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:42:47,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:47,695 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:47,835 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 725 [2025-02-06 02:42:47,836 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:42:47,837 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:42:47,838 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:42:47,838 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:42:47,847 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:47,847 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:47,869 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:47,980 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-02-06 02:42:47,980 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:47,981 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:48,023 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:48,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:48,045 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:48,054 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:48,072 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:42:48,074 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:42:48,075 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:42:48,075 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:42:48,076 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (1/1) ... [2025-02-06 02:42:48,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:42:48,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:48,109 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-02-06 02:42:48,112 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-02-06 02:42:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:42:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:42:48,137 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:42:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:42:48,137 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:42:48,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:42:48,286 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:42:48,288 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:42:49,542 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L642: havoc property_#t~ite50#1;havoc property_#t~ite49#1;havoc property_#t~bitwise46#1;havoc property_#t~ite48#1;havoc property_#t~bitwise47#1;havoc property_#t~short51#1;havoc property_#t~bitwise52#1;havoc property_#t~short53#1;havoc property_#t~bitwise54#1;havoc property_#t~short55#1;havoc property_#t~ite57#1;havoc property_#t~bitwise56#1;havoc property_#t~short58#1;havoc property_#t~bitwise59#1;havoc property_#t~short60#1; [2025-02-06 02:42:49,735 INFO L? ?]: Removed 105 outVars from TransFormulas that were not future-live. [2025-02-06 02:42:49,735 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:42:49,781 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:42:49,781 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:42:49,782 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:42:49 BoogieIcfgContainer [2025-02-06 02:42:49,782 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:42:49,788 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:42:49,789 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:42:49,793 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:42:49,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:42:47" (1/3) ... [2025-02-06 02:42:49,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b8a036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:42:49, skipping insertion in model container [2025-02-06 02:42:49,794 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:42:47" (2/3) ... [2025-02-06 02:42:49,794 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20b8a036 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:42:49, skipping insertion in model container [2025-02-06 02:42:49,795 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:42:49" (3/3) ... [2025-02-06 02:42:49,796 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-65.i [2025-02-06 02:42:49,810 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:42:49,815 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-65.i that has 2 procedures, 294 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:42:49,888 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:42:49,901 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;@6c33fa82, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:42:49,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:42:49,907 INFO L276 IsEmpty]: Start isEmpty. Operand has 294 states, 231 states have (on average 1.5584415584415585) internal successors, (360), 232 states have internal predecessors, (360), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 02:42:49,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-06 02:42:49,936 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:49,937 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:49,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:49,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:49,945 INFO L85 PathProgramCache]: Analyzing trace with hash -97498120, now seen corresponding path program 1 times [2025-02-06 02:42:49,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:49,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952301211] [2025-02-06 02:42:49,954 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:49,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:50,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-06 02:42:50,177 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-06 02:42:50,178 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:50,178 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:50,780 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-02-06 02:42:50,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:50,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952301211] [2025-02-06 02:42:50,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952301211] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:42:50,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [980548146] [2025-02-06 02:42:50,783 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:50,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:42:50,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:42:50,787 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-02-06 02:42:50,789 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-02-06 02:42:50,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-06 02:42:51,211 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-06 02:42:51,212 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:51,212 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:51,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:42:51,242 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:42:51,297 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-02-06 02:42:51,298 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:42:51,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [980548146] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:51,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:42:51,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:42:51,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84461409] [2025-02-06 02:42:51,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:51,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:42:51,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:51,329 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:42:51,330 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:42:51,333 INFO L87 Difference]: Start difference. First operand has 294 states, 231 states have (on average 1.5584415584415585) internal successors, (360), 232 states have internal predecessors, (360), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-02-06 02:42:51,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:51,421 INFO L93 Difference]: Finished difference Result 582 states and 1015 transitions. [2025-02-06 02:42:51,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:42:51,425 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) Word has length 437 [2025-02-06 02:42:51,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:51,436 INFO L225 Difference]: With dead ends: 582 [2025-02-06 02:42:51,438 INFO L226 Difference]: Without dead ends: 291 [2025-02-06 02:42:51,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 438 GetRequests, 438 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:42:51,449 INFO L435 NwaCegarLoop]: 462 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:51,450 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 462 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:42:51,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-02-06 02:42:51,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-02-06 02:42:51,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 229 states have (on average 1.5458515283842795) internal successors, (354), 229 states have internal predecessors, (354), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-02-06 02:42:51,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 474 transitions. [2025-02-06 02:42:51,536 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 474 transitions. Word has length 437 [2025-02-06 02:42:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:51,541 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 474 transitions. [2025-02-06 02:42:51,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 71.0) internal successors, (142), 2 states have internal predecessors, (142), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-02-06 02:42:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 474 transitions. [2025-02-06 02:42:51,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 438 [2025-02-06 02:42:51,556 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:51,556 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:51,568 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-02-06 02:42:51,757 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:42:51,757 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:51,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:51,758 INFO L85 PathProgramCache]: Analyzing trace with hash 1986924451, now seen corresponding path program 1 times [2025-02-06 02:42:51,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:51,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578582911] [2025-02-06 02:42:51,759 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:51,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:51,822 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 437 statements into 1 equivalence classes. [2025-02-06 02:42:51,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 437 of 437 statements. [2025-02-06 02:42:51,915 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:51,915 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:52,637 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:42:52,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:52,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578582911] [2025-02-06 02:42:52,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578582911] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:52,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:52,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:42:52,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139154216] [2025-02-06 02:42:52,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:52,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:42:52,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:52,644 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:42:52,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:42:52,645 INFO L87 Difference]: Start difference. First operand 291 states and 474 transitions. Second operand has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:42:53,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:53,124 INFO L93 Difference]: Finished difference Result 1048 states and 1714 transitions. [2025-02-06 02:42:53,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:42:53,125 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 437 [2025-02-06 02:42:53,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:53,137 INFO L225 Difference]: With dead ends: 1048 [2025-02-06 02:42:53,137 INFO L226 Difference]: Without dead ends: 760 [2025-02-06 02:42:53,139 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:42:53,140 INFO L435 NwaCegarLoop]: 722 mSDtfsCounter, 652 mSDsluCounter, 887 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 1609 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:53,141 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 1609 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:42:53,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2025-02-06 02:42:53,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 727. [2025-02-06 02:42:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 727 states, 604 states have (on average 1.5811258278145695) internal successors, (955), 604 states have internal predecessors, (955), 120 states have call successors, (120), 2 states have call predecessors, (120), 2 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-02-06 02:42:53,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 727 states to 727 states and 1195 transitions. [2025-02-06 02:42:53,252 INFO L78 Accepts]: Start accepts. Automaton has 727 states and 1195 transitions. Word has length 437 [2025-02-06 02:42:53,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:53,256 INFO L471 AbstractCegarLoop]: Abstraction has 727 states and 1195 transitions. [2025-02-06 02:42:53,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.0) internal successors, (140), 4 states have internal predecessors, (140), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:42:53,256 INFO L276 IsEmpty]: Start isEmpty. Operand 727 states and 1195 transitions. [2025-02-06 02:42:53,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 439 [2025-02-06 02:42:53,264 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:53,265 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:53,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:42:53,265 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:53,266 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:53,267 INFO L85 PathProgramCache]: Analyzing trace with hash -1200072367, now seen corresponding path program 1 times [2025-02-06 02:42:53,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:53,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347500773] [2025-02-06 02:42:53,269 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:53,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:53,313 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 438 statements into 1 equivalence classes. [2025-02-06 02:42:53,353 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 438 of 438 statements. [2025-02-06 02:42:53,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:53,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:53,907 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:42:53,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:53,908 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347500773] [2025-02-06 02:42:53,908 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347500773] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:53,908 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:53,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:42:53,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008673739] [2025-02-06 02:42:53,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:53,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:42:53,909 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:53,910 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:42:53,910 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:42:53,911 INFO L87 Difference]: Start difference. First operand 727 states and 1195 transitions. Second operand has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:42:54,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:54,379 INFO L93 Difference]: Finished difference Result 2973 states and 4909 transitions. [2025-02-06 02:42:54,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:42:54,380 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 438 [2025-02-06 02:42:54,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:54,395 INFO L225 Difference]: With dead ends: 2973 [2025-02-06 02:42:54,395 INFO L226 Difference]: Without dead ends: 2249 [2025-02-06 02:42:54,398 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:42:54,399 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 1126 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 1547 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:54,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 1547 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:42:54,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2249 states. [2025-02-06 02:42:54,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2249 to 2131. [2025-02-06 02:42:54,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2131 states, 1886 states have (on average 1.6261930010604453) internal successors, (3067), 1886 states have internal predecessors, (3067), 240 states have call successors, (240), 4 states have call predecessors, (240), 4 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-02-06 02:42:54,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2131 states to 2131 states and 3547 transitions. [2025-02-06 02:42:54,611 INFO L78 Accepts]: Start accepts. Automaton has 2131 states and 3547 transitions. Word has length 438 [2025-02-06 02:42:54,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:54,613 INFO L471 AbstractCegarLoop]: Abstraction has 2131 states and 3547 transitions. [2025-02-06 02:42:54,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.25) internal successors, (141), 4 states have internal predecessors, (141), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:42:54,614 INFO L276 IsEmpty]: Start isEmpty. Operand 2131 states and 3547 transitions. [2025-02-06 02:42:54,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-06 02:42:54,621 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:54,621 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:54,621 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:42:54,622 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:54,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:54,622 INFO L85 PathProgramCache]: Analyzing trace with hash 2140450662, now seen corresponding path program 1 times [2025-02-06 02:42:54,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:54,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405340084] [2025-02-06 02:42:54,623 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:54,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:54,665 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-06 02:42:54,699 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-06 02:42:54,699 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:54,699 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:54,918 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:42:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:54,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405340084] [2025-02-06 02:42:54,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405340084] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:54,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:54,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:42:54,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726724018] [2025-02-06 02:42:54,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:54,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:42:54,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:54,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:42:54,920 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:42:54,921 INFO L87 Difference]: Start difference. First operand 2131 states and 3547 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:42:55,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:55,107 INFO L93 Difference]: Finished difference Result 6351 states and 10563 transitions. [2025-02-06 02:42:55,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:42:55,108 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-02-06 02:42:55,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:55,137 INFO L225 Difference]: With dead ends: 6351 [2025-02-06 02:42:55,137 INFO L226 Difference]: Without dead ends: 4223 [2025-02-06 02:42:55,145 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-02-06 02:42:55,147 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 456 mSDsluCounter, 443 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 898 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:55,148 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 898 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:42:55,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4223 states. [2025-02-06 02:42:55,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4223 to 2827. [2025-02-06 02:42:55,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2827 states, 2582 states have (on average 1.634004647560031) internal successors, (4219), 2582 states have internal predecessors, (4219), 240 states have call successors, (240), 4 states have call predecessors, (240), 4 states have return successors, (240), 240 states have call predecessors, (240), 240 states have call successors, (240) [2025-02-06 02:42:55,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2827 states to 2827 states and 4699 transitions. [2025-02-06 02:42:55,362 INFO L78 Accepts]: Start accepts. Automaton has 2827 states and 4699 transitions. Word has length 439 [2025-02-06 02:42:55,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:55,363 INFO L471 AbstractCegarLoop]: Abstraction has 2827 states and 4699 transitions. [2025-02-06 02:42:55,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:42:55,364 INFO L276 IsEmpty]: Start isEmpty. Operand 2827 states and 4699 transitions. [2025-02-06 02:42:55,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-06 02:42:55,374 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:55,374 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:55,375 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:42:55,375 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:55,376 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:55,376 INFO L85 PathProgramCache]: Analyzing trace with hash -275473722, now seen corresponding path program 1 times [2025-02-06 02:42:55,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:55,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726853710] [2025-02-06 02:42:55,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:55,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:55,422 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-06 02:42:55,450 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-06 02:42:55,451 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:55,451 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:55,630 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:42:55,630 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:55,630 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726853710] [2025-02-06 02:42:55,630 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726853710] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:55,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:55,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:42:55,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423065275] [2025-02-06 02:42:55,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:55,631 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:42:55,631 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:55,632 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:42:55,632 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:42:55,633 INFO L87 Difference]: Start difference. First operand 2827 states and 4699 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:42:55,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:55,950 INFO L93 Difference]: Finished difference Result 8379 states and 13923 transitions. [2025-02-06 02:42:55,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:42:55,951 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-02-06 02:42:55,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:55,983 INFO L225 Difference]: With dead ends: 8379 [2025-02-06 02:42:55,984 INFO L226 Difference]: Without dead ends: 5555 [2025-02-06 02:42:55,993 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-02-06 02:42:55,994 INFO L435 NwaCegarLoop]: 676 mSDtfsCounter, 454 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:55,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 1112 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:42:56,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5555 states. [2025-02-06 02:42:56,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5555 to 5529. [2025-02-06 02:42:56,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5529 states, 5040 states have (on average 1.613888888888889) internal successors, (8134), 5040 states have internal predecessors, (8134), 480 states have call successors, (480), 8 states have call predecessors, (480), 8 states have return successors, (480), 480 states have call predecessors, (480), 480 states have call successors, (480) [2025-02-06 02:42:56,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5529 states to 5529 states and 9094 transitions. [2025-02-06 02:42:56,299 INFO L78 Accepts]: Start accepts. Automaton has 5529 states and 9094 transitions. Word has length 439 [2025-02-06 02:42:56,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:56,300 INFO L471 AbstractCegarLoop]: Abstraction has 5529 states and 9094 transitions. [2025-02-06 02:42:56,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:42:56,301 INFO L276 IsEmpty]: Start isEmpty. Operand 5529 states and 9094 transitions. [2025-02-06 02:42:56,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-06 02:42:56,312 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:56,312 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:56,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:42:56,315 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:56,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:56,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1636115174, now seen corresponding path program 1 times [2025-02-06 02:42:56,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:56,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754778716] [2025-02-06 02:42:56,317 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:56,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:56,358 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-06 02:42:56,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-06 02:42:56,507 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:56,507 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:57,144 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:42:57,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:57,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754778716] [2025-02-06 02:42:57,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754778716] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:57,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:57,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 02:42:57,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924446023] [2025-02-06 02:42:57,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:57,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:42:57,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:57,148 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:42:57,148 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:42:57,148 INFO L87 Difference]: Start difference. First operand 5529 states and 9094 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 3 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2025-02-06 02:42:58,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:58,279 INFO L93 Difference]: Finished difference Result 16485 states and 27108 transitions. [2025-02-06 02:42:58,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:42:58,280 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 3 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) Word has length 439 [2025-02-06 02:42:58,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:42:58,348 INFO L225 Difference]: With dead ends: 16485 [2025-02-06 02:42:58,348 INFO L226 Difference]: Without dead ends: 10959 [2025-02-06 02:42:58,364 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:42:58,365 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 1548 mSDsluCounter, 653 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 470 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1548 SdHoareTripleChecker+Valid, 1425 SdHoareTripleChecker+Invalid, 812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 470 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:42:58,365 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1548 Valid, 1425 Invalid, 812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [470 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 02:42:58,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10959 states. [2025-02-06 02:42:58,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10959 to 8205. [2025-02-06 02:42:58,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8205 states, 7716 states have (on average 1.6233799896319336) internal successors, (12526), 7716 states have internal predecessors, (12526), 480 states have call successors, (480), 8 states have call predecessors, (480), 8 states have return successors, (480), 480 states have call predecessors, (480), 480 states have call successors, (480) [2025-02-06 02:42:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8205 states to 8205 states and 13486 transitions. [2025-02-06 02:42:58,876 INFO L78 Accepts]: Start accepts. Automaton has 8205 states and 13486 transitions. Word has length 439 [2025-02-06 02:42:58,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:42:58,879 INFO L471 AbstractCegarLoop]: Abstraction has 8205 states and 13486 transitions. [2025-02-06 02:42:58,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 8 states have internal predecessors, (142), 3 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 3 states have call predecessors, (60), 3 states have call successors, (60) [2025-02-06 02:42:58,884 INFO L276 IsEmpty]: Start isEmpty. Operand 8205 states and 13486 transitions. [2025-02-06 02:42:58,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 440 [2025-02-06 02:42:58,896 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:42:58,896 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:42:58,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:42:58,897 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:42:58,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:42:58,897 INFO L85 PathProgramCache]: Analyzing trace with hash -1173796571, now seen corresponding path program 1 times [2025-02-06 02:42:58,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:42:58,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036894185] [2025-02-06 02:42:58,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:42:58,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:42:58,947 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 439 statements into 1 equivalence classes. [2025-02-06 02:42:59,050 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 439 of 439 statements. [2025-02-06 02:42:59,051 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:42:59,051 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:42:59,491 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:42:59,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:42:59,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036894185] [2025-02-06 02:42:59,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036894185] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:42:59,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:42:59,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:42:59,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185475076] [2025-02-06 02:42:59,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:42:59,493 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:42:59,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:42:59,494 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:42:59,494 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:42:59,495 INFO L87 Difference]: Start difference. First operand 8205 states and 13486 transitions. Second operand has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:42:59,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:42:59,954 INFO L93 Difference]: Finished difference Result 20813 states and 34490 transitions. [2025-02-06 02:42:59,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:42:59,954 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 439 [2025-02-06 02:42:59,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:00,000 INFO L225 Difference]: With dead ends: 20813 [2025-02-06 02:43:00,000 INFO L226 Difference]: Without dead ends: 12611 [2025-02-06 02:43:00,022 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:00,023 INFO L435 NwaCegarLoop]: 541 mSDtfsCounter, 178 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:00,024 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 1493 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:43:00,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12611 states. [2025-02-06 02:43:00,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12611 to 12601. [2025-02-06 02:43:00,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12601 states, 12072 states have (on average 1.6499337309476474) internal successors, (19918), 12080 states have internal predecessors, (19918), 512 states have call successors, (512), 16 states have call predecessors, (512), 16 states have return successors, (512), 504 states have call predecessors, (512), 512 states have call successors, (512) [2025-02-06 02:43:00,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12601 states to 12601 states and 20942 transitions. [2025-02-06 02:43:00,494 INFO L78 Accepts]: Start accepts. Automaton has 12601 states and 20942 transitions. Word has length 439 [2025-02-06 02:43:00,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:00,495 INFO L471 AbstractCegarLoop]: Abstraction has 12601 states and 20942 transitions. [2025-02-06 02:43:00,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.5) internal successors, (142), 4 states have internal predecessors, (142), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:00,495 INFO L276 IsEmpty]: Start isEmpty. Operand 12601 states and 20942 transitions. [2025-02-06 02:43:00,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 441 [2025-02-06 02:43:00,506 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:00,506 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:43:00,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:43:00,506 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:00,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:00,507 INFO L85 PathProgramCache]: Analyzing trace with hash 1707391936, now seen corresponding path program 1 times [2025-02-06 02:43:00,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:00,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012553148] [2025-02-06 02:43:00,507 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:00,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:00,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 440 statements into 1 equivalence classes. [2025-02-06 02:43:00,628 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 440 of 440 statements. [2025-02-06 02:43:00,629 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:00,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:01,079 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:01,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:01,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012553148] [2025-02-06 02:43:01,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012553148] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:01,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:01,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:01,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912214248] [2025-02-06 02:43:01,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:01,084 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:01,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:01,085 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:01,085 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:01,085 INFO L87 Difference]: Start difference. First operand 12601 states and 20942 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:01,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:01,774 INFO L93 Difference]: Finished difference Result 30082 states and 49902 transitions. [2025-02-06 02:43:01,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:01,775 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 440 [2025-02-06 02:43:01,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:01,829 INFO L225 Difference]: With dead ends: 30082 [2025-02-06 02:43:01,830 INFO L226 Difference]: Without dead ends: 17484 [2025-02-06 02:43:01,858 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:01,859 INFO L435 NwaCegarLoop]: 702 mSDtfsCounter, 629 mSDsluCounter, 876 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 629 SdHoareTripleChecker+Valid, 1578 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:01,860 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [629 Valid, 1578 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:43:01,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17484 states. [2025-02-06 02:43:02,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17484 to 17064. [2025-02-06 02:43:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17064 states, 16408 states have (on average 1.6510848366650415) internal successors, (27091), 16417 states have internal predecessors, (27091), 636 states have call successors, (636), 19 states have call predecessors, (636), 19 states have return successors, (636), 627 states have call predecessors, (636), 636 states have call successors, (636) [2025-02-06 02:43:02,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17064 states to 17064 states and 28363 transitions. [2025-02-06 02:43:02,640 INFO L78 Accepts]: Start accepts. Automaton has 17064 states and 28363 transitions. Word has length 440 [2025-02-06 02:43:02,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:02,642 INFO L471 AbstractCegarLoop]: Abstraction has 17064 states and 28363 transitions. [2025-02-06 02:43:02,642 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:02,642 INFO L276 IsEmpty]: Start isEmpty. Operand 17064 states and 28363 transitions. [2025-02-06 02:43:02,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-06 02:43:02,656 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:02,656 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:43:02,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:43:02,657 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:02,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:02,658 INFO L85 PathProgramCache]: Analyzing trace with hash 887674998, now seen corresponding path program 1 times [2025-02-06 02:43:02,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:02,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [896426207] [2025-02-06 02:43:02,658 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:02,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:02,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-06 02:43:02,784 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-06 02:43:02,785 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:02,785 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:03,707 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:03,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:03,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [896426207] [2025-02-06 02:43:03,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [896426207] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:03,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:03,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:03,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637658885] [2025-02-06 02:43:03,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:03,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:03,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:03,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:03,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:03,710 INFO L87 Difference]: Start difference. First operand 17064 states and 28363 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:04,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:04,766 INFO L93 Difference]: Finished difference Result 57459 states and 95759 transitions. [2025-02-06 02:43:04,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:04,767 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 441 [2025-02-06 02:43:04,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:04,884 INFO L225 Difference]: With dead ends: 57459 [2025-02-06 02:43:04,885 INFO L226 Difference]: Without dead ends: 40636 [2025-02-06 02:43:04,934 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:04,935 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 670 mSDsluCounter, 789 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 670 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 372 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:04,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [670 Valid, 1439 Invalid, 372 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:43:04,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40636 states. [2025-02-06 02:43:05,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40636 to 39279. [2025-02-06 02:43:05,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39279 states, 38190 states have (on average 1.6559308719560095) internal successors, (63240), 38217 states have internal predecessors, (63240), 1050 states have call successors, (1050), 38 states have call predecessors, (1050), 38 states have return successors, (1050), 1023 states have call predecessors, (1050), 1050 states have call successors, (1050) [2025-02-06 02:43:06,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39279 states to 39279 states and 65340 transitions. [2025-02-06 02:43:06,220 INFO L78 Accepts]: Start accepts. Automaton has 39279 states and 65340 transitions. Word has length 441 [2025-02-06 02:43:06,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:06,223 INFO L471 AbstractCegarLoop]: Abstraction has 39279 states and 65340 transitions. [2025-02-06 02:43:06,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:06,224 INFO L276 IsEmpty]: Start isEmpty. Operand 39279 states and 65340 transitions. [2025-02-06 02:43:06,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-06 02:43:06,247 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:06,247 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:43:06,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:43:06,247 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:06,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:06,248 INFO L85 PathProgramCache]: Analyzing trace with hash 641361911, now seen corresponding path program 1 times [2025-02-06 02:43:06,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:06,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098022933] [2025-02-06 02:43:06,249 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:06,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:06,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-06 02:43:06,351 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-06 02:43:06,351 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:06,351 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:06,794 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:06,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:06,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098022933] [2025-02-06 02:43:06,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098022933] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:06,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:06,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:43:06,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1806044711] [2025-02-06 02:43:06,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:06,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:43:06,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:06,796 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:43:06,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:06,796 INFO L87 Difference]: Start difference. First operand 39279 states and 65340 transitions. Second operand has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:07,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:07,795 INFO L93 Difference]: Finished difference Result 89799 states and 149533 transitions. [2025-02-06 02:43:07,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:43:07,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 441 [2025-02-06 02:43:07,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:07,967 INFO L225 Difference]: With dead ends: 89799 [2025-02-06 02:43:07,968 INFO L226 Difference]: Without dead ends: 52381 [2025-02-06 02:43:08,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-06 02:43:08,036 INFO L435 NwaCegarLoop]: 672 mSDtfsCounter, 330 mSDsluCounter, 436 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 330 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:08,037 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [330 Valid, 1108 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:43:08,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52381 states. [2025-02-06 02:43:09,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52381 to 52379. [2025-02-06 02:43:09,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52379 states, 50834 states have (on average 1.6457095644647284) internal successors, (83658), 50873 states have internal predecessors, (83658), 1490 states have call successors, (1490), 54 states have call predecessors, (1490), 54 states have return successors, (1490), 1451 states have call predecessors, (1490), 1490 states have call successors, (1490) [2025-02-06 02:43:09,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52379 states to 52379 states and 86638 transitions. [2025-02-06 02:43:09,644 INFO L78 Accepts]: Start accepts. Automaton has 52379 states and 86638 transitions. Word has length 441 [2025-02-06 02:43:09,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:09,646 INFO L471 AbstractCegarLoop]: Abstraction has 52379 states and 86638 transitions. [2025-02-06 02:43:09,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:09,647 INFO L276 IsEmpty]: Start isEmpty. Operand 52379 states and 86638 transitions. [2025-02-06 02:43:09,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-06 02:43:09,810 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:09,810 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:43:09,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:43:09,812 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:09,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:09,813 INFO L85 PathProgramCache]: Analyzing trace with hash -67846281, now seen corresponding path program 1 times [2025-02-06 02:43:09,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:09,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139443193] [2025-02-06 02:43:09,813 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:09,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:09,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-06 02:43:09,919 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-06 02:43:09,919 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:09,919 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:10,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:10,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139443193] [2025-02-06 02:43:10,695 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139443193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:10,695 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:10,695 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:43:10,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [158919306] [2025-02-06 02:43:10,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:10,696 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:43:10,696 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:10,697 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:43:10,697 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:43:10,697 INFO L87 Difference]: Start difference. First operand 52379 states and 86638 transitions. Second operand has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:11,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:11,716 INFO L93 Difference]: Finished difference Result 110961 states and 183783 transitions. [2025-02-06 02:43:11,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:43:11,717 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 441 [2025-02-06 02:43:11,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:11,954 INFO L225 Difference]: With dead ends: 110961 [2025-02-06 02:43:11,955 INFO L226 Difference]: Without dead ends: 74809 [2025-02-06 02:43:12,031 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-02-06 02:43:12,033 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 528 mSDsluCounter, 812 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 528 SdHoareTripleChecker+Valid, 1257 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:12,033 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [528 Valid, 1257 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:43:12,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74809 states. [2025-02-06 02:43:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74809 to 66696. [2025-02-06 02:43:13,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66696 states, 64877 states have (on average 1.6422923378084684) internal successors, (106547), 64942 states have internal predecessors, (106547), 1737 states have call successors, (1737), 81 states have call predecessors, (1737), 81 states have return successors, (1737), 1672 states have call predecessors, (1737), 1737 states have call successors, (1737) [2025-02-06 02:43:14,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66696 states to 66696 states and 110021 transitions. [2025-02-06 02:43:14,305 INFO L78 Accepts]: Start accepts. Automaton has 66696 states and 110021 transitions. Word has length 441 [2025-02-06 02:43:14,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:14,306 INFO L471 AbstractCegarLoop]: Abstraction has 66696 states and 110021 transitions. [2025-02-06 02:43:14,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.0) internal successors, (144), 4 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:14,306 INFO L276 IsEmpty]: Start isEmpty. Operand 66696 states and 110021 transitions. [2025-02-06 02:43:14,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-06 02:43:14,324 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:14,324 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:43:14,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:43:14,325 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:14,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:14,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1251193578, now seen corresponding path program 1 times [2025-02-06 02:43:14,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:14,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059087341] [2025-02-06 02:43:14,326 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:14,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:14,363 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-06 02:43:15,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-06 02:43:15,393 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:15,393 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:15,938 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:15,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:15,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059087341] [2025-02-06 02:43:15,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059087341] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:15,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:15,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:43:15,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485663536] [2025-02-06 02:43:15,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:15,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:43:15,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:15,940 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:43:15,940 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:15,941 INFO L87 Difference]: Start difference. First operand 66696 states and 110021 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:18,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:18,640 INFO L93 Difference]: Finished difference Result 254965 states and 419554 transitions. [2025-02-06 02:43:18,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:43:18,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 441 [2025-02-06 02:43:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:19,072 INFO L225 Difference]: With dead ends: 254965 [2025-02-06 02:43:19,072 INFO L226 Difference]: Without dead ends: 185774 [2025-02-06 02:43:19,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:43:19,150 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 1042 mSDsluCounter, 1867 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1042 SdHoareTripleChecker+Valid, 2540 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:19,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1042 Valid, 2540 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:43:19,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185774 states. [2025-02-06 02:43:21,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185774 to 111725. [2025-02-06 02:43:21,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111725 states, 109633 states have (on average 1.6347906196127078) internal successors, (179227), 109724 states have internal predecessors, (179227), 1984 states have call successors, (1984), 107 states have call predecessors, (1984), 107 states have return successors, (1984), 1893 states have call predecessors, (1984), 1984 states have call successors, (1984) [2025-02-06 02:43:22,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111725 states to 111725 states and 183195 transitions. [2025-02-06 02:43:22,059 INFO L78 Accepts]: Start accepts. Automaton has 111725 states and 183195 transitions. Word has length 441 [2025-02-06 02:43:22,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:22,060 INFO L471 AbstractCegarLoop]: Abstraction has 111725 states and 183195 transitions. [2025-02-06 02:43:22,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:22,060 INFO L276 IsEmpty]: Start isEmpty. Operand 111725 states and 183195 transitions. [2025-02-06 02:43:22,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 442 [2025-02-06 02:43:22,083 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:22,084 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:43:22,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:43:22,084 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:22,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:22,085 INFO L85 PathProgramCache]: Analyzing trace with hash -239033931, now seen corresponding path program 1 times [2025-02-06 02:43:22,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:22,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688204420] [2025-02-06 02:43:22,085 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:22,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:22,119 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 441 statements into 1 equivalence classes. [2025-02-06 02:43:22,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 441 of 441 statements. [2025-02-06 02:43:22,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:22,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:23,238 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:23,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:23,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688204420] [2025-02-06 02:43:23,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688204420] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:23,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:23,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:43:23,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111224186] [2025-02-06 02:43:23,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:23,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:43:23,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:23,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:43:23,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:43:23,241 INFO L87 Difference]: Start difference. First operand 111725 states and 183195 transitions. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:25,963 INFO L93 Difference]: Finished difference Result 278457 states and 455455 transitions. [2025-02-06 02:43:25,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:43:25,964 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 441 [2025-02-06 02:43:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:26,293 INFO L225 Difference]: With dead ends: 278457 [2025-02-06 02:43:26,293 INFO L226 Difference]: Without dead ends: 169545 [2025-02-06 02:43:26,368 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:43:26,369 INFO L435 NwaCegarLoop]: 899 mSDtfsCounter, 711 mSDsluCounter, 2004 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 711 SdHoareTripleChecker+Valid, 2903 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:26,369 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [711 Valid, 2903 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:43:26,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169545 states. [2025-02-06 02:43:28,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169545 to 117453. [2025-02-06 02:43:28,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117453 states, 115169 states have (on average 1.6145403711068083) internal successors, (185945), 115253 states have internal predecessors, (185945), 2160 states have call successors, (2160), 123 states have call predecessors, (2160), 123 states have return successors, (2160), 2076 states have call predecessors, (2160), 2160 states have call successors, (2160) [2025-02-06 02:43:28,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117453 states to 117453 states and 190265 transitions. [2025-02-06 02:43:28,735 INFO L78 Accepts]: Start accepts. Automaton has 117453 states and 190265 transitions. Word has length 441 [2025-02-06 02:43:28,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:28,736 INFO L471 AbstractCegarLoop]: Abstraction has 117453 states and 190265 transitions. [2025-02-06 02:43:28,736 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:28,736 INFO L276 IsEmpty]: Start isEmpty. Operand 117453 states and 190265 transitions. [2025-02-06 02:43:28,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 443 [2025-02-06 02:43:28,769 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:28,769 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:43:28,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:43:28,769 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:28,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:28,770 INFO L85 PathProgramCache]: Analyzing trace with hash 155794547, now seen corresponding path program 1 times [2025-02-06 02:43:28,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:28,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59780331] [2025-02-06 02:43:28,770 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:28,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:28,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 442 statements into 1 equivalence classes. [2025-02-06 02:43:29,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 442 of 442 statements. [2025-02-06 02:43:29,583 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:29,583 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:29,863 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-02-06 02:43:29,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:29,864 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59780331] [2025-02-06 02:43:29,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59780331] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:43:29,864 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:43:29,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:43:29,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321783136] [2025-02-06 02:43:29,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:43:29,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:43:29,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:29,865 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:43:29,865 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:43:29,865 INFO L87 Difference]: Start difference. First operand 117453 states and 190265 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:31,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:31,383 INFO L93 Difference]: Finished difference Result 234541 states and 379955 transitions. [2025-02-06 02:43:31,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:43:31,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 442 [2025-02-06 02:43:31,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:31,523 INFO L225 Difference]: With dead ends: 234541 [2025-02-06 02:43:31,524 INFO L226 Difference]: Without dead ends: 117453 [2025-02-06 02:43:31,587 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-02-06 02:43:31,588 INFO L435 NwaCegarLoop]: 460 mSDtfsCounter, 0 mSDsluCounter, 445 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 905 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:31,588 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 905 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:43:31,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117453 states. [2025-02-06 02:43:33,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117453 to 117453. [2025-02-06 02:43:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117453 states, 115169 states have (on average 1.6117618456355443) internal successors, (185625), 115253 states have internal predecessors, (185625), 2160 states have call successors, (2160), 123 states have call predecessors, (2160), 123 states have return successors, (2160), 2076 states have call predecessors, (2160), 2160 states have call successors, (2160) [2025-02-06 02:43:33,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117453 states to 117453 states and 189945 transitions. [2025-02-06 02:43:33,906 INFO L78 Accepts]: Start accepts. Automaton has 117453 states and 189945 transitions. Word has length 442 [2025-02-06 02:43:33,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:33,906 INFO L471 AbstractCegarLoop]: Abstraction has 117453 states and 189945 transitions. [2025-02-06 02:43:33,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-02-06 02:43:33,906 INFO L276 IsEmpty]: Start isEmpty. Operand 117453 states and 189945 transitions. [2025-02-06 02:43:33,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 444 [2025-02-06 02:43:33,925 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:33,926 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:43:33,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:43:33,926 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:33,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:33,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1790009047, now seen corresponding path program 1 times [2025-02-06 02:43:33,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:33,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263697584] [2025-02-06 02:43:33,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:33,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:33,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-06 02:43:36,431 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-06 02:43:36,431 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:36,431 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:37,507 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 27 proven. 150 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-02-06 02:43:37,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:43:37,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263697584] [2025-02-06 02:43:37,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263697584] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:43:37,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [30284349] [2025-02-06 02:43:37,508 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:37,509 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:43:37,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:43:37,512 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-02-06 02:43:37,515 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-02-06 02:43:37,717 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 443 statements into 1 equivalence classes. [2025-02-06 02:43:37,868 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 443 of 443 statements. [2025-02-06 02:43:37,868 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:43:37,868 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:43:37,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 1122 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-02-06 02:43:37,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:43:38,993 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3417 proven. 108 refuted. 0 times theorem prover too weak. 3555 trivial. 0 not checked. [2025-02-06 02:43:38,993 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:43:39,647 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 69 proven. 108 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-02-06 02:43:39,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [30284349] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:43:39,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:43:39,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 18 [2025-02-06 02:43:39,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290672040] [2025-02-06 02:43:39,648 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:43:39,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-06 02:43:39,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:43:39,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-06 02:43:39,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2025-02-06 02:43:39,650 INFO L87 Difference]: Start difference. First operand 117453 states and 189945 transitions. Second operand has 18 states, 18 states have (on average 16.555555555555557) internal successors, (298), 18 states have internal predecessors, (298), 5 states have call successors, (170), 3 states have call predecessors, (170), 6 states have return successors, (171), 5 states have call predecessors, (171), 5 states have call successors, (171) [2025-02-06 02:43:44,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:43:44,139 INFO L93 Difference]: Finished difference Result 209731 states and 337909 transitions. [2025-02-06 02:43:44,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2025-02-06 02:43:44,139 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 16.555555555555557) internal successors, (298), 18 states have internal predecessors, (298), 5 states have call successors, (170), 3 states have call predecessors, (170), 6 states have return successors, (171), 5 states have call predecessors, (171), 5 states have call successors, (171) Word has length 443 [2025-02-06 02:43:44,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:43:44,294 INFO L225 Difference]: With dead ends: 209731 [2025-02-06 02:43:44,294 INFO L226 Difference]: Without dead ends: 93595 [2025-02-06 02:43:44,349 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 930 GetRequests, 879 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 722 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=476, Invalid=2280, Unknown=0, NotChecked=0, Total=2756 [2025-02-06 02:43:44,350 INFO L435 NwaCegarLoop]: 349 mSDtfsCounter, 2600 mSDsluCounter, 3242 mSDsCounter, 0 mSdLazyCounter, 2503 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2610 SdHoareTripleChecker+Valid, 3591 SdHoareTripleChecker+Invalid, 3080 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 2503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:43:44,350 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2610 Valid, 3591 Invalid, 3080 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 2503 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 02:43:44,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93595 states. [2025-02-06 02:43:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93595 to 92829. [2025-02-06 02:43:46,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92829 states, 89307 states have (on average 1.5905024242220656) internal successors, (142043), 89487 states have internal predecessors, (142043), 3128 states have call successors, (3128), 393 states have call predecessors, (3128), 393 states have return successors, (3128), 2948 states have call predecessors, (3128), 3128 states have call successors, (3128) [2025-02-06 02:43:46,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92829 states to 92829 states and 148299 transitions. [2025-02-06 02:43:46,498 INFO L78 Accepts]: Start accepts. Automaton has 92829 states and 148299 transitions. Word has length 443 [2025-02-06 02:43:46,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:43:46,499 INFO L471 AbstractCegarLoop]: Abstraction has 92829 states and 148299 transitions. [2025-02-06 02:43:46,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 16.555555555555557) internal successors, (298), 18 states have internal predecessors, (298), 5 states have call successors, (170), 3 states have call predecessors, (170), 6 states have return successors, (171), 5 states have call predecessors, (171), 5 states have call successors, (171) [2025-02-06 02:43:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 92829 states and 148299 transitions. [2025-02-06 02:43:46,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2025-02-06 02:43:46,512 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:43:46,512 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-02-06 02:43:46,524 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:43:46,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-02-06 02:43:46,713 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:43:46,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:43:46,714 INFO L85 PathProgramCache]: Analyzing trace with hash 344050809, now seen corresponding path program 1 times [2025-02-06 02:43:46,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:43:46,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424779242] [2025-02-06 02:43:46,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:43:46,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:43:46,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 444 statements into 1 equivalence classes.