./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.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-0.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 6220e6745b3165a6fc1efc167bda264ea9d52d0f56711813aaca8387b0aa2cbd --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:36:22,665 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:36:22,736 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:36:22,740 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:36:22,741 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:36:22,763 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:36:22,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:36:22,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:36:22,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:36:22,765 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:36:22,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:36:22,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:36:22,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:36:22,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:36:22,766 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:36:22,766 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:36:22,766 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:36:22,766 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:36:22,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:36:22,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:36:22,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:36:22,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:36:22,767 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:36:22,767 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:36:22,767 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:36:22,767 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:36:22,767 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:36:22,767 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:36:22,767 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:36:22,767 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:36:22,767 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:36:22,768 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:36:22,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:36:22,768 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:36:22,768 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:36:22,768 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:36:22,768 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:36:22,768 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:36:22,768 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:36:22,768 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:36:22,769 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:36:22,769 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:36:22,769 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:36:22,769 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 -> 6220e6745b3165a6fc1efc167bda264ea9d52d0f56711813aaca8387b0aa2cbd [2025-02-06 02:36:23,073 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:36:23,081 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:36:23,085 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:36:23,086 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:36:23,086 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:36:23,087 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-0.i [2025-02-06 02:36:24,529 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a760af003/5fe636f1147f4eb58b8ecd319aa1bf1e/FLAG93608d05b [2025-02-06 02:36:24,841 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:36:24,841 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-0.i [2025-02-06 02:36:24,874 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a760af003/5fe636f1147f4eb58b8ecd319aa1bf1e/FLAG93608d05b [2025-02-06 02:36:24,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a760af003/5fe636f1147f4eb58b8ecd319aa1bf1e [2025-02-06 02:36:24,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:36:24,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:36:24,898 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:36:24,898 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:36:24,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:36:24,902 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:36:24" (1/1) ... [2025-02-06 02:36:24,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@302ba96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:24, skipping insertion in model container [2025-02-06 02:36:24,905 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:36:24" (1/1) ... [2025-02-06 02:36:24,947 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:36:25,102 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-0.i[915,928] [2025-02-06 02:36:25,333 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:36:25,356 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:36:25,369 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-0.i[915,928] [2025-02-06 02:36:25,496 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:36:25,516 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:36:25,517 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:25 WrapperNode [2025-02-06 02:36:25,517 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:36:25,518 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:36:25,518 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:36:25,519 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:36:25,524 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:36:25" (1/1) ... [2025-02-06 02:36:25,547 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:36:25" (1/1) ... [2025-02-06 02:36:25,639 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 717 [2025-02-06 02:36:25,640 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:36:25,640 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:36:25,640 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:36:25,641 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:36:25,649 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:25" (1/1) ... [2025-02-06 02:36:25,650 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:25" (1/1) ... [2025-02-06 02:36:25,674 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:25" (1/1) ... [2025-02-06 02:36:25,758 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:36:25,758 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:25" (1/1) ... [2025-02-06 02:36:25,759 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:25" (1/1) ... [2025-02-06 02:36:25,791 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:25" (1/1) ... [2025-02-06 02:36:25,802 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:25" (1/1) ... [2025-02-06 02:36:25,815 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:25" (1/1) ... [2025-02-06 02:36:25,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:25" (1/1) ... [2025-02-06 02:36:25,841 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:36:25,843 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:36:25,843 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:36:25,843 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:36:25,844 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:25" (1/1) ... [2025-02-06 02:36:25,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:36:25,860 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:36:25,875 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:36:25,881 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:36:25,902 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:36:25,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:36:25,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:36:25,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:36:25,903 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:36:25,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:36:26,041 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:36:26,043 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:36:27,176 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L605: havoc property_#t~ite46#1;havoc property_#t~bitwise45#1;havoc property_#t~short47#1;havoc property_#t~ite50#1;havoc property_#t~ite49#1;havoc property_#t~bitwise48#1;havoc property_#t~short51#1;havoc property_#t~ite56#1;havoc property_#t~ite55#1;havoc property_#t~ite54#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short57#1;havoc property_#t~ite60#1;havoc property_#t~ite59#1;havoc property_#t~bitwise58#1;havoc property_#t~short61#1;havoc property_#t~bitwise62#1;havoc property_#t~bitwise63#1;havoc property_#t~short64#1; [2025-02-06 02:36:27,332 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2025-02-06 02:36:27,333 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:36:27,367 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:36:27,368 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:36:27,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:27 BoogieIcfgContainer [2025-02-06 02:36:27,368 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:36:27,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:36:27,370 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:36:27,375 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:36:27,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:36:24" (1/3) ... [2025-02-06 02:36:27,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@922fd32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:36:27, skipping insertion in model container [2025-02-06 02:36:27,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:36:25" (2/3) ... [2025-02-06 02:36:27,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@922fd32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:36:27, skipping insertion in model container [2025-02-06 02:36:27,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:36:27" (3/3) ... [2025-02-06 02:36:27,377 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-0.i [2025-02-06 02:36:27,390 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:36:27,393 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-0.i that has 2 procedures, 289 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:36:27,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:36:27,474 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;@76c4f930, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:36:27,475 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:36:27,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 289 states, 225 states have (on average 1.5555555555555556) internal successors, (350), 226 states have internal predecessors, (350), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-06 02:36:27,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-06 02:36:27,508 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:27,509 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:27,509 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:27,515 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:27,516 INFO L85 PathProgramCache]: Analyzing trace with hash -1996051682, now seen corresponding path program 1 times [2025-02-06 02:36:27,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:27,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [982599718] [2025-02-06 02:36:27,526 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:27,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:27,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-06 02:36:27,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-06 02:36:27,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:27,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:28,247 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-02-06 02:36:28,248 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:28,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [982599718] [2025-02-06 02:36:28,250 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [982599718] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:36:28,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288235857] [2025-02-06 02:36:28,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:28,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:36:28,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:36:28,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:36:28,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:36:28,449 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-06 02:36:28,639 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-06 02:36:28,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:28,640 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:28,648 INFO L256 TraceCheckSpWp]: Trace formula consists of 1100 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:36:28,673 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:36:28,736 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-02-06 02:36:28,739 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:36:28,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288235857] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:28,739 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:36:28,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:36:28,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255656432] [2025-02-06 02:36:28,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:28,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:36:28,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:28,771 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:36:28,771 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:36:28,774 INFO L87 Difference]: Start difference. First operand has 289 states, 225 states have (on average 1.5555555555555556) internal successors, (350), 226 states have internal predecessors, (350), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-02-06 02:36:28,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:28,882 INFO L93 Difference]: Finished difference Result 572 states and 1000 transitions. [2025-02-06 02:36:28,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:36:28,885 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) Word has length 429 [2025-02-06 02:36:28,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:28,894 INFO L225 Difference]: With dead ends: 572 [2025-02-06 02:36:28,896 INFO L226 Difference]: Without dead ends: 286 [2025-02-06 02:36:28,904 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 430 GetRequests, 430 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:36:28,907 INFO L435 NwaCegarLoop]: 454 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, 454 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:36:28,908 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 454 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:36:28,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 286 states. [2025-02-06 02:36:28,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 286 to 286. [2025-02-06 02:36:28,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 223 states have (on average 1.5426008968609866) internal successors, (344), 223 states have internal predecessors, (344), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-02-06 02:36:28,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 466 transitions. [2025-02-06 02:36:28,996 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 466 transitions. Word has length 429 [2025-02-06 02:36:28,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:28,998 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 466 transitions. [2025-02-06 02:36:28,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 64.5) internal successors, (129), 2 states have internal predecessors, (129), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-02-06 02:36:28,999 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 466 transitions. [2025-02-06 02:36:29,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-06 02:36:29,012 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:29,013 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:29,024 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:36:29,217 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:36:29,217 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:29,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:29,218 INFO L85 PathProgramCache]: Analyzing trace with hash 950650581, now seen corresponding path program 1 times [2025-02-06 02:36:29,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:29,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949124756] [2025-02-06 02:36:29,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:29,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:29,308 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-06 02:36:29,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-06 02:36:29,355 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:29,355 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:29,739 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-02-06 02:36:29,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:29,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949124756] [2025-02-06 02:36:29,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949124756] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:29,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:36:29,740 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:36:29,740 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259935304] [2025-02-06 02:36:29,740 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:29,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:36:29,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:29,745 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:36:29,745 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:36:29,746 INFO L87 Difference]: Start difference. First operand 286 states and 466 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:29,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:29,919 INFO L93 Difference]: Finished difference Result 754 states and 1227 transitions. [2025-02-06 02:36:29,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:36:29,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-02-06 02:36:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:29,927 INFO L225 Difference]: With dead ends: 754 [2025-02-06 02:36:29,929 INFO L226 Difference]: Without dead ends: 471 [2025-02-06 02:36:29,930 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:36:29,931 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 288 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 1098 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:29,931 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 1098 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:36:29,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2025-02-06 02:36:29,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 468. [2025-02-06 02:36:29,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 468 states, 398 states have (on average 1.5678391959798994) internal successors, (624), 399 states have internal predecessors, (624), 67 states have call successors, (67), 2 states have call predecessors, (67), 2 states have return successors, (67), 66 states have call predecessors, (67), 67 states have call successors, (67) [2025-02-06 02:36:29,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 758 transitions. [2025-02-06 02:36:29,982 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 758 transitions. Word has length 429 [2025-02-06 02:36:29,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:29,984 INFO L471 AbstractCegarLoop]: Abstraction has 468 states and 758 transitions. [2025-02-06 02:36:29,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:29,984 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 758 transitions. [2025-02-06 02:36:29,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-06 02:36:29,992 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:29,992 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:29,992 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:36:29,993 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:29,993 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:29,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1022302167, now seen corresponding path program 1 times [2025-02-06 02:36:29,994 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:29,994 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7685323] [2025-02-06 02:36:29,994 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:29,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:30,040 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-06 02:36:30,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-06 02:36:30,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:30,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:30,460 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-02-06 02:36:30,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:30,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7685323] [2025-02-06 02:36:30,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7685323] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:30,463 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:36:30,463 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:36:30,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191075243] [2025-02-06 02:36:30,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:30,464 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:36:30,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:30,465 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:36:30,465 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:36:30,465 INFO L87 Difference]: Start difference. First operand 468 states and 758 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:30,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:30,623 INFO L93 Difference]: Finished difference Result 1268 states and 2051 transitions. [2025-02-06 02:36:30,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:36:30,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-02-06 02:36:30,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:30,633 INFO L225 Difference]: With dead ends: 1268 [2025-02-06 02:36:30,636 INFO L226 Difference]: Without dead ends: 803 [2025-02-06 02:36:30,637 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:36:30,638 INFO L435 NwaCegarLoop]: 444 mSDtfsCounter, 263 mSDsluCounter, 434 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:30,638 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 878 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:36:30,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 803 states. [2025-02-06 02:36:30,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 803 to 800. [2025-02-06 02:36:30,683 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 708 states have (on average 1.57909604519774) internal successors, (1118), 711 states have internal predecessors, (1118), 87 states have call successors, (87), 4 states have call predecessors, (87), 4 states have return successors, (87), 84 states have call predecessors, (87), 87 states have call successors, (87) [2025-02-06 02:36:30,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1292 transitions. [2025-02-06 02:36:30,691 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1292 transitions. Word has length 429 [2025-02-06 02:36:30,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:30,693 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1292 transitions. [2025-02-06 02:36:30,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:30,694 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1292 transitions. [2025-02-06 02:36:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-06 02:36:30,701 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:30,701 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:30,701 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:36:30,701 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:30,713 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:30,713 INFO L85 PathProgramCache]: Analyzing trace with hash -678438312, now seen corresponding path program 1 times [2025-02-06 02:36:30,713 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:30,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215276686] [2025-02-06 02:36:30,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:30,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:30,768 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-06 02:36:30,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-06 02:36:30,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:30,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:32,408 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-02-06 02:36:32,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:32,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215276686] [2025-02-06 02:36:32,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [215276686] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:32,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:36:32,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:36:32,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365378029] [2025-02-06 02:36:32,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:32,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:36:32,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:32,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:36:32,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:36:32,413 INFO L87 Difference]: Start difference. First operand 800 states and 1292 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:33,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:33,040 INFO L93 Difference]: Finished difference Result 2913 states and 4682 transitions. [2025-02-06 02:36:33,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:36:33,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-02-06 02:36:33,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:33,053 INFO L225 Difference]: With dead ends: 2913 [2025-02-06 02:36:33,053 INFO L226 Difference]: Without dead ends: 2116 [2025-02-06 02:36:33,056 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:36:33,058 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 923 mSDsluCounter, 1323 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 923 SdHoareTripleChecker+Valid, 1852 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:33,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [923 Valid, 1852 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:36:33,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2116 states. [2025-02-06 02:36:33,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2116 to 1589. [2025-02-06 02:36:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1589 states, 1445 states have (on average 1.5847750865051904) internal successors, (2290), 1453 states have internal predecessors, (2290), 131 states have call successors, (131), 12 states have call predecessors, (131), 12 states have return successors, (131), 123 states have call predecessors, (131), 131 states have call successors, (131) [2025-02-06 02:36:33,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1589 states to 1589 states and 2552 transitions. [2025-02-06 02:36:33,169 INFO L78 Accepts]: Start accepts. Automaton has 1589 states and 2552 transitions. Word has length 429 [2025-02-06 02:36:33,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:33,170 INFO L471 AbstractCegarLoop]: Abstraction has 1589 states and 2552 transitions. [2025-02-06 02:36:33,170 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:33,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1589 states and 2552 transitions. [2025-02-06 02:36:33,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-06 02:36:33,183 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:33,183 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:33,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:36:33,183 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:33,184 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:33,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1113764039, now seen corresponding path program 1 times [2025-02-06 02:36:33,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:33,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229910505] [2025-02-06 02:36:33,185 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:33,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:33,230 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-06 02:36:33,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-06 02:36:33,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:33,281 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:33,474 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-02-06 02:36:33,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:33,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229910505] [2025-02-06 02:36:33,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229910505] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:33,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:36:33,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:36:33,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456496990] [2025-02-06 02:36:33,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:33,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:36:33,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:33,477 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:36:33,477 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:36:33,478 INFO L87 Difference]: Start difference. First operand 1589 states and 2552 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:33,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:33,689 INFO L93 Difference]: Finished difference Result 4413 states and 7092 transitions. [2025-02-06 02:36:33,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:36:33,690 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-02-06 02:36:33,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:33,704 INFO L225 Difference]: With dead ends: 4413 [2025-02-06 02:36:33,704 INFO L226 Difference]: Without dead ends: 2851 [2025-02-06 02:36:33,708 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:36:33,708 INFO L435 NwaCegarLoop]: 575 mSDtfsCounter, 228 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 1008 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:33,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 1008 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:36:33,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2851 states. [2025-02-06 02:36:33,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2851 to 2845. [2025-02-06 02:36:33,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2845 states, 2627 states have (on average 1.5812714122573277) internal successors, (4154), 2643 states have internal predecessors, (4154), 195 states have call successors, (195), 22 states have call predecessors, (195), 22 states have return successors, (195), 179 states have call predecessors, (195), 195 states have call successors, (195) [2025-02-06 02:36:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2845 states to 2845 states and 4544 transitions. [2025-02-06 02:36:33,843 INFO L78 Accepts]: Start accepts. Automaton has 2845 states and 4544 transitions. Word has length 429 [2025-02-06 02:36:33,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:33,844 INFO L471 AbstractCegarLoop]: Abstraction has 2845 states and 4544 transitions. [2025-02-06 02:36:33,844 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:33,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2845 states and 4544 transitions. [2025-02-06 02:36:33,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-06 02:36:33,857 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:33,858 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:33,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:36:33,860 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:33,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:33,864 INFO L85 PathProgramCache]: Analyzing trace with hash -1009449799, now seen corresponding path program 1 times [2025-02-06 02:36:33,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:33,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459744826] [2025-02-06 02:36:33,864 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:33,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:33,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-06 02:36:33,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-06 02:36:33,938 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:33,938 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:34,097 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-02-06 02:36:34,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:34,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459744826] [2025-02-06 02:36:34,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459744826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:34,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:36:34,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:36:34,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45535464] [2025-02-06 02:36:34,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:34,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:36:34,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:34,101 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:36:34,101 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:36:34,101 INFO L87 Difference]: Start difference. First operand 2845 states and 4544 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:34,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:34,281 INFO L93 Difference]: Finished difference Result 7931 states and 12774 transitions. [2025-02-06 02:36:34,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:36:34,282 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-02-06 02:36:34,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:34,308 INFO L225 Difference]: With dead ends: 7931 [2025-02-06 02:36:34,308 INFO L226 Difference]: Without dead ends: 5113 [2025-02-06 02:36:34,315 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:36:34,316 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 292 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 865 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:34,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 865 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:36:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2025-02-06 02:36:34,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 4695. [2025-02-06 02:36:34,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4695 states, 4477 states have (on average 1.6216216216216217) internal successors, (7260), 4493 states have internal predecessors, (7260), 195 states have call successors, (195), 22 states have call predecessors, (195), 22 states have return successors, (195), 179 states have call predecessors, (195), 195 states have call successors, (195) [2025-02-06 02:36:34,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4695 states to 4695 states and 7650 transitions. [2025-02-06 02:36:34,531 INFO L78 Accepts]: Start accepts. Automaton has 4695 states and 7650 transitions. Word has length 429 [2025-02-06 02:36:34,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:34,532 INFO L471 AbstractCegarLoop]: Abstraction has 4695 states and 7650 transitions. [2025-02-06 02:36:34,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 3 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:34,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4695 states and 7650 transitions. [2025-02-06 02:36:34,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-06 02:36:34,549 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:34,549 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:34,550 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:36:34,550 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:34,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash -889329926, now seen corresponding path program 1 times [2025-02-06 02:36:34,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:34,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413248798] [2025-02-06 02:36:34,550 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:34,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:34,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-06 02:36:34,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-06 02:36:34,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:34,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:35,545 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-02-06 02:36:35,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:35,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413248798] [2025-02-06 02:36:35,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413248798] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:35,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:36:35,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:36:35,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932565463] [2025-02-06 02:36:35,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:35,547 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:36:35,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:35,548 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:36:35,548 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:36:35,549 INFO L87 Difference]: Start difference. First operand 4695 states and 7650 transitions. Second operand has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-02-06 02:36:36,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:36,822 INFO L93 Difference]: Finished difference Result 15861 states and 25720 transitions. [2025-02-06 02:36:36,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:36:36,824 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 429 [2025-02-06 02:36:36,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:36,874 INFO L225 Difference]: With dead ends: 15861 [2025-02-06 02:36:36,875 INFO L226 Difference]: Without dead ends: 11193 [2025-02-06 02:36:36,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:36:36,889 INFO L435 NwaCegarLoop]: 512 mSDtfsCounter, 958 mSDsluCounter, 1613 mSDsCounter, 0 mSdLazyCounter, 430 mSolverCounterSat, 260 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 958 SdHoareTripleChecker+Valid, 2125 SdHoareTripleChecker+Invalid, 690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 260 IncrementalHoareTripleChecker+Valid, 430 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:36,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [958 Valid, 2125 Invalid, 690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [260 Valid, 430 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-06 02:36:36,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11193 states. [2025-02-06 02:36:37,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11193 to 9301. [2025-02-06 02:36:37,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9301 states, 8875 states have (on average 1.615661971830986) internal successors, (14339), 8906 states have internal predecessors, (14339), 382 states have call successors, (382), 43 states have call predecessors, (382), 43 states have return successors, (382), 351 states have call predecessors, (382), 382 states have call successors, (382) [2025-02-06 02:36:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9301 states to 9301 states and 15103 transitions. [2025-02-06 02:36:37,245 INFO L78 Accepts]: Start accepts. Automaton has 9301 states and 15103 transitions. Word has length 429 [2025-02-06 02:36:37,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:37,245 INFO L471 AbstractCegarLoop]: Abstraction has 9301 states and 15103 transitions. [2025-02-06 02:36:37,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 21.166666666666668) internal successors, (127), 6 states have internal predecessors, (127), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-02-06 02:36:37,246 INFO L276 IsEmpty]: Start isEmpty. Operand 9301 states and 15103 transitions. [2025-02-06 02:36:37,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 430 [2025-02-06 02:36:37,262 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:37,263 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:37,263 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:36:37,264 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:37,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:37,264 INFO L85 PathProgramCache]: Analyzing trace with hash -875797125, now seen corresponding path program 1 times [2025-02-06 02:36:37,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:37,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649504409] [2025-02-06 02:36:37,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:37,265 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:37,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 429 statements into 1 equivalence classes. [2025-02-06 02:36:37,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 429 of 429 statements. [2025-02-06 02:36:37,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:37,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:38,296 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-02-06 02:36:38,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:38,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649504409] [2025-02-06 02:36:38,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649504409] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:38,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:36:38,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:36:38,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337481581] [2025-02-06 02:36:38,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:38,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:36:38,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:38,299 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:36:38,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:36:38,299 INFO L87 Difference]: Start difference. First operand 9301 states and 15103 transitions. Second operand has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:38,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:38,614 INFO L93 Difference]: Finished difference Result 18569 states and 30134 transitions. [2025-02-06 02:36:38,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:36:38,615 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 429 [2025-02-06 02:36:38,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:38,654 INFO L225 Difference]: With dead ends: 18569 [2025-02-06 02:36:38,654 INFO L226 Difference]: Without dead ends: 9295 [2025-02-06 02:36:38,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 1 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:36:38,672 INFO L435 NwaCegarLoop]: 680 mSDtfsCounter, 477 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:38,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1117 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:36:38,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9295 states. [2025-02-06 02:36:38,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9295 to 7749. [2025-02-06 02:36:38,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7749 states, 7463 states have (on average 1.6388851668229933) internal successors, (12231), 7478 states have internal predecessors, (12231), 254 states have call successors, (254), 31 states have call predecessors, (254), 31 states have return successors, (254), 239 states have call predecessors, (254), 254 states have call successors, (254) [2025-02-06 02:36:39,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7749 states to 7749 states and 12739 transitions. [2025-02-06 02:36:39,004 INFO L78 Accepts]: Start accepts. Automaton has 7749 states and 12739 transitions. Word has length 429 [2025-02-06 02:36:39,005 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:39,005 INFO L471 AbstractCegarLoop]: Abstraction has 7749 states and 12739 transitions. [2025-02-06 02:36:39,006 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 31.75) internal successors, (127), 4 states have internal predecessors, (127), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:39,006 INFO L276 IsEmpty]: Start isEmpty. Operand 7749 states and 12739 transitions. [2025-02-06 02:36:39,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-06 02:36:39,020 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:39,020 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:39,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:36:39,020 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:39,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:39,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1639930500, now seen corresponding path program 1 times [2025-02-06 02:36:39,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:39,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846215458] [2025-02-06 02:36:39,021 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:39,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:39,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-06 02:36:39,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-06 02:36:39,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:39,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:40,270 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-02-06 02:36:40,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:40,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846215458] [2025-02-06 02:36:40,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846215458] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:40,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:36:40,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:36:40,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1128111083] [2025-02-06 02:36:40,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:40,271 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:36:40,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:40,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:36:40,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:36:40,272 INFO L87 Difference]: Start difference. First operand 7749 states and 12739 transitions. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:40,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:40,827 INFO L93 Difference]: Finished difference Result 21541 states and 35508 transitions. [2025-02-06 02:36:40,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:36:40,828 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 430 [2025-02-06 02:36:40,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:40,873 INFO L225 Difference]: With dead ends: 21541 [2025-02-06 02:36:40,874 INFO L226 Difference]: Without dead ends: 13819 [2025-02-06 02:36:40,894 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:36:40,896 INFO L435 NwaCegarLoop]: 493 mSDtfsCounter, 886 mSDsluCounter, 1502 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1995 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:40,897 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1995 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:36:40,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13819 states. [2025-02-06 02:36:41,186 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13819 to 7373. [2025-02-06 02:36:41,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7373 states, 7135 states have (on average 1.6183601962158374) internal successors, (11547), 7142 states have internal predecessors, (11547), 206 states have call successors, (206), 31 states have call predecessors, (206), 31 states have return successors, (206), 199 states have call predecessors, (206), 206 states have call successors, (206) [2025-02-06 02:36:41,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7373 states to 7373 states and 11959 transitions. [2025-02-06 02:36:41,223 INFO L78 Accepts]: Start accepts. Automaton has 7373 states and 11959 transitions. Word has length 430 [2025-02-06 02:36:41,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:41,224 INFO L471 AbstractCegarLoop]: Abstraction has 7373 states and 11959 transitions. [2025-02-06 02:36:41,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:41,224 INFO L276 IsEmpty]: Start isEmpty. Operand 7373 states and 11959 transitions. [2025-02-06 02:36:41,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-02-06 02:36:41,236 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:41,236 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:41,236 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:36:41,237 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:41,237 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:41,237 INFO L85 PathProgramCache]: Analyzing trace with hash -506739907, now seen corresponding path program 1 times [2025-02-06 02:36:41,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:41,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1197933343] [2025-02-06 02:36:41,238 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:41,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:41,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-06 02:36:43,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-06 02:36:43,403 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:43,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:43,973 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 18 proven. 162 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-02-06 02:36:43,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:43,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1197933343] [2025-02-06 02:36:43,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1197933343] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:36:43,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620543498] [2025-02-06 02:36:43,973 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:43,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:36:43,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:36:43,976 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:36:43,979 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:36:44,190 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-02-06 02:36:44,356 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-02-06 02:36:44,357 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:44,357 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:44,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:36:44,376 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:36:45,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 2080 proven. 150 refuted. 0 times theorem prover too weak. 5090 trivial. 0 not checked. [2025-02-06 02:36:45,042 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:36:45,593 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 30 proven. 150 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-02-06 02:36:45,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620543498] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:36:45,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:36:45,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-02-06 02:36:45,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [593503209] [2025-02-06 02:36:45,594 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:36:45,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 02:36:45,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:45,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 02:36:45,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:36:45,596 INFO L87 Difference]: Start difference. First operand 7373 states and 11959 transitions. Second operand has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 3 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (167), 3 states have call predecessors, (167), 3 states have call successors, (167) [2025-02-06 02:36:46,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:46,289 INFO L93 Difference]: Finished difference Result 10257 states and 16447 transitions. [2025-02-06 02:36:46,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 02:36:46,290 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 3 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (167), 3 states have call predecessors, (167), 3 states have call successors, (167) Word has length 430 [2025-02-06 02:36:46,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:46,302 INFO L225 Difference]: With dead ends: 10257 [2025-02-06 02:36:46,302 INFO L226 Difference]: Without dead ends: 2911 [2025-02-06 02:36:46,314 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 872 GetRequests, 857 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:36:46,315 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 576 mSDsluCounter, 643 mSDsCounter, 0 mSdLazyCounter, 488 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 1027 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 488 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:46,315 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 1027 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 488 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:36:46,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2911 states. [2025-02-06 02:36:46,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2911 to 2786. [2025-02-06 02:36:46,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2786 states, 2528 states have (on average 1.5387658227848102) internal successors, (3890), 2535 states have internal predecessors, (3890), 208 states have call successors, (208), 49 states have call predecessors, (208), 49 states have return successors, (208), 201 states have call predecessors, (208), 208 states have call successors, (208) [2025-02-06 02:36:46,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2786 states to 2786 states and 4306 transitions. [2025-02-06 02:36:46,496 INFO L78 Accepts]: Start accepts. Automaton has 2786 states and 4306 transitions. Word has length 430 [2025-02-06 02:36:46,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:46,498 INFO L471 AbstractCegarLoop]: Abstraction has 2786 states and 4306 transitions. [2025-02-06 02:36:46,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 23.75) internal successors, (190), 8 states have internal predecessors, (190), 3 states have call successors, (165), 2 states have call predecessors, (165), 4 states have return successors, (167), 3 states have call predecessors, (167), 3 states have call successors, (167) [2025-02-06 02:36:46,499 INFO L276 IsEmpty]: Start isEmpty. Operand 2786 states and 4306 transitions. [2025-02-06 02:36:46,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-02-06 02:36:46,504 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:46,504 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:46,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:36:46,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:36:46,710 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:46,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:46,711 INFO L85 PathProgramCache]: Analyzing trace with hash 14260891, now seen corresponding path program 1 times [2025-02-06 02:36:46,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:46,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134013273] [2025-02-06 02:36:46,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:46,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:46,754 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-02-06 02:36:46,806 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-02-06 02:36:46,806 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:46,806 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:47,265 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-02-06 02:36:47,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:47,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134013273] [2025-02-06 02:36:47,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134013273] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:47,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:36:47,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:36:47,266 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428260018] [2025-02-06 02:36:47,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:47,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:36:47,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:47,267 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:36:47,268 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:36:47,268 INFO L87 Difference]: Start difference. First operand 2786 states and 4306 transitions. Second operand has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:47,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:47,723 INFO L93 Difference]: Finished difference Result 9940 states and 15547 transitions. [2025-02-06 02:36:47,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:36:47,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 431 [2025-02-06 02:36:47,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:47,748 INFO L225 Difference]: With dead ends: 9940 [2025-02-06 02:36:47,748 INFO L226 Difference]: Without dead ends: 7192 [2025-02-06 02:36:47,758 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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:36:47,760 INFO L435 NwaCegarLoop]: 629 mSDtfsCounter, 595 mSDsluCounter, 875 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 184 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 595 SdHoareTripleChecker+Valid, 1504 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 184 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:47,761 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [595 Valid, 1504 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [184 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:36:47,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7192 states. [2025-02-06 02:36:48,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7192 to 5532. [2025-02-06 02:36:48,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5532 states, 5031 states have (on average 1.5382627708209105) internal successors, (7739), 5044 states have internal predecessors, (7739), 406 states have call successors, (406), 94 states have call predecessors, (406), 94 states have return successors, (406), 393 states have call predecessors, (406), 406 states have call successors, (406) [2025-02-06 02:36:48,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 8551 transitions. [2025-02-06 02:36:48,042 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 8551 transitions. Word has length 431 [2025-02-06 02:36:48,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:48,043 INFO L471 AbstractCegarLoop]: Abstraction has 5532 states and 8551 transitions. [2025-02-06 02:36:48,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.25) internal successors, (129), 4 states have internal predecessors, (129), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:48,044 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 8551 transitions. [2025-02-06 02:36:48,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-06 02:36:48,051 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:48,052 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:48,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:36:48,052 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:48,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:48,053 INFO L85 PathProgramCache]: Analyzing trace with hash -1089397366, now seen corresponding path program 1 times [2025-02-06 02:36:48,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:48,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79714104] [2025-02-06 02:36:48,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:48,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:48,088 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-06 02:36:48,355 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-06 02:36:48,356 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:48,356 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:48,980 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-02-06 02:36:48,981 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:48,981 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79714104] [2025-02-06 02:36:48,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79714104] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:36:48,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:36:48,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:36:48,981 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59143644] [2025-02-06 02:36:48,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:36:48,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:36:48,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:48,982 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:36:48,982 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:36:48,982 INFO L87 Difference]: Start difference. First operand 5532 states and 8551 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:49,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:49,326 INFO L93 Difference]: Finished difference Result 14320 states and 22291 transitions. [2025-02-06 02:36:49,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:36:49,327 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 432 [2025-02-06 02:36:49,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:49,355 INFO L225 Difference]: With dead ends: 14320 [2025-02-06 02:36:49,356 INFO L226 Difference]: Without dead ends: 8826 [2025-02-06 02:36:49,370 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:36:49,371 INFO L435 NwaCegarLoop]: 496 mSDtfsCounter, 612 mSDsluCounter, 454 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 612 SdHoareTripleChecker+Valid, 950 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:49,371 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [612 Valid, 950 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:36:49,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8826 states. [2025-02-06 02:36:49,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8826 to 5916. [2025-02-06 02:36:49,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5916 states, 5415 states have (on average 1.5532779316712835) internal successors, (8411), 5428 states have internal predecessors, (8411), 406 states have call successors, (406), 94 states have call predecessors, (406), 94 states have return successors, (406), 393 states have call predecessors, (406), 406 states have call successors, (406) [2025-02-06 02:36:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5916 states to 5916 states and 9223 transitions. [2025-02-06 02:36:49,639 INFO L78 Accepts]: Start accepts. Automaton has 5916 states and 9223 transitions. Word has length 432 [2025-02-06 02:36:49,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:49,640 INFO L471 AbstractCegarLoop]: Abstraction has 5916 states and 9223 transitions. [2025-02-06 02:36:49,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-02-06 02:36:49,641 INFO L276 IsEmpty]: Start isEmpty. Operand 5916 states and 9223 transitions. [2025-02-06 02:36:49,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-02-06 02:36:49,649 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:49,649 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:49,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:36:49,650 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:49,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:49,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1195466089, now seen corresponding path program 1 times [2025-02-06 02:36:49,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:49,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [83981592] [2025-02-06 02:36:49,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:49,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:49,685 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-06 02:36:50,638 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-06 02:36:50,639 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:50,639 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:51,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 36 proven. 144 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-02-06 02:36:51,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:36:51,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [83981592] [2025-02-06 02:36:51,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [83981592] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:36:51,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [4453409] [2025-02-06 02:36:51,735 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:51,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:36:51,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:36:51,737 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:36:51,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:36:51,979 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-02-06 02:36:52,123 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-02-06 02:36:52,124 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:52,124 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:36:52,131 INFO L256 TraceCheckSpWp]: Trace formula consists of 1098 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 02:36:52,140 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:36:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 2388 proven. 144 refuted. 0 times theorem prover too weak. 4788 trivial. 0 not checked. [2025-02-06 02:36:52,838 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:36:53,511 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 36 proven. 144 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-02-06 02:36:53,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [4453409] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:36:53,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:36:53,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 9] total 16 [2025-02-06 02:36:53,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1006934535] [2025-02-06 02:36:53,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:36:53,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-06 02:36:53,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:36:53,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-06 02:36:53,514 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2025-02-06 02:36:53,514 INFO L87 Difference]: Start difference. First operand 5916 states and 9223 transitions. Second operand has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 2 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) [2025-02-06 02:36:57,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:36:57,032 INFO L93 Difference]: Finished difference Result 24591 states and 38117 transitions. [2025-02-06 02:36:57,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-02-06 02:36:57,033 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 2 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) Word has length 432 [2025-02-06 02:36:57,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:36:57,094 INFO L225 Difference]: With dead ends: 24591 [2025-02-06 02:36:57,094 INFO L226 Difference]: Without dead ends: 18713 [2025-02-06 02:36:57,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 860 SyntacticMatches, 1 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 700 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=667, Invalid=2195, Unknown=0, NotChecked=0, Total=2862 [2025-02-06 02:36:57,113 INFO L435 NwaCegarLoop]: 856 mSDtfsCounter, 4232 mSDsluCounter, 2457 mSDsCounter, 0 mSdLazyCounter, 1706 mSolverCounterSat, 1011 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4236 SdHoareTripleChecker+Valid, 3313 SdHoareTripleChecker+Invalid, 2717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1011 IncrementalHoareTripleChecker+Valid, 1706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:36:57,113 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4236 Valid, 3313 Invalid, 2717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1011 Valid, 1706 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-02-06 02:36:57,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18713 states. [2025-02-06 02:36:57,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18713 to 15711. [2025-02-06 02:36:57,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15711 states, 14444 states have (on average 1.5218083633342565) internal successors, (21981), 14484 states have internal predecessors, (21981), 981 states have call successors, (981), 285 states have call predecessors, (981), 285 states have return successors, (981), 941 states have call predecessors, (981), 981 states have call successors, (981) [2025-02-06 02:36:57,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15711 states to 15711 states and 23943 transitions. [2025-02-06 02:36:57,937 INFO L78 Accepts]: Start accepts. Automaton has 15711 states and 23943 transitions. Word has length 432 [2025-02-06 02:36:57,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:36:57,938 INFO L471 AbstractCegarLoop]: Abstraction has 15711 states and 23943 transitions. [2025-02-06 02:36:57,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 10.5625) internal successors, (169), 16 states have internal predecessors, (169), 2 states have call successors, (109), 2 states have call predecessors, (109), 4 states have return successors, (110), 2 states have call predecessors, (110), 2 states have call successors, (110) [2025-02-06 02:36:57,938 INFO L276 IsEmpty]: Start isEmpty. Operand 15711 states and 23943 transitions. [2025-02-06 02:36:57,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-02-06 02:36:57,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:36:57,959 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36:57,970 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-06 02:36:58,163 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:36:58,163 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:36:58,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:36:58,165 INFO L85 PathProgramCache]: Analyzing trace with hash -496625700, now seen corresponding path program 1 times [2025-02-06 02:36:58,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:36:58,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055621811] [2025-02-06 02:36:58,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:36:58,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:36:58,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-06 02:36:59,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-06 02:36:59,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:36:59,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:00,304 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 153 proven. 27 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-02-06 02:37:00,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:00,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055621811] [2025-02-06 02:37:00,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055621811] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:37:00,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175927097] [2025-02-06 02:37:00,305 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:00,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:37:00,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:37:00,308 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:37:00,320 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 02:37:00,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-06 02:37:00,709 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-06 02:37:00,710 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:00,710 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:00,716 INFO L256 TraceCheckSpWp]: Trace formula consists of 1103 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-02-06 02:37:00,726 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:37:01,026 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3798 proven. 27 refuted. 0 times theorem prover too weak. 3495 trivial. 0 not checked. [2025-02-06 02:37:01,026 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:37:01,355 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 153 proven. 27 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-02-06 02:37:01,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175927097] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:37:01,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:37:01,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2025-02-06 02:37:01,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [355765870] [2025-02-06 02:37:01,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:37:01,357 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-02-06 02:37:01,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:01,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-02-06 02:37:01,358 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:37:01,358 INFO L87 Difference]: Start difference. First operand 15711 states and 23943 transitions. Second operand has 17 states, 16 states have (on average 12.1875) internal successors, (195), 17 states have internal predecessors, (195), 7 states have call successors, (103), 3 states have call predecessors, (103), 6 states have return successors, (103), 6 states have call predecessors, (103), 7 states have call successors, (103) [2025-02-06 02:37:02,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:02,515 INFO L93 Difference]: Finished difference Result 31277 states and 47639 transitions. [2025-02-06 02:37:02,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-06 02:37:02,516 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 12.1875) internal successors, (195), 17 states have internal predecessors, (195), 7 states have call successors, (103), 3 states have call predecessors, (103), 6 states have return successors, (103), 6 states have call predecessors, (103), 7 states have call successors, (103) Word has length 433 [2025-02-06 02:37:02,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:02,597 INFO L225 Difference]: With dead ends: 31277 [2025-02-06 02:37:02,598 INFO L226 Difference]: Without dead ends: 15775 [2025-02-06 02:37:02,616 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 876 GetRequests, 857 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:37:02,617 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 968 mSDsluCounter, 1219 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1019 SdHoareTripleChecker+Valid, 1587 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:02,618 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1019 Valid, 1587 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:37:02,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15775 states. [2025-02-06 02:37:03,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 15747. [2025-02-06 02:37:03,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15747 states, 14471 states have (on average 1.518347038905397) internal successors, (21972), 14511 states have internal predecessors, (21972), 981 states have call successors, (981), 294 states have call predecessors, (981), 294 states have return successors, (981), 941 states have call predecessors, (981), 981 states have call successors, (981) [2025-02-06 02:37:03,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15747 states to 15747 states and 23934 transitions. [2025-02-06 02:37:03,275 INFO L78 Accepts]: Start accepts. Automaton has 15747 states and 23934 transitions. Word has length 433 [2025-02-06 02:37:03,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:03,276 INFO L471 AbstractCegarLoop]: Abstraction has 15747 states and 23934 transitions. [2025-02-06 02:37:03,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 12.1875) internal successors, (195), 17 states have internal predecessors, (195), 7 states have call successors, (103), 3 states have call predecessors, (103), 6 states have return successors, (103), 6 states have call predecessors, (103), 7 states have call successors, (103) [2025-02-06 02:37:03,277 INFO L276 IsEmpty]: Start isEmpty. Operand 15747 states and 23934 transitions. [2025-02-06 02:37:03,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2025-02-06 02:37:03,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:03,297 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:03,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 02:37:03,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-02-06 02:37:03,498 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:03,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:03,499 INFO L85 PathProgramCache]: Analyzing trace with hash 370426525, now seen corresponding path program 1 times [2025-02-06 02:37:03,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:03,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121683646] [2025-02-06 02:37:03,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:03,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:03,532 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-06 02:37:05,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-06 02:37:05,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:05,093 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:13,705 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 159 proven. 195 refuted. 0 times theorem prover too weak. 6966 trivial. 0 not checked. [2025-02-06 02:37:13,706 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:13,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121683646] [2025-02-06 02:37:13,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121683646] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:37:13,706 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [193878362] [2025-02-06 02:37:13,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:13,707 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:37:13,707 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:37:13,709 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:37:13,712 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 02:37:13,942 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 433 statements into 1 equivalence classes. [2025-02-06 02:37:14,100 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 433 of 433 statements. [2025-02-06 02:37:14,100 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:14,100 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:14,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 1101 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-02-06 02:37:14,117 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:37:15,688 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 4598 proven. 210 refuted. 0 times theorem prover too weak. 2512 trivial. 0 not checked. [2025-02-06 02:37:15,688 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:37:17,039 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 225 proven. 132 refuted. 0 times theorem prover too weak. 6963 trivial. 0 not checked. [2025-02-06 02:37:17,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [193878362] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:37:17,039 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:37:17,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 15, 13] total 45 [2025-02-06 02:37:17,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699999886] [2025-02-06 02:37:17,040 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:37:17,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-02-06 02:37:17,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:17,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-02-06 02:37:17,042 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1792, Unknown=0, NotChecked=0, Total=1980 [2025-02-06 02:37:17,043 INFO L87 Difference]: Start difference. First operand 15747 states and 23934 transitions. Second operand has 45 states, 44 states have (on average 7.9772727272727275) internal successors, (351), 44 states have internal predecessors, (351), 11 states have call successors, (152), 4 states have call predecessors, (152), 8 states have return successors, (153), 10 states have call predecessors, (153), 11 states have call successors, (153)