./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-83.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-83.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 e31a340a728b4b13c53c35406dccb6504a466f013456cf371c6079f0f2b7f2d6 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:51:12,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:51:12,745 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 14:51:12,751 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:51:12,751 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:51:12,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:51:12,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:51:12,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:51:12,779 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:51:12,779 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:51:12,779 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:51:12,779 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:51:12,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:51:12,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:51:12,780 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:51:12,780 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:51:12,780 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:51:12,780 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:51:12,780 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:51:12,782 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:51:12,782 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:51:12,782 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:51:12,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:51:12,783 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:51:12,783 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:51:12,783 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:51:12,783 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:51:12,783 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:51:12,783 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:51:12,783 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:51:12,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:51:12,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:51:12,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:51:12,784 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:51:12,784 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:51:12,784 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:51:12,784 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:51:12,784 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:51:12,784 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:51:12,784 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:51:12,784 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:51:12,785 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:51:12,785 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:51:12,785 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:51:12,785 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:51:12,785 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:51:12,785 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:51:12,785 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:51:12,786 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 -> e31a340a728b4b13c53c35406dccb6504a466f013456cf371c6079f0f2b7f2d6 [2025-01-09 14:51:13,067 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:51:13,078 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:51:13,081 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:51:13,082 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:51:13,082 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:51:13,083 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-83.i [2025-01-09 14:51:14,392 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/747827da5/6ba42d14334f4e4a967e199d64d53834/FLAG6b282f9e8 [2025-01-09 14:51:14,767 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:51:14,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-83.i [2025-01-09 14:51:14,793 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/747827da5/6ba42d14334f4e4a967e199d64d53834/FLAG6b282f9e8 [2025-01-09 14:51:14,957 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/747827da5/6ba42d14334f4e4a967e199d64d53834 [2025-01-09 14:51:14,959 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:51:14,960 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:51:14,961 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:51:14,961 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:51:14,965 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:51:14,965 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:51:14" (1/1) ... [2025-01-09 14:51:14,966 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@73fb8bdf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:14, skipping insertion in model container [2025-01-09 14:51:14,967 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:51:14" (1/1) ... [2025-01-09 14:51:15,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:51:15,162 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-83.i[916,929] [2025-01-09 14:51:15,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:51:15,440 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:51:15,451 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-83.i[916,929] [2025-01-09 14:51:15,588 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:51:15,609 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:51:15,611 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15 WrapperNode [2025-01-09 14:51:15,611 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:51:15,612 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:51:15,613 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:51:15,613 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:51:15,618 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:15,642 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:15,771 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 699 [2025-01-09 14:51:15,772 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:51:15,773 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:51:15,773 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:51:15,773 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:51:15,781 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:15,782 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:15,807 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:15,891 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 14:51:15,892 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:15,892 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:15,927 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:15,933 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:15,944 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:15,962 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:15,970 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:15,992 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:51:15,994 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:51:15,994 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:51:15,994 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:51:15,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (1/1) ... [2025-01-09 14:51:16,003 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:51:16,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:16,028 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 14:51:16,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 14:51:16,084 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:51:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:51:16,085 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:51:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:51:16,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:51:16,086 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:51:16,237 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:51:16,239 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:51:17,594 INFO L? ?]: Removed 59 outVars from TransFormulas that were not future-live. [2025-01-09 14:51:17,594 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:51:17,614 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:51:17,618 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:51:17,618 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:51:17 BoogieIcfgContainer [2025-01-09 14:51:17,620 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:51:17,622 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:51:17,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:51:17,626 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:51:17,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:51:14" (1/3) ... [2025-01-09 14:51:17,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237afeec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:51:17, skipping insertion in model container [2025-01-09 14:51:17,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:51:15" (2/3) ... [2025-01-09 14:51:17,629 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@237afeec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:51:17, skipping insertion in model container [2025-01-09 14:51:17,629 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:51:17" (3/3) ... [2025-01-09 14:51:17,631 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-83.i [2025-01-09 14:51:17,645 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:51:17,649 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-83.i that has 2 procedures, 267 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:51:17,715 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:51:17,728 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;@15a3f97a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:51:17,728 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:51:17,734 INFO L276 IsEmpty]: Start isEmpty. Operand has 267 states, 204 states have (on average 1.5637254901960784) internal successors, (319), 205 states have internal predecessors, (319), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 14:51:17,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-01-09 14:51:17,757 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:17,758 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:17,758 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:17,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:17,765 INFO L85 PathProgramCache]: Analyzing trace with hash 180039449, now seen corresponding path program 1 times [2025-01-09 14:51:17,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:17,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897830929] [2025-01-09 14:51:17,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:17,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:17,940 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-09 14:51:18,005 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-09 14:51:18,005 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:18,005 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:18,490 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 118 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-01-09 14:51:18,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:18,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897830929] [2025-01-09 14:51:18,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897830929] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:51:18,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [237030657] [2025-01-09 14:51:18,492 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:18,492 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:51:18,492 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:18,496 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:51:18,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 14:51:18,700 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-09 14:51:18,899 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-09 14:51:18,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:18,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:18,908 INFO L256 TraceCheckSpWp]: Trace formula consists of 1052 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:51:18,930 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:51:18,996 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 118 proven. 0 refuted. 0 times theorem prover too weak. 6962 trivial. 0 not checked. [2025-01-09 14:51:18,997 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:51:18,997 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [237030657] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:18,997 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:51:18,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:51:19,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599623585] [2025-01-09 14:51:19,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:19,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:51:19,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:19,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:51:19,026 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:51:19,028 INFO L87 Difference]: Start difference. First operand has 267 states, 204 states have (on average 1.5637254901960784) internal successors, (319), 205 states have internal predecessors, (319), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) Second operand has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:51:19,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:19,073 INFO L93 Difference]: Finished difference Result 528 states and 933 transitions. [2025-01-09 14:51:19,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:51:19,075 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) Word has length 412 [2025-01-09 14:51:19,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:19,084 INFO L225 Difference]: With dead ends: 528 [2025-01-09 14:51:19,084 INFO L226 Difference]: Without dead ends: 264 [2025-01-09 14:51:19,090 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 413 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-01-09 14:51:19,096 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:19,096 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:51:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 264 states. [2025-01-09 14:51:19,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 264 to 264. [2025-01-09 14:51:19,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 264 states, 202 states have (on average 1.5396039603960396) internal successors, (311), 202 states have internal predecessors, (311), 60 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2025-01-09 14:51:19,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 264 states to 264 states and 431 transitions. [2025-01-09 14:51:19,177 INFO L78 Accepts]: Start accepts. Automaton has 264 states and 431 transitions. Word has length 412 [2025-01-09 14:51:19,178 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:19,179 INFO L471 AbstractCegarLoop]: Abstraction has 264 states and 431 transitions. [2025-01-09 14:51:19,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 58.5) internal successors, (117), 2 states have internal predecessors, (117), 2 states have call successors, (60), 2 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:51:19,179 INFO L276 IsEmpty]: Start isEmpty. Operand 264 states and 431 transitions. [2025-01-09 14:51:19,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-01-09 14:51:19,193 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:19,193 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:19,204 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:51:19,397 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-01-09 14:51:19,398 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:19,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:19,399 INFO L85 PathProgramCache]: Analyzing trace with hash -868080487, now seen corresponding path program 1 times [2025-01-09 14:51:19,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:19,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639061115] [2025-01-09 14:51:19,399 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:19,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:19,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-09 14:51:19,551 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-09 14:51:19,551 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:19,551 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:19,923 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:51:19,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:19,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639061115] [2025-01-09 14:51:19,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639061115] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:19,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:19,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:19,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876521062] [2025-01-09 14:51:19,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:19,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:19,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:19,929 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:19,930 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:19,930 INFO L87 Difference]: Start difference. First operand 264 states and 431 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:20,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:20,049 INFO L93 Difference]: Finished difference Result 743 states and 1210 transitions. [2025-01-09 14:51:20,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:20,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 412 [2025-01-09 14:51:20,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:20,059 INFO L225 Difference]: With dead ends: 743 [2025-01-09 14:51:20,061 INFO L226 Difference]: Without dead ends: 482 [2025-01-09 14:51:20,063 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:20,063 INFO L435 NwaCegarLoop]: 578 mSDtfsCounter, 346 mSDsluCounter, 418 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 996 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:20,064 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 996 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:51:20,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 482 states. [2025-01-09 14:51:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 482 to 479. [2025-01-09 14:51:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 359 states have (on average 1.5153203342618384) internal successors, (544), 360 states have internal predecessors, (544), 117 states have call successors, (117), 2 states have call predecessors, (117), 2 states have return successors, (117), 116 states have call predecessors, (117), 117 states have call successors, (117) [2025-01-09 14:51:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 778 transitions. [2025-01-09 14:51:20,137 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 778 transitions. Word has length 412 [2025-01-09 14:51:20,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:20,141 INFO L471 AbstractCegarLoop]: Abstraction has 479 states and 778 transitions. [2025-01-09 14:51:20,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:20,141 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 778 transitions. [2025-01-09 14:51:20,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-01-09 14:51:20,146 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:20,146 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:20,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:51:20,148 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:20,148 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:20,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1498614107, now seen corresponding path program 1 times [2025-01-09 14:51:20,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:20,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654913670] [2025-01-09 14:51:20,150 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:20,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:20,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-09 14:51:20,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-09 14:51:20,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:20,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:20,648 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:51:20,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:20,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654913670] [2025-01-09 14:51:20,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654913670] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:20,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:20,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:20,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941518299] [2025-01-09 14:51:20,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:20,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:20,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:20,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:20,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:20,653 INFO L87 Difference]: Start difference. First operand 479 states and 778 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:20,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:20,837 INFO L93 Difference]: Finished difference Result 1427 states and 2320 transitions. [2025-01-09 14:51:20,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:20,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 412 [2025-01-09 14:51:20,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:20,850 INFO L225 Difference]: With dead ends: 1427 [2025-01-09 14:51:20,853 INFO L226 Difference]: Without dead ends: 951 [2025-01-09 14:51:20,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:20,856 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 388 mSDsluCounter, 410 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 1032 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:20,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 1032 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:51:20,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2025-01-09 14:51:20,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 948. [2025-01-09 14:51:20,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 709 states have (on average 1.5021156558533146) internal successors, (1065), 711 states have internal predecessors, (1065), 234 states have call successors, (234), 4 states have call predecessors, (234), 4 states have return successors, (234), 232 states have call predecessors, (234), 234 states have call successors, (234) [2025-01-09 14:51:20,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1533 transitions. [2025-01-09 14:51:20,978 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1533 transitions. Word has length 412 [2025-01-09 14:51:20,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:20,981 INFO L471 AbstractCegarLoop]: Abstraction has 948 states and 1533 transitions. [2025-01-09 14:51:20,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:20,982 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1533 transitions. [2025-01-09 14:51:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-01-09 14:51:20,985 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:20,985 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:20,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:51:20,986 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:20,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash 430953039, now seen corresponding path program 1 times [2025-01-09 14:51:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:20,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072727392] [2025-01-09 14:51:20,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:20,987 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:21,041 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-09 14:51:21,239 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-09 14:51:21,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:21,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:21,862 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:51:21,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:21,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072727392] [2025-01-09 14:51:21,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072727392] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:21,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:21,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:51:21,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343833699] [2025-01-09 14:51:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:21,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:51:21,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:21,864 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:51:21,864 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:51:21,864 INFO L87 Difference]: Start difference. First operand 948 states and 1533 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:51:22,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:22,452 INFO L93 Difference]: Finished difference Result 2530 states and 4097 transitions. [2025-01-09 14:51:22,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:51:22,454 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) Word has length 412 [2025-01-09 14:51:22,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:22,468 INFO L225 Difference]: With dead ends: 2530 [2025-01-09 14:51:22,469 INFO L226 Difference]: Without dead ends: 1585 [2025-01-09 14:51:22,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:51:22,475 INFO L435 NwaCegarLoop]: 427 mSDtfsCounter, 468 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 2080 SdHoareTripleChecker+Invalid, 280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:22,476 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [468 Valid, 2080 Invalid, 280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:51:22,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-01-09 14:51:22,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1083. [2025-01-09 14:51:22,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 783 states have (on average 1.4891443167305236) internal successors, (1166), 785 states have internal predecessors, (1166), 294 states have call successors, (294), 5 states have call predecessors, (294), 5 states have return successors, (294), 292 states have call predecessors, (294), 294 states have call successors, (294) [2025-01-09 14:51:22,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1754 transitions. [2025-01-09 14:51:22,682 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1754 transitions. Word has length 412 [2025-01-09 14:51:22,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:22,683 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1754 transitions. [2025-01-09 14:51:22,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 6 states have internal predecessors, (115), 2 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 2 states have call predecessors, (60), 2 states have call successors, (60) [2025-01-09 14:51:22,683 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1754 transitions. [2025-01-09 14:51:22,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 413 [2025-01-09 14:51:22,688 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:22,688 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:22,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:51:22,689 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:22,689 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:22,690 INFO L85 PathProgramCache]: Analyzing trace with hash 1691870289, now seen corresponding path program 1 times [2025-01-09 14:51:22,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:22,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122501838] [2025-01-09 14:51:22,690 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:22,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:22,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 412 statements into 1 equivalence classes. [2025-01-09 14:51:22,844 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 412 of 412 statements. [2025-01-09 14:51:22,844 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:22,844 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:23,410 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:51:23,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:23,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122501838] [2025-01-09 14:51:23,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1122501838] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:23,411 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:23,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:51:23,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630197122] [2025-01-09 14:51:23,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:23,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:51:23,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:23,412 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:51:23,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:51:23,413 INFO L87 Difference]: Start difference. First operand 1083 states and 1754 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:23,802 INFO L93 Difference]: Finished difference Result 2554 states and 4137 transitions. [2025-01-09 14:51:23,803 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:51:23,803 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 412 [2025-01-09 14:51:23,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:23,816 INFO L225 Difference]: With dead ends: 2554 [2025-01-09 14:51:23,817 INFO L226 Difference]: Without dead ends: 1585 [2025-01-09 14:51:23,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:23,823 INFO L435 NwaCegarLoop]: 428 mSDtfsCounter, 462 mSDsluCounter, 842 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 462 SdHoareTripleChecker+Valid, 1270 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:23,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [462 Valid, 1270 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:51:23,827 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1585 states. [2025-01-09 14:51:23,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1585 to 1083. [2025-01-09 14:51:23,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1083 states, 783 states have (on average 1.48786717752235) internal successors, (1165), 785 states have internal predecessors, (1165), 294 states have call successors, (294), 5 states have call predecessors, (294), 5 states have return successors, (294), 292 states have call predecessors, (294), 294 states have call successors, (294) [2025-01-09 14:51:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1083 states to 1083 states and 1753 transitions. [2025-01-09 14:51:23,945 INFO L78 Accepts]: Start accepts. Automaton has 1083 states and 1753 transitions. Word has length 412 [2025-01-09 14:51:23,945 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:23,946 INFO L471 AbstractCegarLoop]: Abstraction has 1083 states and 1753 transitions. [2025-01-09 14:51:23,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 4 states have internal predecessors, (115), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:23,946 INFO L276 IsEmpty]: Start isEmpty. Operand 1083 states and 1753 transitions. [2025-01-09 14:51:23,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-01-09 14:51:23,949 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:23,950 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:23,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:51:23,950 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:23,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:23,951 INFO L85 PathProgramCache]: Analyzing trace with hash -270553031, now seen corresponding path program 1 times [2025-01-09 14:51:23,951 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:23,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [64865778] [2025-01-09 14:51:23,951 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:23,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:23,990 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-01-09 14:51:24,105 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-01-09 14:51:24,105 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:24,105 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:24,735 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:51:24,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:24,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [64865778] [2025-01-09 14:51:24,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [64865778] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:24,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:24,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:24,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [183577642] [2025-01-09 14:51:24,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:24,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:24,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:24,739 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:24,739 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:24,739 INFO L87 Difference]: Start difference. First operand 1083 states and 1753 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:24,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:24,892 INFO L93 Difference]: Finished difference Result 2513 states and 4072 transitions. [2025-01-09 14:51:24,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:24,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 413 [2025-01-09 14:51:24,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:24,906 INFO L225 Difference]: With dead ends: 2513 [2025-01-09 14:51:24,906 INFO L226 Difference]: Without dead ends: 1562 [2025-01-09 14:51:24,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:24,910 INFO L435 NwaCegarLoop]: 422 mSDtfsCounter, 309 mSDsluCounter, 412 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 309 SdHoareTripleChecker+Valid, 834 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:24,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [309 Valid, 834 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:51:24,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2025-01-09 14:51:25,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1559. [2025-01-09 14:51:25,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1559 states, 1140 states have (on average 1.4885964912280703) internal successors, (1697), 1143 states have internal predecessors, (1697), 411 states have call successors, (411), 7 states have call predecessors, (411), 7 states have return successors, (411), 408 states have call predecessors, (411), 411 states have call successors, (411) [2025-01-09 14:51:25,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1559 states to 1559 states and 2519 transitions. [2025-01-09 14:51:25,046 INFO L78 Accepts]: Start accepts. Automaton has 1559 states and 2519 transitions. Word has length 413 [2025-01-09 14:51:25,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:25,047 INFO L471 AbstractCegarLoop]: Abstraction has 1559 states and 2519 transitions. [2025-01-09 14:51:25,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1559 states and 2519 transitions. [2025-01-09 14:51:25,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 414 [2025-01-09 14:51:25,051 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:25,052 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:25,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 14:51:25,052 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:25,052 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:25,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2135911813, now seen corresponding path program 1 times [2025-01-09 14:51:25,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:25,053 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216567905] [2025-01-09 14:51:25,053 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:25,053 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:25,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 413 statements into 1 equivalence classes. [2025-01-09 14:51:25,146 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 413 of 413 statements. [2025-01-09 14:51:25,146 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:25,147 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:25,536 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:51:25,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:25,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216567905] [2025-01-09 14:51:25,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216567905] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:25,537 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:25,537 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:51:25,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905713925] [2025-01-09 14:51:25,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:25,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:51:25,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:25,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:51:25,538 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:25,539 INFO L87 Difference]: Start difference. First operand 1559 states and 2519 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:25,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:25,684 INFO L93 Difference]: Finished difference Result 4387 states and 7089 transitions. [2025-01-09 14:51:25,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:51:25,685 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 413 [2025-01-09 14:51:25,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:25,704 INFO L225 Difference]: With dead ends: 4387 [2025-01-09 14:51:25,704 INFO L226 Difference]: Without dead ends: 2973 [2025-01-09 14:51:25,710 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:51:25,711 INFO L435 NwaCegarLoop]: 501 mSDtfsCounter, 269 mSDsluCounter, 421 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:25,711 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 922 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:51:25,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2973 states. [2025-01-09 14:51:25,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2973 to 2965. [2025-01-09 14:51:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2965 states, 2189 states have (on average 1.4897213339424396) internal successors, (3261), 2195 states have internal predecessors, (3261), 762 states have call successors, (762), 13 states have call predecessors, (762), 13 states have return successors, (762), 756 states have call predecessors, (762), 762 states have call successors, (762) [2025-01-09 14:51:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2965 states to 2965 states and 4785 transitions. [2025-01-09 14:51:26,000 INFO L78 Accepts]: Start accepts. Automaton has 2965 states and 4785 transitions. Word has length 413 [2025-01-09 14:51:26,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:26,001 INFO L471 AbstractCegarLoop]: Abstraction has 2965 states and 4785 transitions. [2025-01-09 14:51:26,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:26,001 INFO L276 IsEmpty]: Start isEmpty. Operand 2965 states and 4785 transitions. [2025-01-09 14:51:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 14:51:26,008 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:26,009 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:26,009 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 14:51:26,009 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:26,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:26,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1243429763, now seen corresponding path program 1 times [2025-01-09 14:51:26,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:26,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852894134] [2025-01-09 14:51:26,010 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:26,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:26,060 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:51:26,275 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:51:26,275 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:26,275 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:28,461 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:51:28,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:28,465 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852894134] [2025-01-09 14:51:28,465 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852894134] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:28,465 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:28,465 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:51:28,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007900441] [2025-01-09 14:51:28,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:28,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:51:28,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:28,466 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:51:28,466 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:51:28,467 INFO L87 Difference]: Start difference. First operand 2965 states and 4785 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:30,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:30,421 INFO L93 Difference]: Finished difference Result 8282 states and 13243 transitions. [2025-01-09 14:51:30,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:51:30,422 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 414 [2025-01-09 14:51:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:30,477 INFO L225 Difference]: With dead ends: 8282 [2025-01-09 14:51:30,477 INFO L226 Difference]: Without dead ends: 6868 [2025-01-09 14:51:30,487 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 14:51:30,488 INFO L435 NwaCegarLoop]: 793 mSDtfsCounter, 1467 mSDsluCounter, 1624 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 210 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1467 SdHoareTripleChecker+Valid, 2417 SdHoareTripleChecker+Invalid, 768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 210 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:30,488 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1467 Valid, 2417 Invalid, 768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [210 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 14:51:30,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6868 states. [2025-01-09 14:51:30,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6868 to 6395. [2025-01-09 14:51:30,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6395 states, 4904 states have (on average 1.4981647634584012) internal successors, (7347), 4928 states have internal predecessors, (7347), 1452 states have call successors, (1452), 38 states have call predecessors, (1452), 38 states have return successors, (1452), 1428 states have call predecessors, (1452), 1452 states have call successors, (1452) [2025-01-09 14:51:30,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6395 states to 6395 states and 10251 transitions. [2025-01-09 14:51:31,007 INFO L78 Accepts]: Start accepts. Automaton has 6395 states and 10251 transitions. Word has length 414 [2025-01-09 14:51:31,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:31,009 INFO L471 AbstractCegarLoop]: Abstraction has 6395 states and 10251 transitions. [2025-01-09 14:51:31,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 6 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:31,010 INFO L276 IsEmpty]: Start isEmpty. Operand 6395 states and 10251 transitions. [2025-01-09 14:51:31,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 14:51:31,024 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:31,024 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:31,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 14:51:31,025 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:31,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:31,025 INFO L85 PathProgramCache]: Analyzing trace with hash 1463189631, now seen corresponding path program 1 times [2025-01-09 14:51:31,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:31,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401713363] [2025-01-09 14:51:31,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:31,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:31,061 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:51:31,581 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:51:31,581 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:31,581 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:32,477 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:51:32,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:32,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401713363] [2025-01-09 14:51:32,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [401713363] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:51:32,478 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:51:32,478 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:51:32,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1700101805] [2025-01-09 14:51:32,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:51:32,479 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:51:32,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:32,479 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:51:32,479 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:51:32,480 INFO L87 Difference]: Start difference. First operand 6395 states and 10251 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:34,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:34,801 INFO L93 Difference]: Finished difference Result 18010 states and 28483 transitions. [2025-01-09 14:51:34,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:51:34,805 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 414 [2025-01-09 14:51:34,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:34,903 INFO L225 Difference]: With dead ends: 18010 [2025-01-09 14:51:34,903 INFO L226 Difference]: Without dead ends: 14856 [2025-01-09 14:51:34,918 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:51:34,919 INFO L435 NwaCegarLoop]: 520 mSDtfsCounter, 650 mSDsluCounter, 1028 mSDsCounter, 0 mSdLazyCounter, 304 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1548 SdHoareTripleChecker+Invalid, 747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 304 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:34,919 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1548 Invalid, 747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 304 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 14:51:34,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14856 states. [2025-01-09 14:51:35,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14856 to 11049. [2025-01-09 14:51:35,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11049 states, 8183 states have (on average 1.4676768911157276) internal successors, (12010), 8237 states have internal predecessors, (12010), 2790 states have call successors, (2790), 75 states have call predecessors, (2790), 75 states have return successors, (2790), 2736 states have call predecessors, (2790), 2790 states have call successors, (2790) [2025-01-09 14:51:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11049 states to 11049 states and 17590 transitions. [2025-01-09 14:51:36,130 INFO L78 Accepts]: Start accepts. Automaton has 11049 states and 17590 transitions. Word has length 414 [2025-01-09 14:51:36,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:36,131 INFO L471 AbstractCegarLoop]: Abstraction has 11049 states and 17590 transitions. [2025-01-09 14:51:36,132 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:51:36,132 INFO L276 IsEmpty]: Start isEmpty. Operand 11049 states and 17590 transitions. [2025-01-09 14:51:36,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 14:51:36,149 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:36,150 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:36,150 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 14:51:36,150 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:36,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:36,151 INFO L85 PathProgramCache]: Analyzing trace with hash 183325953, now seen corresponding path program 1 times [2025-01-09 14:51:36,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:36,151 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [265052932] [2025-01-09 14:51:36,151 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:36,151 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:36,187 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:51:37,347 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:51:37,347 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:37,347 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:38,008 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:51:38,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:38,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [265052932] [2025-01-09 14:51:38,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [265052932] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:51:38,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [269056870] [2025-01-09 14:51:38,009 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:38,009 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:51:38,009 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:38,014 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:51:38,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 14:51:38,225 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:51:38,402 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:51:38,402 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:38,403 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:38,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-01-09 14:51:38,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:51:39,774 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3047 proven. 123 refuted. 0 times theorem prover too weak. 3910 trivial. 0 not checked. [2025-01-09 14:51:39,775 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:51:40,436 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 54 proven. 123 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:51:40,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [269056870] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:51:40,437 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:51:40,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 23 [2025-01-09 14:51:40,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181551222] [2025-01-09 14:51:40,437 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:51:40,439 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2025-01-09 14:51:40,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:40,440 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2025-01-09 14:51:40,440 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=418, Unknown=0, NotChecked=0, Total=506 [2025-01-09 14:51:40,441 INFO L87 Difference]: Start difference. First operand 11049 states and 17590 transitions. Second operand has 23 states, 23 states have (on average 14.26086956521739) internal successors, (328), 23 states have internal predecessors, (328), 7 states have call successors, (180), 3 states have call predecessors, (180), 6 states have return successors, (180), 6 states have call predecessors, (180), 7 states have call successors, (180) [2025-01-09 14:51:47,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:51:47,588 INFO L93 Difference]: Finished difference Result 65151 states and 101460 transitions. [2025-01-09 14:51:47,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2025-01-09 14:51:47,590 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 14.26086956521739) internal successors, (328), 23 states have internal predecessors, (328), 7 states have call successors, (180), 3 states have call predecessors, (180), 6 states have return successors, (180), 6 states have call predecessors, (180), 7 states have call successors, (180) Word has length 414 [2025-01-09 14:51:47,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:51:47,874 INFO L225 Difference]: With dead ends: 65151 [2025-01-09 14:51:47,875 INFO L226 Difference]: Without dead ends: 54261 [2025-01-09 14:51:47,931 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 878 GetRequests, 819 SyntacticMatches, 0 SemanticMatches, 59 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 952 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=742, Invalid=2918, Unknown=0, NotChecked=0, Total=3660 [2025-01-09 14:51:47,932 INFO L435 NwaCegarLoop]: 595 mSDtfsCounter, 4721 mSDsluCounter, 4629 mSDsCounter, 0 mSdLazyCounter, 3428 mSolverCounterSat, 1090 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4723 SdHoareTripleChecker+Valid, 5224 SdHoareTripleChecker+Invalid, 4518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1090 IncrementalHoareTripleChecker+Valid, 3428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:51:47,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4723 Valid, 5224 Invalid, 4518 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1090 Valid, 3428 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2025-01-09 14:51:47,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54261 states. [2025-01-09 14:51:51,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54261 to 34306. [2025-01-09 14:51:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34306 states, 27196 states have (on average 1.4644433004853654) internal successors, (39827), 27364 states have internal predecessors, (39827), 6600 states have call successors, (6600), 509 states have call predecessors, (6600), 509 states have return successors, (6600), 6432 states have call predecessors, (6600), 6600 states have call successors, (6600) [2025-01-09 14:51:51,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34306 states to 34306 states and 53027 transitions. [2025-01-09 14:51:52,030 INFO L78 Accepts]: Start accepts. Automaton has 34306 states and 53027 transitions. Word has length 414 [2025-01-09 14:51:52,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:51:52,031 INFO L471 AbstractCegarLoop]: Abstraction has 34306 states and 53027 transitions. [2025-01-09 14:51:52,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 14.26086956521739) internal successors, (328), 23 states have internal predecessors, (328), 7 states have call successors, (180), 3 states have call predecessors, (180), 6 states have return successors, (180), 6 states have call predecessors, (180), 7 states have call successors, (180) [2025-01-09 14:51:52,032 INFO L276 IsEmpty]: Start isEmpty. Operand 34306 states and 53027 transitions. [2025-01-09 14:51:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 415 [2025-01-09 14:51:52,056 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:51:52,057 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:51:52,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:51:52,257 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-01-09 14:51:52,258 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:51:52,259 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:51:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1203459457, now seen corresponding path program 1 times [2025-01-09 14:51:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:51:52,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056922242] [2025-01-09 14:51:52,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:52,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:51:52,295 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:51:53,189 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:51:53,190 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:53,190 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:55,553 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:51:55,553 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:51:55,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056922242] [2025-01-09 14:51:55,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056922242] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:51:55,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2055839004] [2025-01-09 14:51:55,554 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:51:55,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:51:55,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:51:55,556 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:51:55,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 14:51:55,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 414 statements into 1 equivalence classes. [2025-01-09 14:51:55,854 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 414 of 414 statements. [2025-01-09 14:51:55,854 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:51:55,854 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:51:55,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 1053 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 14:51:55,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:51:56,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 4859 proven. 249 refuted. 0 times theorem prover too weak. 1972 trivial. 0 not checked. [2025-01-09 14:51:56,811 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:51:57,396 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 264 proven. 258 refuted. 0 times theorem prover too weak. 6558 trivial. 0 not checked. [2025-01-09 14:51:57,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2055839004] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:51:57,396 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:51:57,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 11] total 28 [2025-01-09 14:51:57,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212118034] [2025-01-09 14:51:57,397 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:51:57,398 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-01-09 14:51:57,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:51:57,399 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-01-09 14:51:57,400 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=624, Unknown=0, NotChecked=0, Total=756 [2025-01-09 14:51:57,400 INFO L87 Difference]: Start difference. First operand 34306 states and 53027 transitions. Second operand has 28 states, 28 states have (on average 8.964285714285714) internal successors, (251), 28 states have internal predecessors, (251), 8 states have call successors, (160), 4 states have call predecessors, (160), 10 states have return successors, (162), 8 states have call predecessors, (162), 8 states have call successors, (162) [2025-01-09 14:52:02,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:02,440 INFO L93 Difference]: Finished difference Result 80590 states and 123247 transitions. [2025-01-09 14:52:02,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-01-09 14:52:02,441 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 28 states have (on average 8.964285714285714) internal successors, (251), 28 states have internal predecessors, (251), 8 states have call successors, (160), 4 states have call predecessors, (160), 10 states have return successors, (162), 8 states have call predecessors, (162), 8 states have call successors, (162) Word has length 414 [2025-01-09 14:52:02,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:02,619 INFO L225 Difference]: With dead ends: 80590 [2025-01-09 14:52:02,619 INFO L226 Difference]: Without dead ends: 46324 [2025-01-09 14:52:02,699 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 889 GetRequests, 822 SyntacticMatches, 1 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1145 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1044, Invalid=3512, Unknown=0, NotChecked=0, Total=4556 [2025-01-09 14:52:02,700 INFO L435 NwaCegarLoop]: 418 mSDtfsCounter, 4143 mSDsluCounter, 2550 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4144 SdHoareTripleChecker+Valid, 2968 SdHoareTripleChecker+Invalid, 2688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:02,700 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4144 Valid, 2968 Invalid, 2688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 2371 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2025-01-09 14:52:02,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46324 states. [2025-01-09 14:52:04,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46324 to 33208. [2025-01-09 14:52:04,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33208 states, 28349 states have (on average 1.4746551906592824) internal successors, (41805), 28433 states have internal predecessors, (41805), 4176 states have call successors, (4176), 682 states have call predecessors, (4176), 682 states have return successors, (4176), 4092 states have call predecessors, (4176), 4176 states have call successors, (4176) [2025-01-09 14:52:04,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33208 states to 33208 states and 50157 transitions. [2025-01-09 14:52:04,896 INFO L78 Accepts]: Start accepts. Automaton has 33208 states and 50157 transitions. Word has length 414 [2025-01-09 14:52:04,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:04,897 INFO L471 AbstractCegarLoop]: Abstraction has 33208 states and 50157 transitions. [2025-01-09 14:52:04,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 8.964285714285714) internal successors, (251), 28 states have internal predecessors, (251), 8 states have call successors, (160), 4 states have call predecessors, (160), 10 states have return successors, (162), 8 states have call predecessors, (162), 8 states have call successors, (162) [2025-01-09 14:52:04,898 INFO L276 IsEmpty]: Start isEmpty. Operand 33208 states and 50157 transitions. [2025-01-09 14:52:04,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-01-09 14:52:04,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:04,926 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:04,937 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-01-09 14:52:05,126 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:05,127 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:05,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:05,128 INFO L85 PathProgramCache]: Analyzing trace with hash 1151427230, now seen corresponding path program 1 times [2025-01-09 14:52:05,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:05,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823315802] [2025-01-09 14:52:05,129 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:05,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:05,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-01-09 14:52:05,236 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-01-09 14:52:05,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:05,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:06,201 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7080 trivial. 0 not checked. [2025-01-09 14:52:06,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:06,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823315802] [2025-01-09 14:52:06,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823315802] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:52:06,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:52:06,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-01-09 14:52:06,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664261897] [2025-01-09 14:52:06,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:52:06,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-01-09 14:52:06,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:06,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-01-09 14:52:06,203 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-01-09 14:52:06,203 INFO L87 Difference]: Start difference. First operand 33208 states and 50157 transitions. Second operand has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:52:10,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:52:10,589 INFO L93 Difference]: Finished difference Result 79691 states and 120626 transitions. [2025-01-09 14:52:10,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 14:52:10,589 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) Word has length 415 [2025-01-09 14:52:10,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:52:10,829 INFO L225 Difference]: With dead ends: 79691 [2025-01-09 14:52:10,829 INFO L226 Difference]: Without dead ends: 62748 [2025-01-09 14:52:10,887 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 14:52:10,888 INFO L435 NwaCegarLoop]: 885 mSDtfsCounter, 1597 mSDsluCounter, 1779 mSDsCounter, 0 mSdLazyCounter, 620 mSolverCounterSat, 378 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1597 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 378 IncrementalHoareTripleChecker+Valid, 620 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:52:10,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1597 Valid, 2664 Invalid, 998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [378 Valid, 620 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-01-09 14:52:10,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62748 states. [2025-01-09 14:52:13,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62748 to 35998. [2025-01-09 14:52:13,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35998 states, 31139 states have (on average 1.4868492886733677) internal successors, (46299), 31223 states have internal predecessors, (46299), 4176 states have call successors, (4176), 682 states have call predecessors, (4176), 682 states have return successors, (4176), 4092 states have call predecessors, (4176), 4176 states have call successors, (4176) [2025-01-09 14:52:13,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35998 states to 35998 states and 54651 transitions. [2025-01-09 14:52:13,287 INFO L78 Accepts]: Start accepts. Automaton has 35998 states and 54651 transitions. Word has length 415 [2025-01-09 14:52:13,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:52:13,288 INFO L471 AbstractCegarLoop]: Abstraction has 35998 states and 54651 transitions. [2025-01-09 14:52:13,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.666666666666668) internal successors, (118), 6 states have internal predecessors, (118), 1 states have call successors, (60), 1 states have call predecessors, (60), 1 states have return successors, (60), 1 states have call predecessors, (60), 1 states have call successors, (60) [2025-01-09 14:52:13,289 INFO L276 IsEmpty]: Start isEmpty. Operand 35998 states and 54651 transitions. [2025-01-09 14:52:13,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 416 [2025-01-09 14:52:13,314 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:52:13,314 INFO L218 NwaCegarLoop]: trace histogram [60, 60, 60, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 14:52:13,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 14:52:13,315 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:52:13,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:52:13,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1716784350, now seen corresponding path program 1 times [2025-01-09 14:52:13,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:52:13,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858032958] [2025-01-09 14:52:13,316 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:13,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:52:13,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-01-09 14:52:13,989 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-01-09 14:52:13,989 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:13,989 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:14,663 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 0 proven. 177 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:52:14,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:52:14,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858032958] [2025-01-09 14:52:14,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858032958] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:52:14,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1430553042] [2025-01-09 14:52:14,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:52:14,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:52:14,665 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:52:14,667 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:52:14,669 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 14:52:14,860 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 415 statements into 1 equivalence classes. [2025-01-09 14:52:15,020 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 415 of 415 statements. [2025-01-09 14:52:15,020 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:52:15,020 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:52:15,030 INFO L256 TraceCheckSpWp]: Trace formula consists of 1054 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:52:15,043 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:52:15,734 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 3039 proven. 171 refuted. 0 times theorem prover too weak. 3870 trivial. 0 not checked. [2025-01-09 14:52:15,734 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:52:16,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7080 backedges. 6 proven. 171 refuted. 0 times theorem prover too weak. 6903 trivial. 0 not checked. [2025-01-09 14:52:16,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1430553042] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:52:16,084 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:52:16,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 6, 6] total 16 [2025-01-09 14:52:16,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632736191] [2025-01-09 14:52:16,084 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:52:16,085 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:52:16,085 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:52:16,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:52:16,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:52:16,087 INFO L87 Difference]: Start difference. First operand 35998 states and 54651 transitions. Second operand has 16 states, 16 states have (on average 14.5) internal successors, (232), 16 states have internal predecessors, (232), 7 states have call successors, (176), 3 states have call predecessors, (176), 5 states have return successors, (178), 7 states have call predecessors, (178), 7 states have call successors, (178)