./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-86.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_amount250_file-86.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 e696ddcc55bba12fd312675629badb4dfe4eee6844d87ecc0509451d1004be73 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:29:14,514 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:29:14,547 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:29:14,550 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:29:14,550 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:29:14,564 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:29:14,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:29:14,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:29:14,564 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:29:14,564 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:29:14,564 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:29:14,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:29:14,565 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:29:14,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:29:14,565 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:29:14,565 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:29:14,565 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:29:14,565 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:29:14,565 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:29:14,565 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:29:14,566 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:29:14,566 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:29:14,566 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:29:14,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:29:14,566 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:29:14,566 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:29:14,566 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:29:14,566 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:29:14,566 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:29:14,566 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:29:14,566 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:29:14,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:29:14,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:29:14,567 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:29:14,567 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:29:14,567 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:29:14,567 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:29:14,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:29:14,567 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:29:14,567 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:29:14,567 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:29:14,567 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:29:14,567 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:29:14,567 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:29:14,568 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:29:14,568 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:29:14,568 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:29:14,568 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:29:14,568 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 -> e696ddcc55bba12fd312675629badb4dfe4eee6844d87ecc0509451d1004be73 [2025-01-09 14:29:14,745 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:29:14,750 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:29:14,753 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:29:14,754 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:29:14,754 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:29:14,755 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-86.i [2025-01-09 14:29:15,889 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d042cd5d/1a39f13047924bc3b8556de04851ec15/FLAGa20b9983c [2025-01-09 14:29:16,283 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:29:16,284 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-86.i [2025-01-09 14:29:16,294 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d042cd5d/1a39f13047924bc3b8556de04851ec15/FLAGa20b9983c [2025-01-09 14:29:16,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/0d042cd5d/1a39f13047924bc3b8556de04851ec15 [2025-01-09 14:29:16,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:29:16,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:29:16,484 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:29:16,484 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:29:16,488 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:29:16,488 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,489 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f13129e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16, skipping insertion in model container [2025-01-09 14:29:16,489 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,509 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:29:16,614 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_amount250_file-86.i[916,929] [2025-01-09 14:29:16,730 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:29:16,739 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:29:16,746 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_amount250_file-86.i[916,929] [2025-01-09 14:29:16,810 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:29:16,820 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:29:16,821 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16 WrapperNode [2025-01-09 14:29:16,821 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:29:16,822 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:29:16,822 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:29:16,822 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:29:16,826 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:29:16" (1/1) ... [2025-01-09 14:29:16,840 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:29:16" (1/1) ... [2025-01-09 14:29:16,876 INFO L138 Inliner]: procedures = 26, calls = 81, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 453 [2025-01-09 14:29:16,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:29:16,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:29:16,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:29:16,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:29:16,883 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,883 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,907 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:29:16,907 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,907 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,918 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,919 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,922 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,924 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,926 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,930 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:29:16,934 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:29:16,934 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:29:16,934 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:29:16,935 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16" (1/1) ... [2025-01-09 14:29:16,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:29:16,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:16,960 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:29:16,962 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:29:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:29:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:29:16,976 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:29:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:29:16,976 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:29:16,976 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:29:17,067 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:29:17,068 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:29:17,704 INFO L? ?]: Removed 48 outVars from TransFormulas that were not future-live. [2025-01-09 14:29:17,704 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:29:17,715 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:29:17,717 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:29:17,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:29:17 BoogieIcfgContainer [2025-01-09 14:29:17,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:29:17,719 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:29:17,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:29:17,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:29:17,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:29:16" (1/3) ... [2025-01-09 14:29:17,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b51ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:29:17, skipping insertion in model container [2025-01-09 14:29:17,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:29:16" (2/3) ... [2025-01-09 14:29:17,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21b51ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:29:17, skipping insertion in model container [2025-01-09 14:29:17,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:29:17" (3/3) ... [2025-01-09 14:29:17,725 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-86.i [2025-01-09 14:29:17,734 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:29:17,737 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-86.i that has 2 procedures, 195 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:29:17,780 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:29:17,789 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;@4bd28df3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:29:17,789 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:29:17,794 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 125 states have internal predecessors, (176), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 14:29:17,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:29:17,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:17,811 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:17,811 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:17,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:17,815 INFO L85 PathProgramCache]: Analyzing trace with hash -642061017, now seen corresponding path program 1 times [2025-01-09 14:29:17,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:17,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1014138898] [2025-01-09 14:29:17,822 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:17,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:17,959 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:29:17,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:29:17,996 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:17,996 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:18,284 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 134 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2025-01-09 14:29:18,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:18,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1014138898] [2025-01-09 14:29:18,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1014138898] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:18,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [846975855] [2025-01-09 14:29:18,286 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:18,286 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:18,286 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:18,290 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:29:18,292 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:29:18,408 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:29:18,545 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:29:18,545 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:18,545 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:18,549 INFO L256 TraceCheckSpWp]: Trace formula consists of 954 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:29:18,563 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:18,593 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 134 proven. 0 refuted. 0 times theorem prover too weak. 8978 trivial. 0 not checked. [2025-01-09 14:29:18,593 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:29:18,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [846975855] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:18,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:29:18,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:29:18,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630797974] [2025-01-09 14:29:18,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:18,601 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:29:18,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:18,619 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:29:18,619 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:29:18,622 INFO L87 Difference]: Start difference. First operand has 195 states, 124 states have (on average 1.4193548387096775) internal successors, (176), 125 states have internal predecessors, (176), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) Second operand has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2025-01-09 14:29:18,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:18,656 INFO L93 Difference]: Finished difference Result 384 states and 687 transitions. [2025-01-09 14:29:18,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:29:18,657 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) Word has length 430 [2025-01-09 14:29:18,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:18,662 INFO L225 Difference]: With dead ends: 384 [2025-01-09 14:29:18,662 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 14:29:18,665 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 431 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:29:18,666 INFO L435 NwaCegarLoop]: 307 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, 307 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:29:18,667 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:29:18,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 14:29:18,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-01-09 14:29:18,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 122 states have (on average 1.401639344262295) internal successors, (171), 122 states have internal predecessors, (171), 68 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 68 states have call predecessors, (68), 68 states have call successors, (68) [2025-01-09 14:29:18,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 307 transitions. [2025-01-09 14:29:18,716 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 307 transitions. Word has length 430 [2025-01-09 14:29:18,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:18,717 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 307 transitions. [2025-01-09 14:29:18,717 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 47.5) internal successors, (95), 2 states have internal predecessors, (95), 2 states have call successors, (68), 2 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 2 states have call successors, (68) [2025-01-09 14:29:18,717 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 307 transitions. [2025-01-09 14:29:18,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:29:18,722 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:18,722 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:18,734 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 14:29:18,923 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:29:18,923 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:18,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:18,924 INFO L85 PathProgramCache]: Analyzing trace with hash 779249839, now seen corresponding path program 1 times [2025-01-09 14:29:18,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:18,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871025639] [2025-01-09 14:29:18,924 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:18,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:18,962 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:29:19,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:29:19,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:19,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-01-09 14:29:19,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:19,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871025639] [2025-01-09 14:29:19,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871025639] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:19,305 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:19,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:29:19,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936937743] [2025-01-09 14:29:19,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:19,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:29:19,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:19,309 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:29:19,310 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:29:19,310 INFO L87 Difference]: Start difference. First operand 192 states and 307 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-01-09 14:29:19,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:19,394 INFO L93 Difference]: Finished difference Result 485 states and 776 transitions. [2025-01-09 14:29:19,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:29:19,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 430 [2025-01-09 14:29:19,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:19,400 INFO L225 Difference]: With dead ends: 485 [2025-01-09 14:29:19,401 INFO L226 Difference]: Without dead ends: 296 [2025-01-09 14:29:19,402 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:29:19,403 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 162 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:19,404 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [162 Valid, 662 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:29:19,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 296 states. [2025-01-09 14:29:19,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 296 to 293. [2025-01-09 14:29:19,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 197 states have (on average 1.4365482233502538) internal successors, (283), 198 states have internal predecessors, (283), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 14:29:19,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 469 transitions. [2025-01-09 14:29:19,445 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 469 transitions. Word has length 430 [2025-01-09 14:29:19,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:19,446 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 469 transitions. [2025-01-09 14:29:19,447 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-01-09 14:29:19,447 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 469 transitions. [2025-01-09 14:29:19,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:29:19,452 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:19,452 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:19,452 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:29:19,452 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:19,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:19,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1870379057, now seen corresponding path program 1 times [2025-01-09 14:29:19,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:19,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915589790] [2025-01-09 14:29:19,453 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:19,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:19,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:29:19,540 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:29:19,540 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:19,540 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:19,781 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-01-09 14:29:19,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:19,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915589790] [2025-01-09 14:29:19,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [915589790] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:19,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:19,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:29:19,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1125482749] [2025-01-09 14:29:19,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:19,782 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:29:19,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:19,783 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:29:19,783 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:29:19,783 INFO L87 Difference]: Start difference. First operand 293 states and 469 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-01-09 14:29:19,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:19,857 INFO L93 Difference]: Finished difference Result 828 states and 1323 transitions. [2025-01-09 14:29:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:29:19,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 430 [2025-01-09 14:29:19,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:19,863 INFO L225 Difference]: With dead ends: 828 [2025-01-09 14:29:19,863 INFO L226 Difference]: Without dead ends: 538 [2025-01-09 14:29:19,864 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:29:19,864 INFO L435 NwaCegarLoop]: 509 mSDtfsCounter, 240 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:19,865 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 799 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:29:19,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2025-01-09 14:29:19,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 345. [2025-01-09 14:29:19,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 345 states, 249 states have (on average 1.4899598393574298) internal successors, (371), 250 states have internal predecessors, (371), 93 states have call successors, (93), 2 states have call predecessors, (93), 2 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 14:29:19,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 345 states to 345 states and 557 transitions. [2025-01-09 14:29:19,908 INFO L78 Accepts]: Start accepts. Automaton has 345 states and 557 transitions. Word has length 430 [2025-01-09 14:29:19,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:19,909 INFO L471 AbstractCegarLoop]: Abstraction has 345 states and 557 transitions. [2025-01-09 14:29:19,909 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-01-09 14:29:19,909 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 557 transitions. [2025-01-09 14:29:19,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:29:19,914 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:19,914 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:19,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:29:19,914 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:19,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:19,915 INFO L85 PathProgramCache]: Analyzing trace with hash 1896519473, now seen corresponding path program 1 times [2025-01-09 14:29:19,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:19,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414909400] [2025-01-09 14:29:19,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:19,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:19,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:29:20,014 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:29:20,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:20,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:20,530 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-01-09 14:29:20,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:20,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414909400] [2025-01-09 14:29:20,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414909400] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:20,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:20,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:29:20,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667034613] [2025-01-09 14:29:20,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:20,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:29:20,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:20,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:29:20,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:29:20,532 INFO L87 Difference]: Start difference. First operand 345 states and 557 transitions. Second operand has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-01-09 14:29:20,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:20,675 INFO L93 Difference]: Finished difference Result 717 states and 1140 transitions. [2025-01-09 14:29:20,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:29:20,676 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 430 [2025-01-09 14:29:20,676 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:20,679 INFO L225 Difference]: With dead ends: 717 [2025-01-09 14:29:20,679 INFO L226 Difference]: Without dead ends: 375 [2025-01-09 14:29:20,680 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:29:20,680 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 278 mSDsluCounter, 376 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:20,680 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 727 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:29:20,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2025-01-09 14:29:20,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 326. [2025-01-09 14:29:20,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 228 states have (on average 1.4429824561403508) internal successors, (329), 229 states have internal predecessors, (329), 93 states have call successors, (93), 4 states have call predecessors, (93), 4 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 14:29:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 515 transitions. [2025-01-09 14:29:20,704 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 515 transitions. Word has length 430 [2025-01-09 14:29:20,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:20,705 INFO L471 AbstractCegarLoop]: Abstraction has 326 states and 515 transitions. [2025-01-09 14:29:20,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 23.25) internal successors, (93), 4 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-01-09 14:29:20,705 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 515 transitions. [2025-01-09 14:29:20,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:29:20,708 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:20,709 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:20,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:29:20,709 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:20,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash 411023469, now seen corresponding path program 1 times [2025-01-09 14:29:20,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:20,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2060563622] [2025-01-09 14:29:20,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:20,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:20,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:29:20,773 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:29:20,773 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:20,773 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:21,590 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9112 trivial. 0 not checked. [2025-01-09 14:29:21,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:21,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2060563622] [2025-01-09 14:29:21,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2060563622] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:29:21,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:29:21,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 14:29:21,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843282804] [2025-01-09 14:29:21,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:29:21,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 14:29:21,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:21,592 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 14:29:21,592 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:29:21,593 INFO L87 Difference]: Start difference. First operand 326 states and 515 transitions. Second operand has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-01-09 14:29:21,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:21,815 INFO L93 Difference]: Finished difference Result 721 states and 1137 transitions. [2025-01-09 14:29:21,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 14:29:21,816 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) Word has length 430 [2025-01-09 14:29:21,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:21,820 INFO L225 Difference]: With dead ends: 721 [2025-01-09 14:29:21,820 INFO L226 Difference]: Without dead ends: 398 [2025-01-09 14:29:21,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 14:29:21,822 INFO L435 NwaCegarLoop]: 351 mSDtfsCounter, 372 mSDsluCounter, 389 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 372 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:21,823 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [372 Valid, 740 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 14:29:21,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 398 states. [2025-01-09 14:29:21,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 398 to 349. [2025-01-09 14:29:21,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 251 states have (on average 1.4661354581673307) internal successors, (368), 252 states have internal predecessors, (368), 93 states have call successors, (93), 4 states have call predecessors, (93), 4 states have return successors, (93), 92 states have call predecessors, (93), 93 states have call successors, (93) [2025-01-09 14:29:21,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 554 transitions. [2025-01-09 14:29:21,849 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 554 transitions. Word has length 430 [2025-01-09 14:29:21,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:21,850 INFO L471 AbstractCegarLoop]: Abstraction has 349 states and 554 transitions. [2025-01-09 14:29:21,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.6) internal successors, (93), 5 states have internal predecessors, (93), 1 states have call successors, (68), 1 states have call predecessors, (68), 1 states have return successors, (68), 1 states have call predecessors, (68), 1 states have call successors, (68) [2025-01-09 14:29:21,852 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 554 transitions. [2025-01-09 14:29:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2025-01-09 14:29:21,857 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:21,857 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:21,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:29:21,857 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:21,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash -486369809, now seen corresponding path program 1 times [2025-01-09 14:29:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:21,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [427707568] [2025-01-09 14:29:21,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:21,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:21,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:29:22,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:29:22,247 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:22,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:23,408 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 69 proven. 132 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-01-09 14:29:23,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [427707568] [2025-01-09 14:29:23,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [427707568] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:23,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [452015916] [2025-01-09 14:29:23,409 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:23,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:23,409 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:23,412 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:29:23,413 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:29:23,521 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 430 statements into 1 equivalence classes. [2025-01-09 14:29:23,620 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 430 of 430 statements. [2025-01-09 14:29:23,620 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:23,620 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:23,624 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 14:29:23,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:24,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4751 proven. 114 refuted. 0 times theorem prover too weak. 4247 trivial. 0 not checked. [2025-01-09 14:29:24,525 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:29:24,992 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 87 proven. 114 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-01-09 14:29:24,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [452015916] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:29:24,992 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:29:24,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 16 [2025-01-09 14:29:24,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [536936824] [2025-01-09 14:29:24,992 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:29:24,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 14:29:24,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:24,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 14:29:24,997 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2025-01-09 14:29:24,997 INFO L87 Difference]: Start difference. First operand 349 states and 554 transitions. Second operand has 16 states, 16 states have (on average 15.3125) internal successors, (245), 16 states have internal predecessors, (245), 8 states have call successors, (202), 3 states have call predecessors, (202), 6 states have return successors, (202), 8 states have call predecessors, (202), 8 states have call successors, (202) [2025-01-09 14:29:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:26,051 INFO L93 Difference]: Finished difference Result 1173 states and 1845 transitions. [2025-01-09 14:29:26,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-01-09 14:29:26,052 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 15.3125) internal successors, (245), 16 states have internal predecessors, (245), 8 states have call successors, (202), 3 states have call predecessors, (202), 6 states have return successors, (202), 8 states have call predecessors, (202), 8 states have call successors, (202) Word has length 430 [2025-01-09 14:29:26,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:26,056 INFO L225 Difference]: With dead ends: 1173 [2025-01-09 14:29:26,056 INFO L226 Difference]: Without dead ends: 827 [2025-01-09 14:29:26,058 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 884 GetRequests, 856 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=258, Invalid=612, Unknown=0, NotChecked=0, Total=870 [2025-01-09 14:29:26,058 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 621 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 982 mSolverCounterSat, 311 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 650 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 1293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 311 IncrementalHoareTripleChecker+Valid, 982 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:26,058 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [650 Valid, 1427 Invalid, 1293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [311 Valid, 982 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:29:26,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 827 states. [2025-01-09 14:29:26,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 827 to 686. [2025-01-09 14:29:26,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 686 states, 487 states have (on average 1.433264887063655) internal successors, (698), 489 states have internal predecessors, (698), 186 states have call successors, (186), 12 states have call predecessors, (186), 12 states have return successors, (186), 184 states have call predecessors, (186), 186 states have call successors, (186) [2025-01-09 14:29:26,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 686 states to 686 states and 1070 transitions. [2025-01-09 14:29:26,135 INFO L78 Accepts]: Start accepts. Automaton has 686 states and 1070 transitions. Word has length 430 [2025-01-09 14:29:26,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:26,136 INFO L471 AbstractCegarLoop]: Abstraction has 686 states and 1070 transitions. [2025-01-09 14:29:26,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 15.3125) internal successors, (245), 16 states have internal predecessors, (245), 8 states have call successors, (202), 3 states have call predecessors, (202), 6 states have return successors, (202), 8 states have call predecessors, (202), 8 states have call successors, (202) [2025-01-09 14:29:26,140 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 1070 transitions. [2025-01-09 14:29:26,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-09 14:29:26,143 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:26,143 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:26,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-01-09 14:29:26,343 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:26,344 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:26,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:26,344 INFO L85 PathProgramCache]: Analyzing trace with hash 274555773, now seen corresponding path program 1 times [2025-01-09 14:29:26,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:26,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108792200] [2025-01-09 14:29:26,344 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:26,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:26,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 14:29:26,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 14:29:26,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:26,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:26,976 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 150 proven. 51 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-01-09 14:29:26,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:26,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108792200] [2025-01-09 14:29:26,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108792200] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:26,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1997049220] [2025-01-09 14:29:26,976 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:26,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:26,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:26,978 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:29:26,981 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:29:27,087 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 14:29:27,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 14:29:27,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:27,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:27,178 INFO L256 TraceCheckSpWp]: Trace formula consists of 955 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-01-09 14:29:27,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:28,290 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4161 proven. 132 refuted. 0 times theorem prover too weak. 4819 trivial. 0 not checked. [2025-01-09 14:29:28,291 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:29:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 69 proven. 132 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-01-09 14:29:28,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1997049220] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:29:28,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:29:28,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 20 [2025-01-09 14:29:28,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1395553690] [2025-01-09 14:29:28,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:29:28,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 14:29:28,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:28,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 14:29:28,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=314, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:29:28,761 INFO L87 Difference]: Start difference. First operand 686 states and 1070 transitions. Second operand has 20 states, 20 states have (on average 11.85) internal successors, (237), 20 states have internal predecessors, (237), 6 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (204), 6 states have call predecessors, (204), 6 states have call successors, (204) [2025-01-09 14:29:30,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:30,711 INFO L93 Difference]: Finished difference Result 2314 states and 3595 transitions. [2025-01-09 14:29:30,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-01-09 14:29:30,712 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 11.85) internal successors, (237), 20 states have internal predecessors, (237), 6 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (204), 6 states have call predecessors, (204), 6 states have call successors, (204) Word has length 431 [2025-01-09 14:29:30,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:30,722 INFO L225 Difference]: With dead ends: 2314 [2025-01-09 14:29:30,722 INFO L226 Difference]: Without dead ends: 1631 [2025-01-09 14:29:30,724 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 903 GetRequests, 851 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 726 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=636, Invalid=2226, Unknown=0, NotChecked=0, Total=2862 [2025-01-09 14:29:30,726 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 2651 mSDsluCounter, 1738 mSDsCounter, 0 mSdLazyCounter, 2077 mSolverCounterSat, 819 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2676 SdHoareTripleChecker+Valid, 2007 SdHoareTripleChecker+Invalid, 2896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 819 IncrementalHoareTripleChecker+Valid, 2077 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:30,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2676 Valid, 2007 Invalid, 2896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [819 Valid, 2077 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-01-09 14:29:30,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1631 states. [2025-01-09 14:29:30,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1631 to 1188. [2025-01-09 14:29:30,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 875 states have (on average 1.4285714285714286) internal successors, (1250), 881 states have internal predecessors, (1250), 286 states have call successors, (286), 26 states have call predecessors, (286), 26 states have return successors, (286), 280 states have call predecessors, (286), 286 states have call successors, (286) [2025-01-09 14:29:30,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1822 transitions. [2025-01-09 14:29:30,825 INFO L78 Accepts]: Start accepts. Automaton has 1188 states and 1822 transitions. Word has length 431 [2025-01-09 14:29:30,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:30,826 INFO L471 AbstractCegarLoop]: Abstraction has 1188 states and 1822 transitions. [2025-01-09 14:29:30,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 11.85) internal successors, (237), 20 states have internal predecessors, (237), 6 states have call successors, (204), 3 states have call predecessors, (204), 6 states have return successors, (204), 6 states have call predecessors, (204), 6 states have call successors, (204) [2025-01-09 14:29:30,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1188 states and 1822 transitions. [2025-01-09 14:29:30,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 432 [2025-01-09 14:29:30,829 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:30,829 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:30,837 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:29:31,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:31,034 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:31,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:31,035 INFO L85 PathProgramCache]: Analyzing trace with hash -822491911, now seen corresponding path program 1 times [2025-01-09 14:29:31,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:31,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997680392] [2025-01-09 14:29:31,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:31,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:31,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 14:29:31,273 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 14:29:31,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:31,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:32,017 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 69 proven. 132 refuted. 0 times theorem prover too weak. 8911 trivial. 0 not checked. [2025-01-09 14:29:32,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:29:32,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997680392] [2025-01-09 14:29:32,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997680392] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:29:32,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1884880536] [2025-01-09 14:29:32,018 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:32,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:29:32,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:29:32,020 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:29:32,028 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:29:32,156 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 431 statements into 1 equivalence classes. [2025-01-09 14:29:32,248 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 431 of 431 statements. [2025-01-09 14:29:32,248 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:32,248 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:29:32,254 INFO L256 TraceCheckSpWp]: Trace formula consists of 952 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 14:29:32,259 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:29:33,067 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 4139 proven. 327 refuted. 0 times theorem prover too weak. 4646 trivial. 0 not checked. [2025-01-09 14:29:33,068 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:29:33,511 INFO L134 CoverageAnalysis]: Checked inductivity of 9112 backedges. 69 proven. 330 refuted. 0 times theorem prover too weak. 8713 trivial. 0 not checked. [2025-01-09 14:29:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1884880536] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:29:33,512 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:29:33,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 20 [2025-01-09 14:29:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [229757800] [2025-01-09 14:29:33,512 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:29:33,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 14:29:33,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:29:33,514 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 14:29:33,515 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=305, Unknown=0, NotChecked=0, Total=380 [2025-01-09 14:29:33,515 INFO L87 Difference]: Start difference. First operand 1188 states and 1822 transitions. Second operand has 20 states, 20 states have (on average 12.25) internal successors, (245), 20 states have internal predecessors, (245), 7 states have call successors, (200), 3 states have call predecessors, (200), 7 states have return successors, (202), 7 states have call predecessors, (202), 7 states have call successors, (202) [2025-01-09 14:29:34,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:29:34,615 INFO L93 Difference]: Finished difference Result 2001 states and 2992 transitions. [2025-01-09 14:29:34,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 14:29:34,616 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 12.25) internal successors, (245), 20 states have internal predecessors, (245), 7 states have call successors, (200), 3 states have call predecessors, (200), 7 states have return successors, (202), 7 states have call predecessors, (202), 7 states have call successors, (202) Word has length 431 [2025-01-09 14:29:34,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:29:34,624 INFO L225 Difference]: With dead ends: 2001 [2025-01-09 14:29:34,624 INFO L226 Difference]: Without dead ends: 1310 [2025-01-09 14:29:34,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 892 GetRequests, 854 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=377, Invalid=1183, Unknown=0, NotChecked=0, Total=1560 [2025-01-09 14:29:34,627 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 725 mSDsluCounter, 799 mSDsCounter, 0 mSdLazyCounter, 1268 mSolverCounterSat, 243 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 1511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 243 IncrementalHoareTripleChecker+Valid, 1268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-01-09 14:29:34,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 1003 Invalid, 1511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [243 Valid, 1268 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-01-09 14:29:34,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2025-01-09 14:29:34,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1276. [2025-01-09 14:29:34,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1276 states, 941 states have (on average 1.3931987247608926) internal successors, (1311), 947 states have internal predecessors, (1311), 286 states have call successors, (286), 48 states have call predecessors, (286), 48 states have return successors, (286), 280 states have call predecessors, (286), 286 states have call successors, (286) [2025-01-09 14:29:34,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1276 states to 1276 states and 1883 transitions. [2025-01-09 14:29:34,753 INFO L78 Accepts]: Start accepts. Automaton has 1276 states and 1883 transitions. Word has length 431 [2025-01-09 14:29:34,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:29:34,755 INFO L471 AbstractCegarLoop]: Abstraction has 1276 states and 1883 transitions. [2025-01-09 14:29:34,756 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 12.25) internal successors, (245), 20 states have internal predecessors, (245), 7 states have call successors, (200), 3 states have call predecessors, (200), 7 states have return successors, (202), 7 states have call predecessors, (202), 7 states have call successors, (202) [2025-01-09 14:29:34,756 INFO L276 IsEmpty]: Start isEmpty. Operand 1276 states and 1883 transitions. [2025-01-09 14:29:34,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2025-01-09 14:29:34,760 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:29:34,760 INFO L218 NwaCegarLoop]: trace histogram [68, 68, 68, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29:34,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 14:29:34,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 14:29:34,962 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:29:34,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:29:34,962 INFO L85 PathProgramCache]: Analyzing trace with hash 2047231797, now seen corresponding path program 1 times [2025-01-09 14:29:34,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:29:34,963 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [892487335] [2025-01-09 14:29:34,963 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:29:34,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:29:34,987 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 432 statements into 1 equivalence classes. [2025-01-09 14:29:35,168 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 432 of 432 statements. [2025-01-09 14:29:35,169 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:29:35,169 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat