./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-19.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-19.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 a3c9443ab2a9a0ac9f8b1a4dfc6a8acea9c43b5adb9d9f2e6268045e7c9cd431 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:37:35,238 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:37:35,313 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:37:35,318 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:37:35,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:37:35,351 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:37:35,352 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:37:35,353 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:37:35,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:37:35,353 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:37:35,354 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:37:35,354 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:37:35,355 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:37:35,355 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:37:35,355 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:37:35,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:37:35,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:37:35,355 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:37:35,355 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:37:35,355 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:37:35,355 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:37:35,355 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:37:35,355 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:37:35,355 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:37:35,355 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:37:35,356 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:37:35,356 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:37:35,356 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:37:35,356 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:37:35,356 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:37:35,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:37:35,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:37:35,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:37:35,357 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:37:35,357 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:37:35,357 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:37:35,357 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:37:35,357 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:37:35,358 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:37:35,358 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:37:35,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:37:35,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:37:35,358 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:37:35,358 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 -> a3c9443ab2a9a0ac9f8b1a4dfc6a8acea9c43b5adb9d9f2e6268045e7c9cd431 [2025-02-06 02:37:35,622 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:37:35,630 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:37:35,632 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:37:35,633 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:37:35,634 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:37:35,635 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-19.i [2025-02-06 02:37:36,893 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99580c636/38e5540a10bd4a0da51095cc26208f89/FLAG71666d75c [2025-02-06 02:37:37,252 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:37:37,253 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-19.i [2025-02-06 02:37:37,278 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99580c636/38e5540a10bd4a0da51095cc26208f89/FLAG71666d75c [2025-02-06 02:37:37,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/99580c636/38e5540a10bd4a0da51095cc26208f89 [2025-02-06 02:37:37,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:37:37,301 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:37:37,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:37:37,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:37:37,307 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:37:37,308 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:37,310 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3db9e090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37, skipping insertion in model container [2025-02-06 02:37:37,310 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:37,355 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:37:37,500 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-19.i[916,929] [2025-02-06 02:37:37,719 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:37:37,740 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:37:37,747 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-19.i[916,929] [2025-02-06 02:37:37,854 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:37:37,880 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:37:37,880 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37 WrapperNode [2025-02-06 02:37:37,881 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:37:37,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:37:37,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:37:37,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:37:37,889 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:37,909 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:38,014 INFO L138 Inliner]: procedures = 26, calls = 72, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 709 [2025-02-06 02:37:38,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:37:38,015 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:37:38,015 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:37:38,015 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:37:38,025 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:38,025 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:38,048 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:38,159 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:37:38,160 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:38,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:38,200 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:38,218 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:38,236 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:38,244 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:38,266 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:37:38,267 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:37:38,267 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:37:38,267 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:37:38,268 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (1/1) ... [2025-02-06 02:37:38,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:37:38,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:37:38,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:37:38,311 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:37:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:37:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:37:38,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:37:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:37:38,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:37:38,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:37:38,490 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:37:38,492 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:37:39,621 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L651: havoc property_#t~ite46#1;havoc property_#t~bitwise45#1;havoc property_#t~short47#1;havoc property_#t~ite50#1;havoc property_#t~ite49#1;havoc property_#t~bitwise48#1;havoc property_#t~short51#1;havoc property_#t~ite55#1;havoc property_#t~ite54#1;havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short56#1;havoc property_#t~ite60#1;havoc property_#t~ite59#1;havoc property_#t~ite58#1;havoc property_#t~bitwise57#1;havoc property_#t~short61#1; [2025-02-06 02:37:39,773 INFO L? ?]: Removed 86 outVars from TransFormulas that were not future-live. [2025-02-06 02:37:39,773 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:37:39,809 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:37:39,809 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:37:39,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:39 BoogieIcfgContainer [2025-02-06 02:37:39,810 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:37:39,811 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:37:39,811 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:37:39,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:37:39,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:37:37" (1/3) ... [2025-02-06 02:37:39,817 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c06a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:37:39, skipping insertion in model container [2025-02-06 02:37:39,817 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:37:37" (2/3) ... [2025-02-06 02:37:39,818 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21c06a26 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:37:39, skipping insertion in model container [2025-02-06 02:37:39,818 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:37:39" (3/3) ... [2025-02-06 02:37:39,820 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-19.i [2025-02-06 02:37:39,834 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:37:39,838 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-19.i that has 2 procedures, 283 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:37:39,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:37:39,924 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;@6e2c7364, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:37:39,925 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:37:39,932 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 221 states have (on average 1.5746606334841629) internal successors, (348), 222 states have internal predecessors, (348), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 02:37:39,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-02-06 02:37:39,959 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:39,960 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:39,960 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:39,965 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:39,966 INFO L85 PathProgramCache]: Analyzing trace with hash 479322588, now seen corresponding path program 1 times [2025-02-06 02:37:39,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:39,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171781205] [2025-02-06 02:37:39,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:39,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:40,130 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-02-06 02:37:40,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-02-06 02:37:40,336 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:40,336 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:41,186 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-06 02:37:41,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:41,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171781205] [2025-02-06 02:37:41,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171781205] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:41,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:41,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:37:41,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733146646] [2025-02-06 02:37:41,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:41,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:37:41,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:41,221 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:37:41,222 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:41,226 INFO L87 Difference]: Start difference. First operand has 283 states, 221 states have (on average 1.5746606334841629) internal successors, (348), 222 states have internal predecessors, (348), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:37:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:41,411 INFO L93 Difference]: Finished difference Result 598 states and 1053 transitions. [2025-02-06 02:37:41,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:37:41,414 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 422 [2025-02-06 02:37:41,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:41,431 INFO L225 Difference]: With dead ends: 598 [2025-02-06 02:37:41,431 INFO L226 Difference]: Without dead ends: 318 [2025-02-06 02:37:41,440 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:41,443 INFO L435 NwaCegarLoop]: 451 mSDtfsCounter, 71 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 886 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:41,443 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 886 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:37:41,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2025-02-06 02:37:41,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 280. [2025-02-06 02:37:41,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 219 states have (on average 1.5616438356164384) internal successors, (342), 219 states have internal predecessors, (342), 59 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 59 states have call predecessors, (59), 59 states have call successors, (59) [2025-02-06 02:37:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 460 transitions. [2025-02-06 02:37:41,543 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 460 transitions. Word has length 422 [2025-02-06 02:37:41,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:41,547 INFO L471 AbstractCegarLoop]: Abstraction has 280 states and 460 transitions. [2025-02-06 02:37:41,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:37:41,547 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 460 transitions. [2025-02-06 02:37:41,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 423 [2025-02-06 02:37:41,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:41,563 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:41,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-06 02:37:41,564 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:41,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:41,566 INFO L85 PathProgramCache]: Analyzing trace with hash 741611839, now seen corresponding path program 1 times [2025-02-06 02:37:41,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:41,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [472217175] [2025-02-06 02:37:41,566 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:41,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:41,629 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 422 statements into 1 equivalence classes. [2025-02-06 02:37:41,847 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 422 of 422 statements. [2025-02-06 02:37:41,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:41,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:43,228 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-06 02:37:43,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:43,230 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [472217175] [2025-02-06 02:37:43,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [472217175] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:43,231 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:43,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:43,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43435426] [2025-02-06 02:37:43,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:43,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:43,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:43,236 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:43,236 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:43,237 INFO L87 Difference]: Start difference. First operand 280 states and 460 transitions. Second operand has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:37:43,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:43,636 INFO L93 Difference]: Finished difference Result 874 states and 1439 transitions. [2025-02-06 02:37:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:43,637 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 422 [2025-02-06 02:37:43,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:43,644 INFO L225 Difference]: With dead ends: 874 [2025-02-06 02:37:43,644 INFO L226 Difference]: Without dead ends: 597 [2025-02-06 02:37:43,645 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:43,647 INFO L435 NwaCegarLoop]: 478 mSDtfsCounter, 477 mSDsluCounter, 873 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 477 SdHoareTripleChecker+Valid, 1351 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:43,647 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [477 Valid, 1351 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:37:43,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2025-02-06 02:37:43,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 565. [2025-02-06 02:37:43,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 565 states, 493 states have (on average 1.6206896551724137) internal successors, (799), 494 states have internal predecessors, (799), 69 states have call successors, (69), 2 states have call predecessors, (69), 2 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 02:37:43,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 565 states to 565 states and 937 transitions. [2025-02-06 02:37:43,715 INFO L78 Accepts]: Start accepts. Automaton has 565 states and 937 transitions. Word has length 422 [2025-02-06 02:37:43,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:43,718 INFO L471 AbstractCegarLoop]: Abstraction has 565 states and 937 transitions. [2025-02-06 02:37:43,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.5) internal successors, (130), 4 states have internal predecessors, (130), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:37:43,718 INFO L276 IsEmpty]: Start isEmpty. Operand 565 states and 937 transitions. [2025-02-06 02:37:43,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-02-06 02:37:43,727 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:43,727 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:43,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:37:43,728 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:43,732 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:43,735 INFO L85 PathProgramCache]: Analyzing trace with hash -2071342426, now seen corresponding path program 1 times [2025-02-06 02:37:43,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:43,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273819667] [2025-02-06 02:37:43,736 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:43,736 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:43,783 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-06 02:37:43,810 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-06 02:37:43,811 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:43,811 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:44,078 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-06 02:37:44,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:44,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273819667] [2025-02-06 02:37:44,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273819667] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:44,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:44,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:37:44,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166325744] [2025-02-06 02:37:44,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:44,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:37:44,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:44,081 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:37:44,081 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:44,081 INFO L87 Difference]: Start difference. First operand 565 states and 937 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:37:44,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:44,237 INFO L93 Difference]: Finished difference Result 1441 states and 2387 transitions. [2025-02-06 02:37:44,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:37:44,238 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 423 [2025-02-06 02:37:44,239 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:44,245 INFO L225 Difference]: With dead ends: 1441 [2025-02-06 02:37:44,247 INFO L226 Difference]: Without dead ends: 879 [2025-02-06 02:37:44,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:37:44,249 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 226 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 1031 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:44,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 1031 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:37:44,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2025-02-06 02:37:44,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 794. [2025-02-06 02:37:44,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 794 states, 722 states have (on average 1.6357340720221607) internal successors, (1181), 723 states have internal predecessors, (1181), 69 states have call successors, (69), 2 states have call predecessors, (69), 2 states have return successors, (69), 68 states have call predecessors, (69), 69 states have call successors, (69) [2025-02-06 02:37:44,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 794 states to 794 states and 1319 transitions. [2025-02-06 02:37:44,310 INFO L78 Accepts]: Start accepts. Automaton has 794 states and 1319 transitions. Word has length 423 [2025-02-06 02:37:44,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:44,310 INFO L471 AbstractCegarLoop]: Abstraction has 794 states and 1319 transitions. [2025-02-06 02:37:44,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:37:44,311 INFO L276 IsEmpty]: Start isEmpty. Operand 794 states and 1319 transitions. [2025-02-06 02:37:44,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-02-06 02:37:44,317 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:44,317 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:44,317 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:37:44,317 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:44,318 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:44,318 INFO L85 PathProgramCache]: Analyzing trace with hash -1573924861, now seen corresponding path program 1 times [2025-02-06 02:37:44,318 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:44,318 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103079103] [2025-02-06 02:37:44,318 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:44,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:44,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-06 02:37:44,852 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-06 02:37:44,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:44,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:45,655 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-06 02:37:45,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:45,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103079103] [2025-02-06 02:37:45,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103079103] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:45,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:45,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:45,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536058576] [2025-02-06 02:37:45,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:45,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:45,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:45,659 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:45,659 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:45,660 INFO L87 Difference]: Start difference. First operand 794 states and 1319 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:37:46,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:46,052 INFO L93 Difference]: Finished difference Result 2559 states and 4226 transitions. [2025-02-06 02:37:46,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:37:46,052 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 423 [2025-02-06 02:37:46,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:46,064 INFO L225 Difference]: With dead ends: 2559 [2025-02-06 02:37:46,064 INFO L226 Difference]: Without dead ends: 1768 [2025-02-06 02:37:46,066 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:46,067 INFO L435 NwaCegarLoop]: 874 mSDtfsCounter, 561 mSDsluCounter, 1024 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 561 SdHoareTripleChecker+Valid, 1898 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:46,067 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [561 Valid, 1898 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:37:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1768 states. [2025-02-06 02:37:46,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1768 to 1522. [2025-02-06 02:37:46,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1522 states, 1398 states have (on average 1.6394849785407726) internal successors, (2292), 1401 states have internal predecessors, (2292), 119 states have call successors, (119), 4 states have call predecessors, (119), 4 states have return successors, (119), 116 states have call predecessors, (119), 119 states have call successors, (119) [2025-02-06 02:37:46,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1522 states to 1522 states and 2530 transitions. [2025-02-06 02:37:46,202 INFO L78 Accepts]: Start accepts. Automaton has 1522 states and 2530 transitions. Word has length 423 [2025-02-06 02:37:46,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:46,205 INFO L471 AbstractCegarLoop]: Abstraction has 1522 states and 2530 transitions. [2025-02-06 02:37:46,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:37:46,206 INFO L276 IsEmpty]: Start isEmpty. Operand 1522 states and 2530 transitions. [2025-02-06 02:37:46,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-02-06 02:37:46,216 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:46,216 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:46,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:37:46,217 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:46,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:46,219 INFO L85 PathProgramCache]: Analyzing trace with hash 207575074, now seen corresponding path program 1 times [2025-02-06 02:37:46,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:46,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597297568] [2025-02-06 02:37:46,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:46,219 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:46,266 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-06 02:37:47,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-06 02:37:47,135 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:47,136 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:48,947 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-06 02:37:48,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:48,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597297568] [2025-02-06 02:37:48,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597297568] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:48,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:48,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:37:48,948 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541970595] [2025-02-06 02:37:48,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:48,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:37:48,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:48,951 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:37:48,951 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:37:48,952 INFO L87 Difference]: Start difference. First operand 1522 states and 2530 transitions. Second operand has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:37:50,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:50,583 INFO L93 Difference]: Finished difference Result 7571 states and 12321 transitions. [2025-02-06 02:37:50,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:37:50,584 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 423 [2025-02-06 02:37:50,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:50,612 INFO L225 Difference]: With dead ends: 7571 [2025-02-06 02:37:50,613 INFO L226 Difference]: Without dead ends: 6052 [2025-02-06 02:37:50,619 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2025-02-06 02:37:50,620 INFO L435 NwaCegarLoop]: 464 mSDtfsCounter, 1422 mSDsluCounter, 2804 mSDsCounter, 0 mSdLazyCounter, 826 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1422 SdHoareTripleChecker+Valid, 3268 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 826 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:50,620 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1422 Valid, 3268 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 826 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2025-02-06 02:37:50,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6052 states. [2025-02-06 02:37:50,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6052 to 3064. [2025-02-06 02:37:50,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3064 states, 2928 states have (on average 1.6612021857923498) internal successors, (4864), 2935 states have internal predecessors, (4864), 127 states have call successors, (127), 8 states have call predecessors, (127), 8 states have return successors, (127), 120 states have call predecessors, (127), 127 states have call successors, (127) [2025-02-06 02:37:50,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3064 states to 3064 states and 5118 transitions. [2025-02-06 02:37:50,793 INFO L78 Accepts]: Start accepts. Automaton has 3064 states and 5118 transitions. Word has length 423 [2025-02-06 02:37:50,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:50,794 INFO L471 AbstractCegarLoop]: Abstraction has 3064 states and 5118 transitions. [2025-02-06 02:37:50,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 14.555555555555555) internal successors, (131), 9 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:37:50,794 INFO L276 IsEmpty]: Start isEmpty. Operand 3064 states and 5118 transitions. [2025-02-06 02:37:50,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-02-06 02:37:50,806 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:50,806 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:50,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:37:50,807 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:50,807 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:50,807 INFO L85 PathProgramCache]: Analyzing trace with hash -789497279, now seen corresponding path program 1 times [2025-02-06 02:37:50,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:50,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37123675] [2025-02-06 02:37:50,808 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:50,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:50,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-06 02:37:52,683 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-06 02:37:52,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:52,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:54,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-02-06 02:37:54,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:54,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37123675] [2025-02-06 02:37:54,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [37123675] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:37:54,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2025217969] [2025-02-06 02:37:54,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:54,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:37:54,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:37:54,140 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:37:54,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:37:54,355 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-06 02:37:54,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-06 02:37:54,546 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:54,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:54,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 1081 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:37:54,576 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:37:54,834 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 2074 proven. 30 refuted. 0 times theorem prover too weak. 4740 trivial. 0 not checked. [2025-02-06 02:37:54,834 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:37:55,229 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 144 proven. 30 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-02-06 02:37:55,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2025217969] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:37:55,230 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:37:55,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 5, 5] total 12 [2025-02-06 02:37:55,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1034559730] [2025-02-06 02:37:55,230 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:37:55,233 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:37:55,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:55,234 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:37:55,235 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=97, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:37:55,235 INFO L87 Difference]: Start difference. First operand 3064 states and 5118 transitions. Second operand has 12 states, 12 states have (on average 19.583333333333332) internal successors, (235), 12 states have internal predecessors, (235), 3 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 3 states have call predecessors, (127), 3 states have call successors, (127) [2025-02-06 02:37:56,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:56,929 INFO L93 Difference]: Finished difference Result 7025 states and 11664 transitions. [2025-02-06 02:37:56,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-02-06 02:37:56,931 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 19.583333333333332) internal successors, (235), 12 states have internal predecessors, (235), 3 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 3 states have call predecessors, (127), 3 states have call successors, (127) Word has length 423 [2025-02-06 02:37:56,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:56,952 INFO L225 Difference]: With dead ends: 7025 [2025-02-06 02:37:56,953 INFO L226 Difference]: Without dead ends: 3964 [2025-02-06 02:37:56,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 875 GetRequests, 847 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=209, Invalid=603, Unknown=0, NotChecked=0, Total=812 [2025-02-06 02:37:56,964 INFO L435 NwaCegarLoop]: 398 mSDtfsCounter, 2285 mSDsluCounter, 1853 mSDsCounter, 0 mSdLazyCounter, 1242 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2286 SdHoareTripleChecker+Valid, 2251 SdHoareTripleChecker+Invalid, 1499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:56,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2286 Valid, 2251 Invalid, 1499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1242 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 02:37:56,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3964 states. [2025-02-06 02:37:57,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3964 to 2912. [2025-02-06 02:37:57,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2912 states, 2771 states have (on average 1.6420064958498737) internal successors, (4550), 2778 states have internal predecessors, (4550), 127 states have call successors, (127), 13 states have call predecessors, (127), 13 states have return successors, (127), 120 states have call predecessors, (127), 127 states have call successors, (127) [2025-02-06 02:37:57,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2912 states to 2912 states and 4804 transitions. [2025-02-06 02:37:57,104 INFO L78 Accepts]: Start accepts. Automaton has 2912 states and 4804 transitions. Word has length 423 [2025-02-06 02:37:57,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:57,105 INFO L471 AbstractCegarLoop]: Abstraction has 2912 states and 4804 transitions. [2025-02-06 02:37:57,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 19.583333333333332) internal successors, (235), 12 states have internal predecessors, (235), 3 states have call successors, (125), 2 states have call predecessors, (125), 4 states have return successors, (127), 3 states have call predecessors, (127), 3 states have call successors, (127) [2025-02-06 02:37:57,106 INFO L276 IsEmpty]: Start isEmpty. Operand 2912 states and 4804 transitions. [2025-02-06 02:37:57,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-02-06 02:37:57,117 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:57,117 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:57,130 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:37:57,322 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:37:57,323 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:57,323 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:57,323 INFO L85 PathProgramCache]: Analyzing trace with hash -655238334, now seen corresponding path program 1 times [2025-02-06 02:37:57,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:57,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531550440] [2025-02-06 02:37:57,324 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:57,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:57,367 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-06 02:37:57,650 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-06 02:37:57,650 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:57,650 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:58,177 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-06 02:37:58,178 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:58,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531550440] [2025-02-06 02:37:58,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531550440] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:58,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:58,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:37:58,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247408862] [2025-02-06 02:37:58,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:58,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:37:58,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:58,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:37:58,184 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:37:58,184 INFO L87 Difference]: Start difference. First operand 2912 states and 4804 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:37:58,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:37:58,616 INFO L93 Difference]: Finished difference Result 8698 states and 14332 transitions. [2025-02-06 02:37:58,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-06 02:37:58,617 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 423 [2025-02-06 02:37:58,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:37:58,648 INFO L225 Difference]: With dead ends: 8698 [2025-02-06 02:37:58,648 INFO L226 Difference]: Without dead ends: 5789 [2025-02-06 02:37:58,656 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:37:58,658 INFO L435 NwaCegarLoop]: 857 mSDtfsCounter, 715 mSDsluCounter, 1445 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 715 SdHoareTripleChecker+Valid, 2302 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:37:58,659 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [715 Valid, 2302 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:37:58,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5789 states. [2025-02-06 02:37:58,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5789 to 5787. [2025-02-06 02:37:58,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5787 states, 5504 states have (on average 1.6282703488372092) internal successors, (8962), 5518 states have internal predecessors, (8962), 254 states have call successors, (254), 28 states have call predecessors, (254), 28 states have return successors, (254), 240 states have call predecessors, (254), 254 states have call successors, (254) [2025-02-06 02:37:58,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5787 states to 5787 states and 9470 transitions. [2025-02-06 02:37:58,937 INFO L78 Accepts]: Start accepts. Automaton has 5787 states and 9470 transitions. Word has length 423 [2025-02-06 02:37:58,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:37:58,938 INFO L471 AbstractCegarLoop]: Abstraction has 5787 states and 9470 transitions. [2025-02-06 02:37:58,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:37:58,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5787 states and 9470 transitions. [2025-02-06 02:37:58,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-02-06 02:37:58,950 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:37:58,950 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:37:58,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:37:58,950 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:37:58,951 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:37:58,952 INFO L85 PathProgramCache]: Analyzing trace with hash 1562519619, now seen corresponding path program 1 times [2025-02-06 02:37:58,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:37:58,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210996810] [2025-02-06 02:37:58,952 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:37:58,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:37:59,003 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-06 02:37:59,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-06 02:37:59,374 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:37:59,374 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:37:59,891 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-06 02:37:59,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:37:59,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210996810] [2025-02-06 02:37:59,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210996810] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:37:59,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:37:59,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:37:59,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402877972] [2025-02-06 02:37:59,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:37:59,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:37:59,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:37:59,896 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:37:59,897 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:37:59,897 INFO L87 Difference]: Start difference. First operand 5787 states and 9470 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:38:00,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:00,446 INFO L93 Difference]: Finished difference Result 14476 states and 23474 transitions. [2025-02-06 02:38:00,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:00,448 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 423 [2025-02-06 02:38:00,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:00,495 INFO L225 Difference]: With dead ends: 14476 [2025-02-06 02:38:00,495 INFO L226 Difference]: Without dead ends: 8692 [2025-02-06 02:38:00,505 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:00,505 INFO L435 NwaCegarLoop]: 445 mSDtfsCounter, 450 mSDsluCounter, 658 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:00,506 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [450 Valid, 1103 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:38:00,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8692 states. [2025-02-06 02:38:00,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8692 to 8681. [2025-02-06 02:38:00,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8681 states, 8311 states have (on average 1.6052219949464566) internal successors, (13341), 8342 states have internal predecessors, (13341), 308 states have call successors, (308), 61 states have call predecessors, (308), 61 states have return successors, (308), 277 states have call predecessors, (308), 308 states have call successors, (308) [2025-02-06 02:38:00,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8681 states to 8681 states and 13957 transitions. [2025-02-06 02:38:00,839 INFO L78 Accepts]: Start accepts. Automaton has 8681 states and 13957 transitions. Word has length 423 [2025-02-06 02:38:00,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:00,841 INFO L471 AbstractCegarLoop]: Abstraction has 8681 states and 13957 transitions. [2025-02-06 02:38:00,842 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:38:00,842 INFO L276 IsEmpty]: Start isEmpty. Operand 8681 states and 13957 transitions. [2025-02-06 02:38:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2025-02-06 02:38:00,855 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:00,855 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:00,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:38:00,856 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:00,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:00,857 INFO L85 PathProgramCache]: Analyzing trace with hash 565447266, now seen corresponding path program 1 times [2025-02-06 02:38:00,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:00,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1183166938] [2025-02-06 02:38:00,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:00,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:00,900 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-06 02:38:01,707 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-06 02:38:01,707 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:01,707 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:02,207 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 33 proven. 141 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-02-06 02:38:02,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:02,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1183166938] [2025-02-06 02:38:02,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1183166938] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:02,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636732483] [2025-02-06 02:38:02,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:02,208 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:02,208 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:02,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:38:02,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:38:02,418 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 423 statements into 1 equivalence classes. [2025-02-06 02:38:02,594 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 423 of 423 statements. [2025-02-06 02:38:02,594 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:02,594 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:02,603 INFO L256 TraceCheckSpWp]: Trace formula consists of 1082 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-02-06 02:38:02,612 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:03,208 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 2148 proven. 141 refuted. 0 times theorem prover too weak. 4555 trivial. 0 not checked. [2025-02-06 02:38:03,208 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:38:03,674 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 33 proven. 141 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-02-06 02:38:03,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636732483] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:38:03,674 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:38:03,675 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-02-06 02:38:03,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343804129] [2025-02-06 02:38:03,675 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:38:03,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:38:03,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:03,678 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:38:03,678 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:38:03,678 INFO L87 Difference]: Start difference. First operand 8681 states and 13957 transitions. Second operand has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 2 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) [2025-02-06 02:38:04,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:04,231 INFO L93 Difference]: Finished difference Result 13745 states and 22030 transitions. [2025-02-06 02:38:04,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-06 02:38:04,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 2 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) Word has length 423 [2025-02-06 02:38:04,232 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:04,253 INFO L225 Difference]: With dead ends: 13745 [2025-02-06 02:38:04,253 INFO L226 Difference]: Without dead ends: 5081 [2025-02-06 02:38:04,268 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 853 GetRequests, 843 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:38:04,270 INFO L435 NwaCegarLoop]: 346 mSDtfsCounter, 537 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 917 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:04,271 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [547 Valid, 917 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:38:04,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5081 states. [2025-02-06 02:38:04,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5081 to 5045. [2025-02-06 02:38:04,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5045 states, 4767 states have (on average 1.590727921124397) internal successors, (7583), 4782 states have internal predecessors, (7583), 236 states have call successors, (236), 41 states have call predecessors, (236), 41 states have return successors, (236), 221 states have call predecessors, (236), 236 states have call successors, (236) [2025-02-06 02:38:04,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5045 states to 5045 states and 8055 transitions. [2025-02-06 02:38:04,487 INFO L78 Accepts]: Start accepts. Automaton has 5045 states and 8055 transitions. Word has length 423 [2025-02-06 02:38:04,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:04,488 INFO L471 AbstractCegarLoop]: Abstraction has 5045 states and 8055 transitions. [2025-02-06 02:38:04,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 20.0) internal successors, (140), 7 states have internal predecessors, (140), 2 states have call successors, (106), 2 states have call predecessors, (106), 4 states have return successors, (107), 2 states have call predecessors, (107), 2 states have call successors, (107) [2025-02-06 02:38:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 5045 states and 8055 transitions. [2025-02-06 02:38:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-02-06 02:38:04,497 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:04,497 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:04,509 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-06 02:38:04,702 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-02-06 02:38:04,703 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:04,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:04,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1910094906, now seen corresponding path program 1 times [2025-02-06 02:38:04,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:04,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247159288] [2025-02-06 02:38:04,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:04,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:04,741 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-02-06 02:38:05,015 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-02-06 02:38:05,015 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:05,015 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:05,707 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-06 02:38:05,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:05,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247159288] [2025-02-06 02:38:05,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247159288] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:05,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:05,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:05,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829697742] [2025-02-06 02:38:05,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:05,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:05,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:05,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:05,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:05,712 INFO L87 Difference]: Start difference. First operand 5045 states and 8055 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:38:06,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:06,142 INFO L93 Difference]: Finished difference Result 19583 states and 31300 transitions. [2025-02-06 02:38:06,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:06,143 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 424 [2025-02-06 02:38:06,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:06,239 INFO L225 Difference]: With dead ends: 19583 [2025-02-06 02:38:06,239 INFO L226 Difference]: Without dead ends: 14555 [2025-02-06 02:38:06,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:06,251 INFO L435 NwaCegarLoop]: 455 mSDtfsCounter, 782 mSDsluCounter, 657 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 782 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:06,251 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [782 Valid, 1112 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:38:06,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14555 states. [2025-02-06 02:38:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14555 to 11498. [2025-02-06 02:38:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11498 states, 11063 states have (on average 1.604176082436952) internal successors, (17747), 11098 states have internal predecessors, (17747), 350 states have call successors, (350), 84 states have call predecessors, (350), 84 states have return successors, (350), 315 states have call predecessors, (350), 350 states have call successors, (350) [2025-02-06 02:38:06,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11498 states to 11498 states and 18447 transitions. [2025-02-06 02:38:06,674 INFO L78 Accepts]: Start accepts. Automaton has 11498 states and 18447 transitions. Word has length 424 [2025-02-06 02:38:06,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:06,674 INFO L471 AbstractCegarLoop]: Abstraction has 11498 states and 18447 transitions. [2025-02-06 02:38:06,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:38:06,675 INFO L276 IsEmpty]: Start isEmpty. Operand 11498 states and 18447 transitions. [2025-02-06 02:38:06,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-02-06 02:38:06,693 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:06,693 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:06,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:38:06,693 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:06,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:06,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1080478661, now seen corresponding path program 1 times [2025-02-06 02:38:06,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:06,695 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146151909] [2025-02-06 02:38:06,695 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:06,695 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:06,733 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-02-06 02:38:06,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-02-06 02:38:06,885 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:06,885 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:07,315 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-06 02:38:07,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:07,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146151909] [2025-02-06 02:38:07,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146151909] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:07,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:07,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:07,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514282980] [2025-02-06 02:38:07,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:07,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:07,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:07,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:07,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:07,319 INFO L87 Difference]: Start difference. First operand 11498 states and 18447 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:38:08,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:08,272 INFO L93 Difference]: Finished difference Result 47490 states and 75799 transitions. [2025-02-06 02:38:08,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:38:08,273 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 424 [2025-02-06 02:38:08,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:08,389 INFO L225 Difference]: With dead ends: 47490 [2025-02-06 02:38:08,389 INFO L226 Difference]: Without dead ends: 36009 [2025-02-06 02:38:08,429 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:08,431 INFO L435 NwaCegarLoop]: 681 mSDtfsCounter, 1047 mSDsluCounter, 1422 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 2103 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:08,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 2103 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:38:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36009 states. [2025-02-06 02:38:09,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36009 to 21626. [2025-02-06 02:38:09,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21626 states, 20789 states have (on average 1.590985617393814) internal successors, (33075), 20854 states have internal predecessors, (33075), 676 states have call successors, (676), 160 states have call predecessors, (676), 160 states have return successors, (676), 611 states have call predecessors, (676), 676 states have call successors, (676) [2025-02-06 02:38:09,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21626 states to 21626 states and 34427 transitions. [2025-02-06 02:38:09,317 INFO L78 Accepts]: Start accepts. Automaton has 21626 states and 34427 transitions. Word has length 424 [2025-02-06 02:38:09,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:09,318 INFO L471 AbstractCegarLoop]: Abstraction has 21626 states and 34427 transitions. [2025-02-06 02:38:09,319 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:38:09,319 INFO L276 IsEmpty]: Start isEmpty. Operand 21626 states and 34427 transitions. [2025-02-06 02:38:09,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-02-06 02:38:09,349 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:09,349 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:09,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:38:09,350 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:09,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:09,351 INFO L85 PathProgramCache]: Analyzing trace with hash 1452565147, now seen corresponding path program 1 times [2025-02-06 02:38:09,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:09,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081502861] [2025-02-06 02:38:09,351 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:09,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:09,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-02-06 02:38:09,549 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-02-06 02:38:09,549 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:09,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:10,266 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-06 02:38:10,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:10,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081502861] [2025-02-06 02:38:10,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081502861] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:10,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:10,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:38:10,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043435193] [2025-02-06 02:38:10,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:10,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:38:10,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:10,271 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:38:10,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:38:10,272 INFO L87 Difference]: Start difference. First operand 21626 states and 34427 transitions. Second operand has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:38:11,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:11,057 INFO L93 Difference]: Finished difference Result 49222 states and 78105 transitions. [2025-02-06 02:38:11,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:38:11,058 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 424 [2025-02-06 02:38:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:11,144 INFO L225 Difference]: With dead ends: 49222 [2025-02-06 02:38:11,144 INFO L226 Difference]: Without dead ends: 27613 [2025-02-06 02:38:11,180 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:38:11,181 INFO L435 NwaCegarLoop]: 522 mSDtfsCounter, 213 mSDsluCounter, 928 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1450 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:11,181 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 1450 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:38:11,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27613 states. [2025-02-06 02:38:12,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27613 to 24858. [2025-02-06 02:38:12,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24858 states, 24021 states have (on average 1.5960617792764664) internal successors, (38339), 24086 states have internal predecessors, (38339), 676 states have call successors, (676), 160 states have call predecessors, (676), 160 states have return successors, (676), 611 states have call predecessors, (676), 676 states have call successors, (676) [2025-02-06 02:38:12,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24858 states to 24858 states and 39691 transitions. [2025-02-06 02:38:12,240 INFO L78 Accepts]: Start accepts. Automaton has 24858 states and 39691 transitions. Word has length 424 [2025-02-06 02:38:12,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:12,241 INFO L471 AbstractCegarLoop]: Abstraction has 24858 states and 39691 transitions. [2025-02-06 02:38:12,241 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.0) internal successors, (132), 4 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:38:12,241 INFO L276 IsEmpty]: Start isEmpty. Operand 24858 states and 39691 transitions. [2025-02-06 02:38:12,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-02-06 02:38:12,271 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:12,272 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:12,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:38:12,272 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:12,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:12,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1426419579, now seen corresponding path program 1 times [2025-02-06 02:38:12,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:12,273 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860334365] [2025-02-06 02:38:12,273 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:12,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:12,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-02-06 02:38:13,644 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-02-06 02:38:13,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:13,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 02:38:13,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1564475092] [2025-02-06 02:38:13,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:13,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:13,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:13,655 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:38:13,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-06 02:38:13,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-02-06 02:38:14,120 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-02-06 02:38:14,120 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:14,120 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:14,125 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-02-06 02:38:14,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:15,128 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6844 trivial. 0 not checked. [2025-02-06 02:38:15,128 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:38:15,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:15,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860334365] [2025-02-06 02:38:15,129 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-02-06 02:38:15,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1564475092] [2025-02-06 02:38:15,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1564475092] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:38:15,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:38:15,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:38:15,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161706583] [2025-02-06 02:38:15,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:38:15,130 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-06 02:38:15,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:15,133 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-06 02:38:15,133 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 02:38:15,133 INFO L87 Difference]: Start difference. First operand 24858 states and 39691 transitions. Second operand has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:38:17,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:38:17,057 INFO L93 Difference]: Finished difference Result 62057 states and 99301 transitions. [2025-02-06 02:38:17,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 02:38:17,057 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) Word has length 424 [2025-02-06 02:38:17,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:38:17,156 INFO L225 Difference]: With dead ends: 62057 [2025-02-06 02:38:17,156 INFO L226 Difference]: Without dead ends: 37216 [2025-02-06 02:38:17,193 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 428 GetRequests, 418 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=79, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:38:17,195 INFO L435 NwaCegarLoop]: 710 mSDtfsCounter, 994 mSDsluCounter, 1064 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 994 SdHoareTripleChecker+Valid, 1774 SdHoareTripleChecker+Invalid, 593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 143 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:38:17,195 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [994 Valid, 1774 Invalid, 593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [143 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:38:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37216 states. [2025-02-06 02:38:18,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37216 to 27399. [2025-02-06 02:38:18,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27399 states, 26528 states have (on average 1.6041917973462003) internal successors, (42556), 26588 states have internal predecessors, (42556), 711 states have call successors, (711), 159 states have call predecessors, (711), 159 states have return successors, (711), 651 states have call predecessors, (711), 711 states have call successors, (711) [2025-02-06 02:38:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27399 states to 27399 states and 43978 transitions. [2025-02-06 02:38:18,286 INFO L78 Accepts]: Start accepts. Automaton has 27399 states and 43978 transitions. Word has length 424 [2025-02-06 02:38:18,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:38:18,287 INFO L471 AbstractCegarLoop]: Abstraction has 27399 states and 43978 transitions. [2025-02-06 02:38:18,287 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 18.857142857142858) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (59), 1 states have call predecessors, (59), 1 states have return successors, (59), 1 states have call predecessors, (59), 1 states have call successors, (59) [2025-02-06 02:38:18,288 INFO L276 IsEmpty]: Start isEmpty. Operand 27399 states and 43978 transitions. [2025-02-06 02:38:18,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 425 [2025-02-06 02:38:18,310 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:38:18,311 INFO L218 NwaCegarLoop]: trace histogram [59, 59, 59, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:38:18,322 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-02-06 02:38:18,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:18,513 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:38:18,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:38:18,514 INFO L85 PathProgramCache]: Analyzing trace with hash 429347226, now seen corresponding path program 1 times [2025-02-06 02:38:18,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:38:18,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224140849] [2025-02-06 02:38:18,514 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:18,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:38:18,551 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-02-06 02:38:19,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-02-06 02:38:19,584 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:19,584 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:23,494 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 192 proven. 468 refuted. 0 times theorem prover too weak. 6184 trivial. 0 not checked. [2025-02-06 02:38:23,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:38:23,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224140849] [2025-02-06 02:38:23,494 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224140849] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:38:23,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1027322364] [2025-02-06 02:38:23,495 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:38:23,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:38:23,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:38:23,497 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:38:23,499 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-06 02:38:23,728 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 424 statements into 1 equivalence classes. [2025-02-06 02:38:23,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 424 of 424 statements. [2025-02-06 02:38:23,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:38:23,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:38:23,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 1087 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-06 02:38:23,990 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:38:28,268 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 3231 proven. 624 refuted. 0 times theorem prover too weak. 2989 trivial. 0 not checked. [2025-02-06 02:38:28,269 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:38:33,945 INFO L134 CoverageAnalysis]: Checked inductivity of 6844 backedges. 6 proven. 168 refuted. 0 times theorem prover too weak. 6670 trivial. 0 not checked. [2025-02-06 02:38:33,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1027322364] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:38:33,946 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:38:33,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 19, 11] total 37 [2025-02-06 02:38:33,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967609776] [2025-02-06 02:38:33,946 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:38:33,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-02-06 02:38:33,948 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:38:33,949 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-02-06 02:38:33,949 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=213, Invalid=1119, Unknown=0, NotChecked=0, Total=1332 [2025-02-06 02:38:33,950 INFO L87 Difference]: Start difference. First operand 27399 states and 43978 transitions. Second operand has 37 states, 37 states have (on average 10.135135135135135) internal successors, (375), 37 states have internal predecessors, (375), 12 states have call successors, (171), 6 states have call predecessors, (171), 10 states have return successors, (172), 12 states have call predecessors, (172), 12 states have call successors, (172)