./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-27.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-27.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 5acf4253b443244094cfe64cde0a882806db433781b0bda7a83218841032b1a3 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 14:44:59,726 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 14:44:59,761 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:44:59,765 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 14:44:59,765 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 14:44:59,779 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 14:44:59,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 14:44:59,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 14:44:59,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 14:44:59,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 14:44:59,780 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 14:44:59,780 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 14:44:59,780 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 14:44:59,780 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 14:44:59,780 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 14:44:59,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 14:44:59,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 14:44:59,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 14:44:59,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 14:44:59,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 14:44:59,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 14:44:59,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 14:44:59,781 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 14:44:59,781 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 14:44:59,781 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 14:44:59,781 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 14:44:59,781 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 14:44:59,781 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 14:44:59,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 14:44:59,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:44:59,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:44:59,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:44:59,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:59,782 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 14:44:59,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 14:44:59,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 14:44:59,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 14:44:59,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:44:59,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 14:44:59,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 14:44:59,782 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 14:44:59,783 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 14:44:59,783 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 14:44:59,783 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 14:44:59,783 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 14:44:59,783 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 14:44:59,783 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 14:44:59,783 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 14:44:59,783 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 -> 5acf4253b443244094cfe64cde0a882806db433781b0bda7a83218841032b1a3 [2025-01-09 14:44:59,955 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 14:44:59,960 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 14:44:59,961 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 14:44:59,962 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 14:44:59,962 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 14:44:59,963 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-27.i [2025-01-09 14:45:01,137 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/726bd56e7/7e36951f4bdd4609bc68b38a9a799a53/FLAG115784515 [2025-01-09 14:45:01,511 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 14:45:01,511 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-27.i [2025-01-09 14:45:01,534 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/726bd56e7/7e36951f4bdd4609bc68b38a9a799a53/FLAG115784515 [2025-01-09 14:45:01,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/726bd56e7/7e36951f4bdd4609bc68b38a9a799a53 [2025-01-09 14:45:01,549 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 14:45:01,557 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 14:45:01,558 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 14:45:01,558 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 14:45:01,561 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 14:45:01,562 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:01,562 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41f9ca31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01, skipping insertion in model container [2025-01-09 14:45:01,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:01,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 14:45:01,695 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-27.i[916,929] [2025-01-09 14:45:01,862 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:45:01,877 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 14:45:01,886 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-27.i[916,929] [2025-01-09 14:45:01,958 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 14:45:01,984 INFO L204 MainTranslator]: Completed translation [2025-01-09 14:45:01,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01 WrapperNode [2025-01-09 14:45:01,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 14:45:01,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 14:45:01,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 14:45:01,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 14:45:01,994 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:45:01" (1/1) ... [2025-01-09 14:45:02,015 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:45:01" (1/1) ... [2025-01-09 14:45:02,066 INFO L138 Inliner]: procedures = 26, calls = 103, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 737 [2025-01-09 14:45:02,067 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 14:45:02,067 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 14:45:02,067 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 14:45:02,068 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 14:45:02,078 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:02,078 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:02,092 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:02,136 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:45:02,137 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:02,137 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:02,167 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:02,178 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:02,186 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:02,201 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:02,206 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:02,216 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 14:45:02,218 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 14:45:02,218 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 14:45:02,218 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 14:45:02,220 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01" (1/1) ... [2025-01-09 14:45:02,225 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 14:45:02,234 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:02,250 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:45:02,278 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:45:02,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 14:45:02,295 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 14:45:02,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 14:45:02,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 14:45:02,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 14:45:02,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 14:45:02,426 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 14:45:02,428 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 14:45:03,471 INFO L? ?]: Removed 88 outVars from TransFormulas that were not future-live. [2025-01-09 14:45:03,472 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 14:45:03,486 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 14:45:03,488 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 14:45:03,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:45:03 BoogieIcfgContainer [2025-01-09 14:45:03,492 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 14:45:03,494 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 14:45:03,494 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 14:45:03,497 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 14:45:03,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 02:45:01" (1/3) ... [2025-01-09 14:45:03,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c607da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:45:03, skipping insertion in model container [2025-01-09 14:45:03,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 02:45:01" (2/3) ... [2025-01-09 14:45:03,497 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c607da0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 02:45:03, skipping insertion in model container [2025-01-09 14:45:03,497 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 02:45:03" (3/3) ... [2025-01-09 14:45:03,498 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-27.i [2025-01-09 14:45:03,507 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 14:45:03,509 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-27.i that has 2 procedures, 294 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 14:45:03,565 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 14:45:03,572 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;@4f50a4f2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 14:45:03,572 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 14:45:03,576 INFO L276 IsEmpty]: Start isEmpty. Operand has 294 states, 201 states have (on average 1.507462686567164) internal successors, (303), 202 states have internal predecessors, (303), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 14:45:03,599 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-01-09 14:45:03,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:03,601 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:03,602 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:03,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:03,606 INFO L85 PathProgramCache]: Analyzing trace with hash 2018116609, now seen corresponding path program 1 times [2025-01-09 14:45:03,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:03,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556381195] [2025-01-09 14:45:03,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:03,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:03,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-01-09 14:45:03,758 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-01-09 14:45:03,758 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:03,758 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:04,142 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 178 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2025-01-09 14:45:04,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:04,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556381195] [2025-01-09 14:45:04,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556381195] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:04,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407559568] [2025-01-09 14:45:04,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:04,143 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:04,143 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:04,145 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:45:04,147 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:45:04,317 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-01-09 14:45:04,498 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-01-09 14:45:04,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:04,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:04,505 INFO L256 TraceCheckSpWp]: Trace formula consists of 1390 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 14:45:04,521 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:45:04,569 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 178 proven. 0 refuted. 0 times theorem prover too weak. 15842 trivial. 0 not checked. [2025-01-09 14:45:04,569 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 14:45:04,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407559568] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:04,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 14:45:04,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 14:45:04,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1652124628] [2025-01-09 14:45:04,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:04,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 14:45:04,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:04,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 14:45:04,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 14:45:04,592 INFO L87 Difference]: Start difference. First operand has 294 states, 201 states have (on average 1.507462686567164) internal successors, (303), 202 states have internal predecessors, (303), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) Second operand has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) [2025-01-09 14:45:04,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:04,633 INFO L93 Difference]: Finished difference Result 582 states and 1051 transitions. [2025-01-09 14:45:04,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 14:45:04,634 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) Word has length 589 [2025-01-09 14:45:04,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:04,641 INFO L225 Difference]: With dead ends: 582 [2025-01-09 14:45:04,641 INFO L226 Difference]: Without dead ends: 291 [2025-01-09 14:45:04,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 590 GetRequests, 590 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:45:04,647 INFO L435 NwaCegarLoop]: 478 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, 478 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:45:04,648 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:04,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 291 states. [2025-01-09 14:45:04,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 291 to 291. [2025-01-09 14:45:04,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 199 states have (on average 1.4974874371859297) internal successors, (298), 199 states have internal predecessors, (298), 90 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 14:45:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 478 transitions. [2025-01-09 14:45:04,721 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 478 transitions. Word has length 589 [2025-01-09 14:45:04,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:04,722 INFO L471 AbstractCegarLoop]: Abstraction has 291 states and 478 transitions. [2025-01-09 14:45:04,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 72.0) internal successors, (144), 2 states have internal predecessors, (144), 2 states have call successors, (90), 2 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 2 states have call successors, (90) [2025-01-09 14:45:04,722 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 478 transitions. [2025-01-09 14:45:04,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 590 [2025-01-09 14:45:04,744 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:04,745 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:04,766 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 14:45:04,946 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:45:04,946 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:04,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:04,947 INFO L85 PathProgramCache]: Analyzing trace with hash 1737108281, now seen corresponding path program 1 times [2025-01-09 14:45:04,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:04,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348512320] [2025-01-09 14:45:04,947 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:04,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:05,033 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 589 statements into 1 equivalence classes. [2025-01-09 14:45:05,164 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 589 of 589 statements. [2025-01-09 14:45:05,164 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:05,164 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:05,716 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 14:45:05,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:05,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348512320] [2025-01-09 14:45:05,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348512320] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:05,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:05,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:05,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468173044] [2025-01-09 14:45:05,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:05,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:05,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:05,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:05,721 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:05,721 INFO L87 Difference]: Start difference. First operand 291 states and 478 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 14:45:05,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:05,851 INFO L93 Difference]: Finished difference Result 732 states and 1205 transitions. [2025-01-09 14:45:05,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:05,852 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 589 [2025-01-09 14:45:05,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:05,857 INFO L225 Difference]: With dead ends: 732 [2025-01-09 14:45:05,860 INFO L226 Difference]: Without dead ends: 444 [2025-01-09 14:45:05,861 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:45:05,861 INFO L435 NwaCegarLoop]: 542 mSDtfsCounter, 236 mSDsluCounter, 451 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 993 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:05,862 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 993 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 14:45:05,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 444 states. [2025-01-09 14:45:05,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 444 to 441. [2025-01-09 14:45:05,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 320 states have (on average 1.525) internal successors, (488), 321 states have internal predecessors, (488), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 14:45:05,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 724 transitions. [2025-01-09 14:45:05,915 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 724 transitions. Word has length 589 [2025-01-09 14:45:05,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:05,918 INFO L471 AbstractCegarLoop]: Abstraction has 441 states and 724 transitions. [2025-01-09 14:45:05,918 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 3 states have internal predecessors, (142), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 14:45:05,918 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 724 transitions. [2025-01-09 14:45:05,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-01-09 14:45:05,925 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:05,926 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:05,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 14:45:05,927 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:05,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:05,928 INFO L85 PathProgramCache]: Analyzing trace with hash -143513466, now seen corresponding path program 1 times [2025-01-09 14:45:05,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:05,928 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704837374] [2025-01-09 14:45:05,928 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:05,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:05,982 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-01-09 14:45:06,043 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-01-09 14:45:06,046 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:06,046 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:06,330 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 14:45:06,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:06,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704837374] [2025-01-09 14:45:06,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704837374] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:06,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:06,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 14:45:06,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899637890] [2025-01-09 14:45:06,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:06,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 14:45:06,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:06,335 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 14:45:06,336 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 14:45:06,336 INFO L87 Difference]: Start difference. First operand 441 states and 724 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 14:45:06,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:06,433 INFO L93 Difference]: Finished difference Result 1303 states and 2142 transitions. [2025-01-09 14:45:06,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 14:45:06,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 590 [2025-01-09 14:45:06,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:06,455 INFO L225 Difference]: With dead ends: 1303 [2025-01-09 14:45:06,455 INFO L226 Difference]: Without dead ends: 865 [2025-01-09 14:45:06,457 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:45:06,459 INFO L435 NwaCegarLoop]: 473 mSDtfsCounter, 431 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 431 SdHoareTripleChecker+Valid, 937 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:06,461 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [431 Valid, 937 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 14:45:06,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2025-01-09 14:45:06,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 553. [2025-01-09 14:45:06,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 553 states, 432 states have (on average 1.5902777777777777) internal successors, (687), 433 states have internal predecessors, (687), 118 states have call successors, (118), 2 states have call predecessors, (118), 2 states have return successors, (118), 117 states have call predecessors, (118), 118 states have call successors, (118) [2025-01-09 14:45:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 553 states to 553 states and 923 transitions. [2025-01-09 14:45:06,529 INFO L78 Accepts]: Start accepts. Automaton has 553 states and 923 transitions. Word has length 590 [2025-01-09 14:45:06,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:06,530 INFO L471 AbstractCegarLoop]: Abstraction has 553 states and 923 transitions. [2025-01-09 14:45:06,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 14:45:06,530 INFO L276 IsEmpty]: Start isEmpty. Operand 553 states and 923 transitions. [2025-01-09 14:45:06,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-01-09 14:45:06,540 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:06,540 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:06,540 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 14:45:06,540 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:06,541 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:06,541 INFO L85 PathProgramCache]: Analyzing trace with hash 279188360, now seen corresponding path program 1 times [2025-01-09 14:45:06,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:06,542 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799807864] [2025-01-09 14:45:06,542 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:06,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:06,589 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-01-09 14:45:07,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-01-09 14:45:07,307 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:07,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:08,182 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 14:45:08,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:08,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799807864] [2025-01-09 14:45:08,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799807864] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:08,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:08,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:08,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937915155] [2025-01-09 14:45:08,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:08,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:08,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:08,185 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:08,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:08,185 INFO L87 Difference]: Start difference. First operand 553 states and 923 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 14:45:08,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:08,558 INFO L93 Difference]: Finished difference Result 1683 states and 2808 transitions. [2025-01-09 14:45:08,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:08,559 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 590 [2025-01-09 14:45:08,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:08,568 INFO L225 Difference]: With dead ends: 1683 [2025-01-09 14:45:08,568 INFO L226 Difference]: Without dead ends: 1133 [2025-01-09 14:45:08,569 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:45:08,570 INFO L435 NwaCegarLoop]: 650 mSDtfsCounter, 844 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1049 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:08,571 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1049 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:45:08,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2025-01-09 14:45:08,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1104. [2025-01-09 14:45:08,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1104 states, 862 states have (on average 1.5765661252900232) internal successors, (1359), 864 states have internal predecessors, (1359), 236 states have call successors, (236), 5 states have call predecessors, (236), 5 states have return successors, (236), 234 states have call predecessors, (236), 236 states have call successors, (236) [2025-01-09 14:45:08,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1104 states to 1104 states and 1831 transitions. [2025-01-09 14:45:08,651 INFO L78 Accepts]: Start accepts. Automaton has 1104 states and 1831 transitions. Word has length 590 [2025-01-09 14:45:08,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:08,652 INFO L471 AbstractCegarLoop]: Abstraction has 1104 states and 1831 transitions. [2025-01-09 14:45:08,652 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 14:45:08,652 INFO L276 IsEmpty]: Start isEmpty. Operand 1104 states and 1831 transitions. [2025-01-09 14:45:08,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-01-09 14:45:08,658 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:08,658 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:08,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 14:45:08,659 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:08,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:08,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1155207366, now seen corresponding path program 1 times [2025-01-09 14:45:08,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:08,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073100082] [2025-01-09 14:45:08,661 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:08,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:08,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-01-09 14:45:09,115 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-01-09 14:45:09,115 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:09,115 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16020 trivial. 0 not checked. [2025-01-09 14:45:09,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:09,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073100082] [2025-01-09 14:45:09,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073100082] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 14:45:09,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 14:45:09,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 14:45:09,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911393520] [2025-01-09 14:45:09,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 14:45:09,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 14:45:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:09,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 14:45:09,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 14:45:09,695 INFO L87 Difference]: Start difference. First operand 1104 states and 1831 transitions. Second operand has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 14:45:10,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:10,400 INFO L93 Difference]: Finished difference Result 3612 states and 6000 transitions. [2025-01-09 14:45:10,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 14:45:10,400 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) Word has length 590 [2025-01-09 14:45:10,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:10,417 INFO L225 Difference]: With dead ends: 3612 [2025-01-09 14:45:10,417 INFO L226 Difference]: Without dead ends: 2511 [2025-01-09 14:45:10,421 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:45:10,423 INFO L435 NwaCegarLoop]: 613 mSDtfsCounter, 762 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 1292 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:10,424 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 1292 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 14:45:10,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2511 states. [2025-01-09 14:45:10,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2511 to 1570. [2025-01-09 14:45:10,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1570 states, 1237 states have (on average 1.5893290218270009) internal successors, (1966), 1241 states have internal predecessors, (1966), 325 states have call successors, (325), 7 states have call predecessors, (325), 7 states have return successors, (325), 321 states have call predecessors, (325), 325 states have call successors, (325) [2025-01-09 14:45:10,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1570 states to 1570 states and 2616 transitions. [2025-01-09 14:45:10,555 INFO L78 Accepts]: Start accepts. Automaton has 1570 states and 2616 transitions. Word has length 590 [2025-01-09 14:45:10,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:10,557 INFO L471 AbstractCegarLoop]: Abstraction has 1570 states and 2616 transitions. [2025-01-09 14:45:10,558 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 35.75) internal successors, (143), 4 states have internal predecessors, (143), 1 states have call successors, (90), 1 states have call predecessors, (90), 1 states have return successors, (90), 1 states have call predecessors, (90), 1 states have call successors, (90) [2025-01-09 14:45:10,559 INFO L276 IsEmpty]: Start isEmpty. Operand 1570 states and 2616 transitions. [2025-01-09 14:45:10,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 591 [2025-01-09 14:45:10,566 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:10,566 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:10,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 14:45:10,566 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:10,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:10,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1195882116, now seen corresponding path program 1 times [2025-01-09 14:45:10,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:10,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960663862] [2025-01-09 14:45:10,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:10,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:10,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-01-09 14:45:11,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-01-09 14:45:11,544 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:11,544 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:12,013 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 81 proven. 186 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-01-09 14:45:12,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:12,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960663862] [2025-01-09 14:45:12,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960663862] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:12,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1090354529] [2025-01-09 14:45:12,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:12,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:12,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:12,016 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:45:12,018 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:45:12,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 590 statements into 1 equivalence classes. [2025-01-09 14:45:12,323 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 590 of 590 statements. [2025-01-09 14:45:12,324 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:12,324 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:12,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 1387 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 14:45:12,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:45:13,299 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 9708 proven. 204 refuted. 0 times theorem prover too weak. 6108 trivial. 0 not checked. [2025-01-09 14:45:13,299 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:45:14,003 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 96 proven. 171 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-01-09 14:45:14,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1090354529] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:45:14,004 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:45:14,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9, 7] total 14 [2025-01-09 14:45:14,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623716757] [2025-01-09 14:45:14,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:45:14,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 14:45:14,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:14,006 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 14:45:14,007 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 14:45:14,007 INFO L87 Difference]: Start difference. First operand 1570 states and 2616 transitions. Second operand has 14 states, 14 states have (on average 21.0) internal successors, (294), 14 states have internal predecessors, (294), 4 states have call successors, (209), 3 states have call predecessors, (209), 6 states have return successors, (211), 4 states have call predecessors, (211), 4 states have call successors, (211) [2025-01-09 14:45:15,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:15,220 INFO L93 Difference]: Finished difference Result 2875 states and 4684 transitions. [2025-01-09 14:45:15,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 14:45:15,222 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 21.0) internal successors, (294), 14 states have internal predecessors, (294), 4 states have call successors, (209), 3 states have call predecessors, (209), 6 states have return successors, (211), 4 states have call predecessors, (211), 4 states have call successors, (211) Word has length 590 [2025-01-09 14:45:15,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:15,232 INFO L225 Difference]: With dead ends: 2875 [2025-01-09 14:45:15,232 INFO L226 Difference]: Without dead ends: 1308 [2025-01-09 14:45:15,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1200 GetRequests, 1171 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 153 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=239, Invalid=573, Unknown=0, NotChecked=0, Total=812 [2025-01-09 14:45:15,238 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 1394 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 838 mSolverCounterSat, 562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1394 SdHoareTripleChecker+Valid, 1166 SdHoareTripleChecker+Invalid, 1400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 562 IncrementalHoareTripleChecker+Valid, 838 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:15,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1394 Valid, 1166 Invalid, 1400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [562 Valid, 838 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 14:45:15,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2025-01-09 14:45:15,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1255. [2025-01-09 14:45:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1255 states, 918 states have (on average 1.4564270152505447) internal successors, (1337), 922 states have internal predecessors, (1337), 319 states have call successors, (319), 17 states have call predecessors, (319), 17 states have return successors, (319), 315 states have call predecessors, (319), 319 states have call successors, (319) [2025-01-09 14:45:15,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1255 states to 1255 states and 1975 transitions. [2025-01-09 14:45:15,362 INFO L78 Accepts]: Start accepts. Automaton has 1255 states and 1975 transitions. Word has length 590 [2025-01-09 14:45:15,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:15,363 INFO L471 AbstractCegarLoop]: Abstraction has 1255 states and 1975 transitions. [2025-01-09 14:45:15,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 21.0) internal successors, (294), 14 states have internal predecessors, (294), 4 states have call successors, (209), 3 states have call predecessors, (209), 6 states have return successors, (211), 4 states have call predecessors, (211), 4 states have call successors, (211) [2025-01-09 14:45:15,363 INFO L276 IsEmpty]: Start isEmpty. Operand 1255 states and 1975 transitions. [2025-01-09 14:45:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 592 [2025-01-09 14:45:15,367 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:15,367 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:15,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 14:45:15,568 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:45:15,568 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:15,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:15,569 INFO L85 PathProgramCache]: Analyzing trace with hash -1794300278, now seen corresponding path program 1 times [2025-01-09 14:45:15,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:15,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431661497] [2025-01-09 14:45:15,570 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:15,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:15,604 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-01-09 14:45:16,604 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-01-09 14:45:16,604 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:16,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:17,007 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 87 proven. 180 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-01-09 14:45:17,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431661497] [2025-01-09 14:45:17,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431661497] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:17,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056122954] [2025-01-09 14:45:17,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:17,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:17,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:17,011 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:45:17,014 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:45:17,166 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 591 statements into 1 equivalence classes. [2025-01-09 14:45:17,319 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 591 of 591 statements. [2025-01-09 14:45:17,319 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:17,319 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:17,326 INFO L256 TraceCheckSpWp]: Trace formula consists of 1389 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:45:17,340 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:45:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 7107 proven. 180 refuted. 0 times theorem prover too weak. 8733 trivial. 0 not checked. [2025-01-09 14:45:17,857 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:45:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 87 proven. 180 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-01-09 14:45:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056122954] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:45:18,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:45:18,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:45:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116468400] [2025-01-09 14:45:18,294 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:45:18,295 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:45:18,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:18,296 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:45:18,296 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:45:18,297 INFO L87 Difference]: Start difference. First operand 1255 states and 1975 transitions. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 2 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (151), 2 states have call predecessors, (151), 2 states have call successors, (151) [2025-01-09 14:45:18,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:18,728 INFO L93 Difference]: Finished difference Result 2107 states and 3288 transitions. [2025-01-09 14:45:18,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-01-09 14:45:18,729 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 2 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (151), 2 states have call predecessors, (151), 2 states have call successors, (151) Word has length 591 [2025-01-09 14:45:18,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:18,736 INFO L225 Difference]: With dead ends: 2107 [2025-01-09 14:45:18,736 INFO L226 Difference]: Without dead ends: 855 [2025-01-09 14:45:18,739 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1189 GetRequests, 1179 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-01-09 14:45:18,740 INFO L435 NwaCegarLoop]: 354 mSDtfsCounter, 462 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 495 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 879 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 495 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:18,741 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 879 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 495 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 14:45:18,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2025-01-09 14:45:18,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 829. [2025-01-09 14:45:18,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 829 states, 570 states have (on average 1.394736842105263) internal successors, (795), 571 states have internal predecessors, (795), 241 states have call successors, (241), 17 states have call predecessors, (241), 17 states have return successors, (241), 240 states have call predecessors, (241), 241 states have call successors, (241) [2025-01-09 14:45:18,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 829 states to 829 states and 1277 transitions. [2025-01-09 14:45:18,804 INFO L78 Accepts]: Start accepts. Automaton has 829 states and 1277 transitions. Word has length 591 [2025-01-09 14:45:18,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:18,805 INFO L471 AbstractCegarLoop]: Abstraction has 829 states and 1277 transitions. [2025-01-09 14:45:18,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 2 states have call successors, (150), 2 states have call predecessors, (150), 4 states have return successors, (151), 2 states have call predecessors, (151), 2 states have call successors, (151) [2025-01-09 14:45:18,806 INFO L276 IsEmpty]: Start isEmpty. Operand 829 states and 1277 transitions. [2025-01-09 14:45:18,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2025-01-09 14:45:18,810 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:18,810 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:18,831 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:45:19,011 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:45:19,011 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:19,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:19,012 INFO L85 PathProgramCache]: Analyzing trace with hash 789530902, now seen corresponding path program 1 times [2025-01-09 14:45:19,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:19,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2142322406] [2025-01-09 14:45:19,012 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:19,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:19,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-01-09 14:45:19,678 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-01-09 14:45:19,679 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:19,679 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:20,073 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 183 proven. 84 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-01-09 14:45:20,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:20,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2142322406] [2025-01-09 14:45:20,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2142322406] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:20,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [300757982] [2025-01-09 14:45:20,074 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:20,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:20,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:20,076 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:45:20,085 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:45:20,264 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 592 statements into 1 equivalence classes. [2025-01-09 14:45:20,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 592 of 592 statements. [2025-01-09 14:45:20,388 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:20,388 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:20,393 INFO L256 TraceCheckSpWp]: Trace formula consists of 1397 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 14:45:20,404 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:45:20,674 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 7043 proven. 84 refuted. 0 times theorem prover too weak. 8893 trivial. 0 not checked. [2025-01-09 14:45:20,674 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:45:21,049 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 183 proven. 84 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-01-09 14:45:21,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [300757982] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:45:21,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:45:21,050 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-01-09 14:45:21,050 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426162699] [2025-01-09 14:45:21,050 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:45:21,051 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 14:45:21,051 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:21,052 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 14:45:21,052 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-01-09 14:45:21,052 INFO L87 Difference]: Start difference. First operand 829 states and 1277 transitions. Second operand has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 2 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (119), 2 states have call predecessors, (119), 2 states have call successors, (119) [2025-01-09 14:45:21,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:21,525 INFO L93 Difference]: Finished difference Result 1186 states and 1814 transitions. [2025-01-09 14:45:21,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 14:45:21,528 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 2 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (119), 2 states have call predecessors, (119), 2 states have call successors, (119) Word has length 592 [2025-01-09 14:45:21,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:21,533 INFO L225 Difference]: With dead ends: 1186 [2025-01-09 14:45:21,533 INFO L226 Difference]: Without dead ends: 360 [2025-01-09 14:45:21,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1190 GetRequests, 1181 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=38, Invalid=52, Unknown=0, NotChecked=0, Total=90 [2025-01-09 14:45:21,536 INFO L435 NwaCegarLoop]: 358 mSDtfsCounter, 737 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 245 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 798 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 717 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 245 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:21,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [798 Valid, 891 Invalid, 717 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [245 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 14:45:21,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2025-01-09 14:45:21,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 316. [2025-01-09 14:45:21,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 316 states, 217 states have (on average 1.3640552995391706) internal successors, (296), 217 states have internal predecessors, (296), 90 states have call successors, (90), 8 states have call predecessors, (90), 8 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2025-01-09 14:45:21,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 316 states to 316 states and 476 transitions. [2025-01-09 14:45:21,562 INFO L78 Accepts]: Start accepts. Automaton has 316 states and 476 transitions. Word has length 592 [2025-01-09 14:45:21,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:21,562 INFO L471 AbstractCegarLoop]: Abstraction has 316 states and 476 transitions. [2025-01-09 14:45:21,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 22.0) internal successors, (154), 7 states have internal predecessors, (154), 2 states have call successors, (118), 2 states have call predecessors, (118), 4 states have return successors, (119), 2 states have call predecessors, (119), 2 states have call successors, (119) [2025-01-09 14:45:21,563 INFO L276 IsEmpty]: Start isEmpty. Operand 316 states and 476 transitions. [2025-01-09 14:45:21,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-01-09 14:45:21,565 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:21,565 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:21,574 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 14:45:21,770 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:45:21,771 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:21,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:21,772 INFO L85 PathProgramCache]: Analyzing trace with hash -1791595926, now seen corresponding path program 1 times [2025-01-09 14:45:21,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:21,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522973000] [2025-01-09 14:45:21,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:21,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:21,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-09 14:45:22,413 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-09 14:45:22,413 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:22,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:23,416 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 192 proven. 75 refuted. 0 times theorem prover too weak. 15753 trivial. 0 not checked. [2025-01-09 14:45:23,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:23,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522973000] [2025-01-09 14:45:23,417 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522973000] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:23,417 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012874756] [2025-01-09 14:45:23,417 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:23,417 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:23,417 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:23,419 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 14:45:23,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 14:45:23,595 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-09 14:45:23,778 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-09 14:45:23,779 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:23,779 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:23,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 1398 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-01-09 14:45:23,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:45:25,187 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 9824 proven. 570 refuted. 0 times theorem prover too weak. 5626 trivial. 0 not checked. [2025-01-09 14:45:25,187 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:45:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 180 proven. 351 refuted. 0 times theorem prover too weak. 15489 trivial. 0 not checked. [2025-01-09 14:45:26,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012874756] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:45:26,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:45:26,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 8] total 22 [2025-01-09 14:45:26,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081089556] [2025-01-09 14:45:26,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:45:26,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-01-09 14:45:26,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:45:26,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-01-09 14:45:26,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2025-01-09 14:45:26,806 INFO L87 Difference]: Start difference. First operand 316 states and 476 transitions. Second operand has 22 states, 21 states have (on average 19.571428571428573) internal successors, (411), 22 states have internal predecessors, (411), 9 states have call successors, (256), 4 states have call predecessors, (256), 9 states have return successors, (257), 8 states have call predecessors, (257), 9 states have call successors, (257) [2025-01-09 14:45:29,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 14:45:29,782 INFO L93 Difference]: Finished difference Result 1113 states and 1648 transitions. [2025-01-09 14:45:29,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2025-01-09 14:45:29,784 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 19.571428571428573) internal successors, (411), 22 states have internal predecessors, (411), 9 states have call successors, (256), 4 states have call predecessors, (256), 9 states have return successors, (257), 8 states have call predecessors, (257), 9 states have call successors, (257) Word has length 593 [2025-01-09 14:45:29,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 14:45:29,788 INFO L225 Difference]: With dead ends: 1113 [2025-01-09 14:45:29,788 INFO L226 Difference]: Without dead ends: 800 [2025-01-09 14:45:29,789 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1235 GetRequests, 1179 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 837 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=856, Invalid=2450, Unknown=0, NotChecked=0, Total=3306 [2025-01-09 14:45:29,790 INFO L435 NwaCegarLoop]: 475 mSDtfsCounter, 2375 mSDsluCounter, 3174 mSDsCounter, 0 mSdLazyCounter, 1981 mSolverCounterSat, 1010 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2387 SdHoareTripleChecker+Valid, 3649 SdHoareTripleChecker+Invalid, 2991 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1010 IncrementalHoareTripleChecker+Valid, 1981 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-01-09 14:45:29,790 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2387 Valid, 3649 Invalid, 2991 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1010 Valid, 1981 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-01-09 14:45:29,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2025-01-09 14:45:29,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 540. [2025-01-09 14:45:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 540 states, 332 states have (on average 1.2379518072289157) internal successors, (411), 332 states have internal predecessors, (411), 180 states have call successors, (180), 27 states have call predecessors, (180), 27 states have return successors, (180), 180 states have call predecessors, (180), 180 states have call successors, (180) [2025-01-09 14:45:29,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 540 states to 540 states and 771 transitions. [2025-01-09 14:45:29,919 INFO L78 Accepts]: Start accepts. Automaton has 540 states and 771 transitions. Word has length 593 [2025-01-09 14:45:29,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 14:45:29,920 INFO L471 AbstractCegarLoop]: Abstraction has 540 states and 771 transitions. [2025-01-09 14:45:29,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 19.571428571428573) internal successors, (411), 22 states have internal predecessors, (411), 9 states have call successors, (256), 4 states have call predecessors, (256), 9 states have return successors, (257), 8 states have call predecessors, (257), 9 states have call successors, (257) [2025-01-09 14:45:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 771 transitions. [2025-01-09 14:45:29,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2025-01-09 14:45:29,928 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 14:45:29,928 INFO L218 NwaCegarLoop]: trace histogram [90, 90, 90, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45:29,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 14:45:30,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:30,129 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 14:45:30,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 14:45:30,130 INFO L85 PathProgramCache]: Analyzing trace with hash 1834082858, now seen corresponding path program 1 times [2025-01-09 14:45:30,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 14:45:30,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909127560] [2025-01-09 14:45:30,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:30,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 14:45:30,168 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-09 14:45:31,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-09 14:45:31,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:31,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:57,738 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 1224 proven. 744 refuted. 0 times theorem prover too weak. 14052 trivial. 0 not checked. [2025-01-09 14:45:57,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 14:45:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909127560] [2025-01-09 14:45:57,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909127560] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 14:45:57,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [992101697] [2025-01-09 14:45:57,739 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 14:45:57,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 14:45:57,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 14:45:57,741 INFO L229 MonitoredProcess]: Starting monitored process 7 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:45:57,742 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 14:45:57,916 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 593 statements into 1 equivalence classes. [2025-01-09 14:45:58,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 593 of 593 statements. [2025-01-09 14:45:58,114 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 14:45:58,114 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 14:45:58,121 INFO L256 TraceCheckSpWp]: Trace formula consists of 1396 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 14:45:58,128 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 14:46:00,369 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 4690 proven. 888 refuted. 0 times theorem prover too weak. 10442 trivial. 0 not checked. [2025-01-09 14:46:00,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 14:46:01,759 INFO L134 CoverageAnalysis]: Checked inductivity of 16020 backedges. 144 proven. 906 refuted. 0 times theorem prover too weak. 14970 trivial. 0 not checked. [2025-01-09 14:46:01,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [992101697] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 14:46:01,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 14:46:01,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 19, 19] total 59 [2025-01-09 14:46:01,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [383110843] [2025-01-09 14:46:01,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 14:46:01,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2025-01-09 14:46:01,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 14:46:01,764 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2025-01-09 14:46:01,765 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=338, Invalid=3084, Unknown=0, NotChecked=0, Total=3422 [2025-01-09 14:46:01,765 INFO L87 Difference]: Start difference. First operand 540 states and 771 transitions. Second operand has 59 states, 53 states have (on average 7.150943396226415) internal successors, (379), 54 states have internal predecessors, (379), 24 states have call successors, (259), 5 states have call predecessors, (259), 11 states have return successors, (260), 20 states have call predecessors, (260), 24 states have call successors, (260)