./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-89.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_fillercode_fillercodesize_ps-cn-250_file-89.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 341cfc181a184dfd888895046689be86cf5a3b257f2774b185252ff7e72de492 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 09:48:31,614 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 09:48:31,668 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 09:48:31,672 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 09:48:31,673 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 09:48:31,691 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 09:48:31,692 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 09:48:31,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 09:48:31,692 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 09:48:31,692 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 09:48:31,692 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 09:48:31,692 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 09:48:31,693 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 09:48:31,693 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 09:48:31,693 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 09:48:31,693 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 09:48:31,693 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 09:48:31,693 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 09:48:31,693 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 09:48:31,693 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 09:48:31,694 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:31,694 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 09:48:31,694 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 09:48:31,695 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 09:48:31,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:31,695 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 09:48:31,695 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 09:48:31,695 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 09:48:31,695 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 09:48:31,695 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 09:48:31,695 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 09:48:31,695 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 09:48:31,695 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 09:48:31,695 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 09:48:31,695 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 09:48:31,695 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 -> 341cfc181a184dfd888895046689be86cf5a3b257f2774b185252ff7e72de492 [2025-01-09 09:48:31,921 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 09:48:31,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 09:48:31,929 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 09:48:31,931 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 09:48:31,932 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 09:48:31,933 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-89.i [2025-01-09 09:48:33,069 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56977465c/c8cafc7fd88f42faad9c93a531d32de3/FLAG6cc199411 [2025-01-09 09:48:33,302 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 09:48:33,302 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-89.i [2025-01-09 09:48:33,310 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56977465c/c8cafc7fd88f42faad9c93a531d32de3/FLAG6cc199411 [2025-01-09 09:48:33,320 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56977465c/c8cafc7fd88f42faad9c93a531d32de3 [2025-01-09 09:48:33,322 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 09:48:33,323 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 09:48:33,325 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 09:48:33,325 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 09:48:33,328 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 09:48:33,329 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,329 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a50f5d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33, skipping insertion in model container [2025-01-09 09:48:33,329 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,346 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 09:48:33,445 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_fillercode_fillercodesize_ps-cn-250_file-89.i[916,929] [2025-01-09 09:48:33,550 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:48:33,561 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 09:48:33,571 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_fillercode_fillercodesize_ps-cn-250_file-89.i[916,929] [2025-01-09 09:48:33,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 09:48:33,640 INFO L204 MainTranslator]: Completed translation [2025-01-09 09:48:33,641 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33 WrapperNode [2025-01-09 09:48:33,641 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 09:48:33,641 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 09:48:33,642 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 09:48:33,642 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 09:48:33,645 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,654 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,690 INFO L138 Inliner]: procedures = 26, calls = 74, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 457 [2025-01-09 09:48:33,690 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 09:48:33,691 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 09:48:33,691 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 09:48:33,691 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 09:48:33,700 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,722 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 09:48:33,722 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,723 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,739 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,741 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,744 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,748 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,752 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,758 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 09:48:33,759 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 09:48:33,759 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 09:48:33,759 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 09:48:33,760 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (1/1) ... [2025-01-09 09:48:33,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 09:48:33,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:33,783 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 09:48:33,785 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 09:48:33,802 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 09:48:33,803 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 09:48:33,803 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 09:48:33,803 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 09:48:33,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 09:48:33,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 09:48:33,886 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 09:48:33,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 09:48:34,507 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2025-01-09 09:48:34,507 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 09:48:34,518 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 09:48:34,520 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 09:48:34,521 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:34 BoogieIcfgContainer [2025-01-09 09:48:34,521 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 09:48:34,523 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 09:48:34,523 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 09:48:34,526 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 09:48:34,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 09:48:33" (1/3) ... [2025-01-09 09:48:34,527 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359751e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:34, skipping insertion in model container [2025-01-09 09:48:34,527 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 09:48:33" (2/3) ... [2025-01-09 09:48:34,528 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@359751e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 09:48:34, skipping insertion in model container [2025-01-09 09:48:34,528 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 09:48:34" (3/3) ... [2025-01-09 09:48:34,529 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-89.i [2025-01-09 09:48:34,538 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 09:48:34,540 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-89.i that has 2 procedures, 195 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 09:48:34,590 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 09:48:34,597 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;@4023b6ff, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 09:48:34,597 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 09:48:34,600 INFO L276 IsEmpty]: Start isEmpty. Operand has 195 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 132 states have internal predecessors, (206), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 09:48:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-01-09 09:48:34,622 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:34,622 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:34,623 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:34,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:34,627 INFO L85 PathProgramCache]: Analyzing trace with hash 311858472, now seen corresponding path program 1 times [2025-01-09 09:48:34,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:34,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130095420] [2025-01-09 09:48:34,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:34,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:34,723 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-01-09 09:48:34,756 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-01-09 09:48:34,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:34,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:35,057 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-01-09 09:48:35,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:35,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130095420] [2025-01-09 09:48:35,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130095420] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:35,058 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74572824] [2025-01-09 09:48:35,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:35,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:35,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:35,062 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 09:48:35,063 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 09:48:35,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-01-09 09:48:35,300 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-01-09 09:48:35,300 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:35,300 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:35,304 INFO L256 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 09:48:35,316 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:35,358 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 120 proven. 0 refuted. 0 times theorem prover too weak. 7200 trivial. 0 not checked. [2025-01-09 09:48:35,358 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 09:48:35,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74572824] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:35,358 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:48:35,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 09:48:35,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033715111] [2025-01-09 09:48:35,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:35,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 09:48:35,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:35,379 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 09:48:35,380 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 09:48:35,384 INFO L87 Difference]: Start difference. First operand has 195 states, 131 states have (on average 1.5725190839694656) internal successors, (206), 132 states have internal predecessors, (206), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) Second operand has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 09:48:35,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:35,421 INFO L93 Difference]: Finished difference Result 384 states and 712 transitions. [2025-01-09 09:48:35,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 09:48:35,423 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) Word has length 390 [2025-01-09 09:48:35,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:35,428 INFO L225 Difference]: With dead ends: 384 [2025-01-09 09:48:35,428 INFO L226 Difference]: Without dead ends: 192 [2025-01-09 09:48:35,432 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 391 GetRequests, 391 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 09:48:35,433 INFO L435 NwaCegarLoop]: 322 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, 322 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 09:48:35,434 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 322 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:35,443 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2025-01-09 09:48:35,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 192. [2025-01-09 09:48:35,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 129 states have (on average 1.550387596899225) internal successors, (200), 129 states have internal predecessors, (200), 61 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 61 states have call predecessors, (61), 61 states have call successors, (61) [2025-01-09 09:48:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 322 transitions. [2025-01-09 09:48:35,488 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 322 transitions. Word has length 390 [2025-01-09 09:48:35,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:35,489 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 322 transitions. [2025-01-09 09:48:35,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 45.0) internal successors, (90), 2 states have internal predecessors, (90), 2 states have call successors, (61), 2 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 09:48:35,489 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 322 transitions. [2025-01-09 09:48:35,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-01-09 09:48:35,498 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:35,498 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:35,505 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 09:48:35,703 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 09:48:35,703 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:35,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:35,704 INFO L85 PathProgramCache]: Analyzing trace with hash 523875498, now seen corresponding path program 1 times [2025-01-09 09:48:35,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:35,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1804958914] [2025-01-09 09:48:35,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:35,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:35,734 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-01-09 09:48:35,809 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-01-09 09:48:35,809 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:35,809 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:36,083 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 09:48:36,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:36,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1804958914] [2025-01-09 09:48:36,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1804958914] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:36,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:36,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:36,084 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209354164] [2025-01-09 09:48:36,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:36,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:36,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:36,087 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:36,087 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:36,087 INFO L87 Difference]: Start difference. First operand 192 states and 322 transitions. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 09:48:36,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:36,168 INFO L93 Difference]: Finished difference Result 494 states and 833 transitions. [2025-01-09 09:48:36,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:36,169 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 390 [2025-01-09 09:48:36,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:36,174 INFO L225 Difference]: With dead ends: 494 [2025-01-09 09:48:36,175 INFO L226 Difference]: Without dead ends: 305 [2025-01-09 09:48:36,176 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 09:48:36,177 INFO L435 NwaCegarLoop]: 352 mSDtfsCounter, 166 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:36,177 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 653 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:36,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2025-01-09 09:48:36,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 302. [2025-01-09 09:48:36,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 216 states have (on average 1.5833333333333333) internal successors, (342), 217 states have internal predecessors, (342), 83 states have call successors, (83), 2 states have call predecessors, (83), 2 states have return successors, (83), 82 states have call predecessors, (83), 83 states have call successors, (83) [2025-01-09 09:48:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 508 transitions. [2025-01-09 09:48:36,212 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 508 transitions. Word has length 390 [2025-01-09 09:48:36,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:36,213 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 508 transitions. [2025-01-09 09:48:36,214 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 09:48:36,214 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 508 transitions. [2025-01-09 09:48:36,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 391 [2025-01-09 09:48:36,217 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:36,217 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:36,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 09:48:36,218 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:36,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:36,218 INFO L85 PathProgramCache]: Analyzing trace with hash -73546134, now seen corresponding path program 1 times [2025-01-09 09:48:36,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:36,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299778086] [2025-01-09 09:48:36,218 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:36,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:36,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 390 statements into 1 equivalence classes. [2025-01-09 09:48:36,304 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 390 of 390 statements. [2025-01-09 09:48:36,304 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:36,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:36,656 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 09:48:36,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:36,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299778086] [2025-01-09 09:48:36,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299778086] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:36,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:36,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:36,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792445827] [2025-01-09 09:48:36,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:36,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:36,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:36,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:36,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:36,660 INFO L87 Difference]: Start difference. First operand 302 states and 508 transitions. Second operand has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 09:48:36,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:36,846 INFO L93 Difference]: Finished difference Result 1095 states and 1849 transitions. [2025-01-09 09:48:36,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-01-09 09:48:36,846 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 390 [2025-01-09 09:48:36,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:36,852 INFO L225 Difference]: With dead ends: 1095 [2025-01-09 09:48:36,853 INFO L226 Difference]: Without dead ends: 796 [2025-01-09 09:48:36,854 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 09:48:36,854 INFO L435 NwaCegarLoop]: 449 mSDtfsCounter, 381 mSDsluCounter, 692 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:36,854 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1141 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:48:36,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 796 states. [2025-01-09 09:48:36,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 796 to 789. [2025-01-09 09:48:36,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 588 states have (on average 1.6054421768707483) internal successors, (944), 592 states have internal predecessors, (944), 194 states have call successors, (194), 6 states have call predecessors, (194), 6 states have return successors, (194), 190 states have call predecessors, (194), 194 states have call successors, (194) [2025-01-09 09:48:36,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1332 transitions. [2025-01-09 09:48:36,920 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1332 transitions. Word has length 390 [2025-01-09 09:48:36,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:36,921 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1332 transitions. [2025-01-09 09:48:36,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.0) internal successors, (88), 4 states have internal predecessors, (88), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 09:48:36,921 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1332 transitions. [2025-01-09 09:48:36,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 392 [2025-01-09 09:48:36,924 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:36,924 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:36,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 09:48:36,924 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:36,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:36,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1246323175, now seen corresponding path program 1 times [2025-01-09 09:48:36,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:36,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1096358691] [2025-01-09 09:48:36,925 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:36,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:36,945 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 391 statements into 1 equivalence classes. [2025-01-09 09:48:36,977 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 391 of 391 statements. [2025-01-09 09:48:36,978 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:36,978 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:37,202 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 09:48:37,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:37,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1096358691] [2025-01-09 09:48:37,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1096358691] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:37,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:37,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:37,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694180111] [2025-01-09 09:48:37,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:37,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:37,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:37,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:37,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:37,206 INFO L87 Difference]: Start difference. First operand 789 states and 1332 transitions. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 09:48:37,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:37,276 INFO L93 Difference]: Finished difference Result 2361 states and 3990 transitions. [2025-01-09 09:48:37,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:37,277 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 391 [2025-01-09 09:48:37,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:37,289 INFO L225 Difference]: With dead ends: 2361 [2025-01-09 09:48:37,289 INFO L226 Difference]: Without dead ends: 1575 [2025-01-09 09:48:37,292 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 09:48:37,294 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 307 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 307 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:37,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [307 Valid, 845 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:37,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states. [2025-01-09 09:48:37,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 1573. [2025-01-09 09:48:37,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1573 states, 1172 states have (on average 1.6023890784982935) internal successors, (1878), 1180 states have internal predecessors, (1878), 388 states have call successors, (388), 12 states have call predecessors, (388), 12 states have return successors, (388), 380 states have call predecessors, (388), 388 states have call successors, (388) [2025-01-09 09:48:37,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1573 states to 1573 states and 2654 transitions. [2025-01-09 09:48:37,475 INFO L78 Accepts]: Start accepts. Automaton has 1573 states and 2654 transitions. Word has length 391 [2025-01-09 09:48:37,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:37,476 INFO L471 AbstractCegarLoop]: Abstraction has 1573 states and 2654 transitions. [2025-01-09 09:48:37,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 09:48:37,476 INFO L276 IsEmpty]: Start isEmpty. Operand 1573 states and 2654 transitions. [2025-01-09 09:48:37,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 09:48:37,479 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:37,479 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:37,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 09:48:37,479 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:37,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:37,480 INFO L85 PathProgramCache]: Analyzing trace with hash 1334758427, now seen corresponding path program 1 times [2025-01-09 09:48:37,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:37,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1902876912] [2025-01-09 09:48:37,480 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:37,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:37,500 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 09:48:37,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 09:48:37,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:37,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 09:48:37,831 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:37,831 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1902876912] [2025-01-09 09:48:37,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1902876912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:37,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:37,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:37,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555189829] [2025-01-09 09:48:37,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:37,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:37,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:37,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:37,834 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:37,834 INFO L87 Difference]: Start difference. First operand 1573 states and 2654 transitions. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 09:48:37,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:37,983 INFO L93 Difference]: Finished difference Result 4701 states and 7932 transitions. [2025-01-09 09:48:37,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:37,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 392 [2025-01-09 09:48:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:38,000 INFO L225 Difference]: With dead ends: 4701 [2025-01-09 09:48:38,000 INFO L226 Difference]: Without dead ends: 3131 [2025-01-09 09:48:38,005 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:38,005 INFO L435 NwaCegarLoop]: 318 mSDtfsCounter, 172 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:38,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 627 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 09:48:38,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3131 states. [2025-01-09 09:48:38,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3131 to 3105. [2025-01-09 09:48:38,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3105 states, 2304 states have (on average 1.5815972222222223) internal successors, (3644), 2320 states have internal predecessors, (3644), 776 states have call successors, (776), 24 states have call predecessors, (776), 24 states have return successors, (776), 760 states have call predecessors, (776), 776 states have call successors, (776) [2025-01-09 09:48:38,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3105 states to 3105 states and 5196 transitions. [2025-01-09 09:48:38,188 INFO L78 Accepts]: Start accepts. Automaton has 3105 states and 5196 transitions. Word has length 392 [2025-01-09 09:48:38,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:38,188 INFO L471 AbstractCegarLoop]: Abstraction has 3105 states and 5196 transitions. [2025-01-09 09:48:38,189 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 09:48:38,189 INFO L276 IsEmpty]: Start isEmpty. Operand 3105 states and 5196 transitions. [2025-01-09 09:48:38,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 09:48:38,194 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:38,195 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:38,195 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 09:48:38,195 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:38,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:38,196 INFO L85 PathProgramCache]: Analyzing trace with hash 1573026845, now seen corresponding path program 1 times [2025-01-09 09:48:38,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:38,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277316484] [2025-01-09 09:48:38,196 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:38,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:38,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 09:48:38,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 09:48:38,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:38,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:38,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 09:48:38,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:38,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277316484] [2025-01-09 09:48:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277316484] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:38,520 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 09:48:38,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088744028] [2025-01-09 09:48:38,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:38,522 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 09:48:38,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:38,522 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 09:48:38,522 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:48:38,523 INFO L87 Difference]: Start difference. First operand 3105 states and 5196 transitions. Second operand has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 09:48:38,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:38,784 INFO L93 Difference]: Finished difference Result 8661 states and 14518 transitions. [2025-01-09 09:48:38,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 09:48:38,785 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 392 [2025-01-09 09:48:38,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:38,815 INFO L225 Difference]: With dead ends: 8661 [2025-01-09 09:48:38,816 INFO L226 Difference]: Without dead ends: 5559 [2025-01-09 09:48:38,826 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 09:48:38,827 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 197 mSDsluCounter, 1044 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 1434 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:38,827 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 1434 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:48:38,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5559 states. [2025-01-09 09:48:39,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5559 to 5541. [2025-01-09 09:48:39,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5541 states, 4348 states have (on average 1.6126954921803127) internal successors, (7012), 4388 states have internal predecessors, (7012), 1144 states have call successors, (1144), 48 states have call predecessors, (1144), 48 states have return successors, (1144), 1104 states have call predecessors, (1144), 1144 states have call successors, (1144) [2025-01-09 09:48:39,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5541 states to 5541 states and 9300 transitions. [2025-01-09 09:48:39,142 INFO L78 Accepts]: Start accepts. Automaton has 5541 states and 9300 transitions. Word has length 392 [2025-01-09 09:48:39,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:39,144 INFO L471 AbstractCegarLoop]: Abstraction has 5541 states and 9300 transitions. [2025-01-09 09:48:39,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 18.0) internal successors, (90), 5 states have internal predecessors, (90), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 09:48:39,145 INFO L276 IsEmpty]: Start isEmpty. Operand 5541 states and 9300 transitions. [2025-01-09 09:48:39,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 393 [2025-01-09 09:48:39,150 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:39,151 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:39,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 09:48:39,151 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:39,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:39,151 INFO L85 PathProgramCache]: Analyzing trace with hash 1219938463, now seen corresponding path program 1 times [2025-01-09 09:48:39,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:39,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927250967] [2025-01-09 09:48:39,152 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:39,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:39,171 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 392 statements into 1 equivalence classes. [2025-01-09 09:48:39,268 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 392 of 392 statements. [2025-01-09 09:48:39,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:39,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:39,641 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 09:48:39,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:39,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927250967] [2025-01-09 09:48:39,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927250967] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:39,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:39,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 09:48:39,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774425121] [2025-01-09 09:48:39,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:39,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 09:48:39,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:39,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 09:48:39,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-01-09 09:48:39,643 INFO L87 Difference]: Start difference. First operand 5541 states and 9300 transitions. Second operand has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 09:48:40,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:40,041 INFO L93 Difference]: Finished difference Result 14218 states and 23850 transitions. [2025-01-09 09:48:40,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:40,041 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) Word has length 392 [2025-01-09 09:48:40,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:40,080 INFO L225 Difference]: With dead ends: 14218 [2025-01-09 09:48:40,081 INFO L226 Difference]: Without dead ends: 8680 [2025-01-09 09:48:40,097 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 09:48:40,098 INFO L435 NwaCegarLoop]: 448 mSDtfsCounter, 422 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 422 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:40,098 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [422 Valid, 739 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:48:40,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8680 states. [2025-01-09 09:48:40,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8680 to 8678. [2025-01-09 09:48:40,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8678 states, 6668 states have (on average 1.5980803839232154) internal successors, (10656), 6725 states have internal predecessors, (10656), 1936 states have call successors, (1936), 73 states have call predecessors, (1936), 73 states have return successors, (1936), 1879 states have call predecessors, (1936), 1936 states have call successors, (1936) [2025-01-09 09:48:40,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8678 states to 8678 states and 14528 transitions. [2025-01-09 09:48:40,624 INFO L78 Accepts]: Start accepts. Automaton has 8678 states and 14528 transitions. Word has length 392 [2025-01-09 09:48:40,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:40,624 INFO L471 AbstractCegarLoop]: Abstraction has 8678 states and 14528 transitions. [2025-01-09 09:48:40,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 22.5) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 2 states have call predecessors, (61), 2 states have call successors, (61) [2025-01-09 09:48:40,629 INFO L276 IsEmpty]: Start isEmpty. Operand 8678 states and 14528 transitions. [2025-01-09 09:48:40,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-09 09:48:40,634 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:40,635 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:40,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 09:48:40,635 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:40,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:40,635 INFO L85 PathProgramCache]: Analyzing trace with hash -12712297, now seen corresponding path program 1 times [2025-01-09 09:48:40,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:40,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987948154] [2025-01-09 09:48:40,635 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:40,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:40,657 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-09 09:48:40,672 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-09 09:48:40,673 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:40,673 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:40,754 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7320 trivial. 0 not checked. [2025-01-09 09:48:40,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:40,755 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987948154] [2025-01-09 09:48:40,755 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987948154] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 09:48:40,755 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 09:48:40,755 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 09:48:40,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806833916] [2025-01-09 09:48:40,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 09:48:40,756 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 09:48:40,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:40,759 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 09:48:40,759 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 09:48:40,759 INFO L87 Difference]: Start difference. First operand 8678 states and 14528 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 09:48:41,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:41,296 INFO L93 Difference]: Finished difference Result 22014 states and 36901 transitions. [2025-01-09 09:48:41,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 09:48:41,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) Word has length 393 [2025-01-09 09:48:41,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:41,371 INFO L225 Difference]: With dead ends: 22014 [2025-01-09 09:48:41,371 INFO L226 Difference]: Without dead ends: 13368 [2025-01-09 09:48:41,399 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 09:48:41,400 INFO L435 NwaCegarLoop]: 434 mSDtfsCounter, 184 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:41,400 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 717 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 09:48:41,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13368 states. [2025-01-09 09:48:41,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13368 to 11026. [2025-01-09 09:48:41,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11026 states, 8655 states have (on average 1.6072790294627384) internal successors, (13911), 8736 states have internal predecessors, (13911), 2272 states have call successors, (2272), 98 states have call predecessors, (2272), 98 states have return successors, (2272), 2191 states have call predecessors, (2272), 2272 states have call successors, (2272) [2025-01-09 09:48:41,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11026 states to 11026 states and 18455 transitions. [2025-01-09 09:48:41,967 INFO L78 Accepts]: Start accepts. Automaton has 11026 states and 18455 transitions. Word has length 393 [2025-01-09 09:48:41,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:41,968 INFO L471 AbstractCegarLoop]: Abstraction has 11026 states and 18455 transitions. [2025-01-09 09:48:41,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 1 states have call successors, (61), 1 states have call predecessors, (61), 1 states have return successors, (61), 1 states have call predecessors, (61), 1 states have call successors, (61) [2025-01-09 09:48:41,969 INFO L276 IsEmpty]: Start isEmpty. Operand 11026 states and 18455 transitions. [2025-01-09 09:48:41,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 394 [2025-01-09 09:48:41,976 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:41,976 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:41,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 09:48:41,977 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:41,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:41,978 INFO L85 PathProgramCache]: Analyzing trace with hash 49535008, now seen corresponding path program 1 times [2025-01-09 09:48:41,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:41,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681056023] [2025-01-09 09:48:41,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:41,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:41,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-09 09:48:42,112 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-09 09:48:42,112 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:42,112 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:42,327 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 114 proven. 66 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 09:48:42,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:42,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681056023] [2025-01-09 09:48:42,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681056023] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:42,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1237185153] [2025-01-09 09:48:42,328 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:42,328 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:42,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:42,330 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 09:48:42,332 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 09:48:42,429 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 393 statements into 1 equivalence classes. [2025-01-09 09:48:42,516 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 393 of 393 statements. [2025-01-09 09:48:42,516 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:42,516 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:42,519 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 09:48:42,527 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:43,376 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 3708 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-01-09 09:48:43,377 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:48:43,948 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 96 proven. 84 refuted. 0 times theorem prover too weak. 7140 trivial. 0 not checked. [2025-01-09 09:48:43,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1237185153] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 09:48:43,949 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 09:48:43,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 14 [2025-01-09 09:48:43,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675638505] [2025-01-09 09:48:43,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 09:48:43,950 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-01-09 09:48:43,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:43,950 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-01-09 09:48:43,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2025-01-09 09:48:43,951 INFO L87 Difference]: Start difference. First operand 11026 states and 18455 transitions. Second operand has 14 states, 14 states have (on average 15.857142857142858) internal successors, (222), 14 states have internal predecessors, (222), 5 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (151), 5 states have call predecessors, (151), 5 states have call successors, (151) [2025-01-09 09:48:45,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:45,718 INFO L93 Difference]: Finished difference Result 27943 states and 45733 transitions. [2025-01-09 09:48:45,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-01-09 09:48:45,718 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.857142857142858) internal successors, (222), 14 states have internal predecessors, (222), 5 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (151), 5 states have call predecessors, (151), 5 states have call successors, (151) Word has length 393 [2025-01-09 09:48:45,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:45,787 INFO L225 Difference]: With dead ends: 27943 [2025-01-09 09:48:45,787 INFO L226 Difference]: Without dead ends: 16953 [2025-01-09 09:48:45,823 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 809 GetRequests, 779 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=302, Invalid=690, Unknown=0, NotChecked=0, Total=992 [2025-01-09 09:48:45,824 INFO L435 NwaCegarLoop]: 301 mSDtfsCounter, 899 mSDsluCounter, 830 mSDsCounter, 0 mSdLazyCounter, 987 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 911 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 1404 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 987 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:45,824 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [911 Valid, 1131 Invalid, 1404 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 987 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 09:48:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16953 states. [2025-01-09 09:48:46,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16953 to 16528. [2025-01-09 09:48:46,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16528 states, 12436 states have (on average 1.495979414602766) internal successors, (18604), 12613 states have internal predecessors, (18604), 3862 states have call successors, (3862), 229 states have call predecessors, (3862), 229 states have return successors, (3862), 3685 states have call predecessors, (3862), 3862 states have call successors, (3862) [2025-01-09 09:48:46,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16528 states to 16528 states and 26328 transitions. [2025-01-09 09:48:46,815 INFO L78 Accepts]: Start accepts. Automaton has 16528 states and 26328 transitions. Word has length 393 [2025-01-09 09:48:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:46,816 INFO L471 AbstractCegarLoop]: Abstraction has 16528 states and 26328 transitions. [2025-01-09 09:48:46,816 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 15.857142857142858) internal successors, (222), 14 states have internal predecessors, (222), 5 states have call successors, (150), 3 states have call predecessors, (150), 6 states have return successors, (151), 5 states have call predecessors, (151), 5 states have call successors, (151) [2025-01-09 09:48:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 16528 states and 26328 transitions. [2025-01-09 09:48:46,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-01-09 09:48:46,825 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:46,825 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:46,833 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 09:48:47,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:47,026 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:47,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:47,026 INFO L85 PathProgramCache]: Analyzing trace with hash -474264325, now seen corresponding path program 1 times [2025-01-09 09:48:47,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:47,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346093351] [2025-01-09 09:48:47,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:47,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:47,042 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-01-09 09:48:47,188 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-01-09 09:48:47,189 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:47,189 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:48:47,193 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [807726269] [2025-01-09 09:48:47,193 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:47,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:47,193 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:47,195 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 09:48:47,197 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 09:48:47,286 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-01-09 09:48:47,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-01-09 09:48:47,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:47,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:47,379 INFO L256 TraceCheckSpWp]: Trace formula consists of 894 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 09:48:47,384 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:48:48,211 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 4354 proven. 384 refuted. 0 times theorem prover too weak. 2582 trivial. 0 not checked. [2025-01-09 09:48:48,212 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:48:48,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 09:48:48,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346093351] [2025-01-09 09:48:48,453 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 09:48:48,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [807726269] [2025-01-09 09:48:48,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [807726269] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 09:48:48,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 09:48:48,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2025-01-09 09:48:48,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2055823530] [2025-01-09 09:48:48,453 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 09:48:48,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 09:48:48,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 09:48:48,454 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 09:48:48,454 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-01-09 09:48:48,454 INFO L87 Difference]: Start difference. First operand 16528 states and 26328 transitions. Second operand has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-01-09 09:48:50,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 09:48:50,409 INFO L93 Difference]: Finished difference Result 46416 states and 72588 transitions. [2025-01-09 09:48:50,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-01-09 09:48:50,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) Word has length 395 [2025-01-09 09:48:50,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 09:48:50,535 INFO L225 Difference]: With dead ends: 46416 [2025-01-09 09:48:50,536 INFO L226 Difference]: Without dead ends: 29970 [2025-01-09 09:48:50,573 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 456 GetRequests, 439 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=106, Invalid=236, Unknown=0, NotChecked=0, Total=342 [2025-01-09 09:48:50,574 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 276 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 312 SdHoareTripleChecker+Valid, 977 SdHoareTripleChecker+Invalid, 856 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 09:48:50,574 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [312 Valid, 977 Invalid, 856 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 09:48:50,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29970 states. [2025-01-09 09:48:51,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29970 to 14680. [2025-01-09 09:48:51,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14680 states, 11386 states have (on average 1.5206393816968207) internal successors, (17314), 11515 states have internal predecessors, (17314), 3046 states have call successors, (3046), 247 states have call predecessors, (3046), 247 states have return successors, (3046), 2917 states have call predecessors, (3046), 3046 states have call successors, (3046) [2025-01-09 09:48:51,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14680 states to 14680 states and 23406 transitions. [2025-01-09 09:48:51,777 INFO L78 Accepts]: Start accepts. Automaton has 14680 states and 23406 transitions. Word has length 395 [2025-01-09 09:48:51,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 09:48:51,778 INFO L471 AbstractCegarLoop]: Abstraction has 14680 states and 23406 transitions. [2025-01-09 09:48:51,778 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.666666666666666) internal successors, (105), 9 states have internal predecessors, (105), 3 states have call successors, (61), 3 states have call predecessors, (61), 5 states have return successors, (61), 3 states have call predecessors, (61), 3 states have call successors, (61) [2025-01-09 09:48:51,778 INFO L276 IsEmpty]: Start isEmpty. Operand 14680 states and 23406 transitions. [2025-01-09 09:48:51,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 396 [2025-01-09 09:48:51,786 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 09:48:51,786 INFO L218 NwaCegarLoop]: trace histogram [61, 61, 61, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 09:48:51,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 09:48:51,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:51,990 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 09:48:51,991 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 09:48:51,991 INFO L85 PathProgramCache]: Analyzing trace with hash -199504711, now seen corresponding path program 1 times [2025-01-09 09:48:51,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 09:48:51,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [566543297] [2025-01-09 09:48:51,991 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:51,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 09:48:52,005 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-01-09 09:48:52,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-01-09 09:48:52,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:52,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 09:48:52,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [308369472] [2025-01-09 09:48:52,163 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 09:48:52,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 09:48:52,163 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 09:48:52,165 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 09:48:52,166 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 09:48:52,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 395 statements into 1 equivalence classes. [2025-01-09 09:48:52,480 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 395 of 395 statements. [2025-01-09 09:48:52,480 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 09:48:52,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 09:48:52,485 INFO L256 TraceCheckSpWp]: Trace formula consists of 892 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-01-09 09:48:52,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 09:49:13,019 WARN L286 SmtUtils]: Spent 8.26s on a formula simplification that was a NOOP. DAG size: 174 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 09:49:19,269 INFO L134 CoverageAnalysis]: Checked inductivity of 7320 backedges. 5036 proven. 663 refuted. 0 times theorem prover too weak. 1621 trivial. 0 not checked. [2025-01-09 09:49:19,270 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 09:49:45,350 WARN L286 SmtUtils]: Spent 5.37s on a formula simplification that was a NOOP. DAG size: 8 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 09:49:51,123 WARN L286 SmtUtils]: Spent 5.77s on a formula simplification that was a NOOP. DAG size: 3 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)