./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-88.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_loopvsstraightlinecode_100-while_file-88.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 0f173a1e127c6e1033e5b4dd17ed93bd9e595663c9235b403a3de8ffd3ad4687 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 01:05:42,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 01:05:42,176 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 01:05:42,183 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 01:05:42,183 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 01:05:42,202 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 01:05:42,203 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 01:05:42,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 01:05:42,204 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 01:05:42,204 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 01:05:42,205 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 01:05:42,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 01:05:42,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 01:05:42,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 01:05:42,205 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 01:05:42,205 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 01:05:42,206 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 01:05:42,206 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 01:05:42,206 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 01:05:42,206 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 01:05:42,206 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 01:05:42,206 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 01:05:42,206 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 01:05:42,206 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 01:05:42,207 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 01:05:42,207 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 01:05:42,207 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 01:05:42,207 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 01:05:42,207 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 01:05:42,207 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 01:05:42,207 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 01:05:42,208 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 01:05:42,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:05:42,208 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 01:05:42,208 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 01:05:42,208 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 01:05:42,208 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 01:05:42,208 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 01:05:42,208 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 01:05:42,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 01:05:42,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 01:05:42,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 01:05:42,208 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 01:05:42,209 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 -> 0f173a1e127c6e1033e5b4dd17ed93bd9e595663c9235b403a3de8ffd3ad4687 [2025-02-06 01:05:42,438 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 01:05:42,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 01:05:42,448 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 01:05:42,449 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 01:05:42,450 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 01:05:42,450 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-88.i [2025-02-06 01:05:43,653 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3440c178a/074dabdb26aa41c88ccc61305e00263e/FLAGfd55c5816 [2025-02-06 01:05:43,914 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 01:05:43,921 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-88.i [2025-02-06 01:05:43,928 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3440c178a/074dabdb26aa41c88ccc61305e00263e/FLAGfd55c5816 [2025-02-06 01:05:44,220 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3440c178a/074dabdb26aa41c88ccc61305e00263e [2025-02-06 01:05:44,222 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 01:05:44,223 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 01:05:44,227 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 01:05:44,227 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 01:05:44,235 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 01:05:44,235 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,236 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40363ecd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44, skipping insertion in model container [2025-02-06 01:05:44,237 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,262 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 01:05:44,365 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_loopvsstraightlinecode_100-while_file-88.i[916,929] [2025-02-06 01:05:44,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:05:44,452 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 01:05:44,464 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_loopvsstraightlinecode_100-while_file-88.i[916,929] [2025-02-06 01:05:44,501 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 01:05:44,512 INFO L204 MainTranslator]: Completed translation [2025-02-06 01:05:44,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44 WrapperNode [2025-02-06 01:05:44,512 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 01:05:44,513 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 01:05:44,513 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 01:05:44,514 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 01:05:44,519 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,567 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 278 [2025-02-06 01:05:44,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 01:05:44,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 01:05:44,568 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 01:05:44,568 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 01:05:44,578 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,578 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,581 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,591 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 01:05:44,591 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,598 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,600 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,601 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,603 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 01:05:44,604 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 01:05:44,604 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 01:05:44,605 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 01:05:44,605 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (1/1) ... [2025-02-06 01:05:44,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 01:05:44,620 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:05:44,631 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 01:05:44,640 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 01:05:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 01:05:44,654 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 01:05:44,654 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 01:05:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 01:05:44,655 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 01:05:44,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 01:05:44,728 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 01:05:44,729 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 01:05:45,091 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L204: havoc property_#t~ite24#1;havoc property_#t~bitwise23#1;havoc property_#t~short25#1;havoc property_#t~ite27#1;havoc property_#t~bitwise26#1;havoc property_#t~short28#1;havoc property_#t~bitwise29#1;havoc property_#t~short30#1; [2025-02-06 01:05:45,123 INFO L? ?]: Removed 40 outVars from TransFormulas that were not future-live. [2025-02-06 01:05:45,123 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 01:05:45,142 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 01:05:45,143 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 01:05:45,143 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:05:45 BoogieIcfgContainer [2025-02-06 01:05:45,143 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 01:05:45,145 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 01:05:45,145 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 01:05:45,148 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 01:05:45,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 01:05:44" (1/3) ... [2025-02-06 01:05:45,148 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4924cd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:05:45, skipping insertion in model container [2025-02-06 01:05:45,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 01:05:44" (2/3) ... [2025-02-06 01:05:45,149 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4924cd33 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 01:05:45, skipping insertion in model container [2025-02-06 01:05:45,149 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 01:05:45" (3/3) ... [2025-02-06 01:05:45,149 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-88.i [2025-02-06 01:05:45,158 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 01:05:45,159 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_loopvsstraightlinecode_100-while_file-88.i that has 2 procedures, 116 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 01:05:45,195 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 01:05:45,204 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;@5aa9b1e1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 01:05:45,204 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 01:05:45,208 INFO L276 IsEmpty]: Start isEmpty. Operand has 116 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 01:05:45,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 01:05:45,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:05:45,219 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:45,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:05:45,222 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:05:45,223 INFO L85 PathProgramCache]: Analyzing trace with hash -310363031, now seen corresponding path program 1 times [2025-02-06 01:05:45,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:05:45,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312672814] [2025-02-06 01:05:45,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:45,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:05:45,321 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 01:05:45,337 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 01:05:45,337 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:45,337 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 54 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-02-06 01:05:45,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:05:45,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312672814] [2025-02-06 01:05:45,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312672814] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:05:45,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965874290] [2025-02-06 01:05:45,485 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:45,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:05:45,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:05:45,487 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 01:05:45,489 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 01:05:45,569 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 01:05:45,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 01:05:45,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:45,643 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:45,645 INFO L256 TraceCheckSpWp]: Trace formula consists of 457 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 01:05:45,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:05:45,680 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 54 proven. 0 refuted. 0 times theorem prover too weak. 1458 trivial. 0 not checked. [2025-02-06 01:05:45,684 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:05:45,685 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965874290] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:05:45,685 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:05:45,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 01:05:45,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756915595] [2025-02-06 01:05:45,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:05:45,691 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 01:05:45,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:05:45,706 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 01:05:45,706 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:05:45,709 INFO L87 Difference]: Start difference. First operand has 116 states, 85 states have (on average 1.423529411764706) internal successors, (121), 86 states have internal predecessors, (121), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-06 01:05:45,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:05:45,743 INFO L93 Difference]: Finished difference Result 226 states and 377 transitions. [2025-02-06 01:05:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 01:05:45,745 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 191 [2025-02-06 01:05:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:05:45,749 INFO L225 Difference]: With dead ends: 226 [2025-02-06 01:05:45,749 INFO L226 Difference]: Without dead ends: 113 [2025-02-06 01:05:45,752 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 01:05:45,755 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 01:05:45,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 01:05:45,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2025-02-06 01:05:45,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2025-02-06 01:05:45,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 83 states have (on average 1.3975903614457832) internal successors, (116), 83 states have internal predecessors, (116), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2025-02-06 01:05:45,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 172 transitions. [2025-02-06 01:05:45,798 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 172 transitions. Word has length 191 [2025-02-06 01:05:45,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:05:45,799 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 172 transitions. [2025-02-06 01:05:45,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (28), 2 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2025-02-06 01:05:45,799 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 172 transitions. [2025-02-06 01:05:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2025-02-06 01:05:45,801 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:05:45,801 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:45,809 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 01:05:46,003 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 01:05:46,003 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:05:46,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:05:46,005 INFO L85 PathProgramCache]: Analyzing trace with hash -1606865627, now seen corresponding path program 1 times [2025-02-06 01:05:46,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:05:46,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116829866] [2025-02-06 01:05:46,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:46,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:05:46,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 191 statements into 1 equivalence classes. [2025-02-06 01:05:46,095 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 191 of 191 statements. [2025-02-06 01:05:46,095 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:46,095 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-06 01:05:46,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:05:46,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116829866] [2025-02-06 01:05:46,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116829866] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:05:46,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:05:46,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:05:46,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461485778] [2025-02-06 01:05:46,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:05:46,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:05:46,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:05:46,525 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:05:46,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:05:46,527 INFO L87 Difference]: Start difference. First operand 113 states and 172 transitions. Second operand has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:05:46,738 INFO L93 Difference]: Finished difference Result 373 states and 567 transitions. [2025-02-06 01:05:46,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 01:05:46,738 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 191 [2025-02-06 01:05:46,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:05:46,740 INFO L225 Difference]: With dead ends: 373 [2025-02-06 01:05:46,740 INFO L226 Difference]: Without dead ends: 263 [2025-02-06 01:05:46,741 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:05:46,743 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 250 mSDsluCounter, 308 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 250 SdHoareTripleChecker+Valid, 466 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:05:46,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [250 Valid, 466 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:05:46,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 263 states. [2025-02-06 01:05:46,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 263 to 217. [2025-02-06 01:05:46,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 217 states, 158 states have (on average 1.3734177215189873) internal successors, (217), 158 states have internal predecessors, (217), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2025-02-06 01:05:46,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 217 states to 217 states and 329 transitions. [2025-02-06 01:05:46,772 INFO L78 Accepts]: Start accepts. Automaton has 217 states and 329 transitions. Word has length 191 [2025-02-06 01:05:46,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:05:46,773 INFO L471 AbstractCegarLoop]: Abstraction has 217 states and 329 transitions. [2025-02-06 01:05:46,773 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.5) internal successors, (54), 4 states have internal predecessors, (54), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:46,773 INFO L276 IsEmpty]: Start isEmpty. Operand 217 states and 329 transitions. [2025-02-06 01:05:46,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 01:05:46,777 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:05:46,777 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:46,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 01:05:46,778 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:05:46,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:05:46,778 INFO L85 PathProgramCache]: Analyzing trace with hash -316429924, now seen corresponding path program 1 times [2025-02-06 01:05:46,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:05:46,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412239309] [2025-02-06 01:05:46,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:46,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:05:46,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 01:05:46,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 01:05:46,828 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:46,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:47,601 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-06 01:05:47,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:05:47,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412239309] [2025-02-06 01:05:47,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412239309] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:05:47,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:05:47,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 01:05:47,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1033665274] [2025-02-06 01:05:47,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:05:47,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 01:05:47,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:05:47,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 01:05:47,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:05:47,605 INFO L87 Difference]: Start difference. First operand 217 states and 329 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:48,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:05:48,454 INFO L93 Difference]: Finished difference Result 888 states and 1348 transitions. [2025-02-06 01:05:48,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 01:05:48,455 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-02-06 01:05:48,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:05:48,461 INFO L225 Difference]: With dead ends: 888 [2025-02-06 01:05:48,462 INFO L226 Difference]: Without dead ends: 674 [2025-02-06 01:05:48,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:05:48,463 INFO L435 NwaCegarLoop]: 242 mSDtfsCounter, 432 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 788 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-06 01:05:48,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 788 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-06 01:05:48,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2025-02-06 01:05:48,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 341. [2025-02-06 01:05:48,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 253 states have (on average 1.391304347826087) internal successors, (352), 253 states have internal predecessors, (352), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-06 01:05:48,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 520 transitions. [2025-02-06 01:05:48,536 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 520 transitions. Word has length 192 [2025-02-06 01:05:48,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:05:48,536 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 520 transitions. [2025-02-06 01:05:48,536 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:48,536 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 520 transitions. [2025-02-06 01:05:48,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 01:05:48,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:05:48,538 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:48,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 01:05:48,538 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:05:48,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:05:48,538 INFO L85 PathProgramCache]: Analyzing trace with hash 1191121885, now seen corresponding path program 1 times [2025-02-06 01:05:48,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:05:48,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270899698] [2025-02-06 01:05:48,539 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:48,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:05:48,553 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 01:05:48,597 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 01:05:48,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:48,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:48,866 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-06 01:05:48,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:05:48,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270899698] [2025-02-06 01:05:48,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270899698] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:05:48,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:05:48,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 01:05:48,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1827387799] [2025-02-06 01:05:48,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:05:48,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 01:05:48,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:05:48,868 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 01:05:48,869 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:05:48,869 INFO L87 Difference]: Start difference. First operand 341 states and 520 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:49,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:05:49,617 INFO L93 Difference]: Finished difference Result 1345 states and 2052 transitions. [2025-02-06 01:05:49,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 01:05:49,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-02-06 01:05:49,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:05:49,622 INFO L225 Difference]: With dead ends: 1345 [2025-02-06 01:05:49,622 INFO L226 Difference]: Without dead ends: 1007 [2025-02-06 01:05:49,623 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2025-02-06 01:05:49,623 INFO L435 NwaCegarLoop]: 246 mSDtfsCounter, 500 mSDsluCounter, 514 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 500 SdHoareTripleChecker+Valid, 760 SdHoareTripleChecker+Invalid, 605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 01:05:49,624 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [500 Valid, 760 Invalid, 605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 01:05:49,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1007 states. [2025-02-06 01:05:49,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1007 to 581. [2025-02-06 01:05:49,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 435 states have (on average 1.4) internal successors, (609), 435 states have internal predecessors, (609), 140 states have call successors, (140), 5 states have call predecessors, (140), 5 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-02-06 01:05:49,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 889 transitions. [2025-02-06 01:05:49,711 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 889 transitions. Word has length 192 [2025-02-06 01:05:49,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:05:49,711 INFO L471 AbstractCegarLoop]: Abstraction has 581 states and 889 transitions. [2025-02-06 01:05:49,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:49,711 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 889 transitions. [2025-02-06 01:05:49,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2025-02-06 01:05:49,713 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:05:49,713 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:49,713 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 01:05:49,713 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:05:49,714 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:05:49,714 INFO L85 PathProgramCache]: Analyzing trace with hash 979770972, now seen corresponding path program 1 times [2025-02-06 01:05:49,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:05:49,714 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293308520] [2025-02-06 01:05:49,714 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:49,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:05:49,727 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 192 statements into 1 equivalence classes. [2025-02-06 01:05:49,741 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 192 of 192 statements. [2025-02-06 01:05:49,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:49,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:49,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-06 01:05:49,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:05:49,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293308520] [2025-02-06 01:05:49,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293308520] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:05:49,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:05:49,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:05:49,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660480082] [2025-02-06 01:05:49,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:05:49,985 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:05:49,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:05:49,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:05:49,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:05:49,986 INFO L87 Difference]: Start difference. First operand 581 states and 889 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:50,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:05:50,370 INFO L93 Difference]: Finished difference Result 1202 states and 1838 transitions. [2025-02-06 01:05:50,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:05:50,370 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 192 [2025-02-06 01:05:50,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:05:50,373 INFO L225 Difference]: With dead ends: 1202 [2025-02-06 01:05:50,373 INFO L226 Difference]: Without dead ends: 624 [2025-02-06 01:05:50,375 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:05:50,375 INFO L435 NwaCegarLoop]: 158 mSDtfsCounter, 106 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:05:50,375 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 524 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:05:50,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 624 states. [2025-02-06 01:05:50,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 624 to 532. [2025-02-06 01:05:50,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 386 states have (on average 1.3860103626943006) internal successors, (535), 386 states have internal predecessors, (535), 140 states have call successors, (140), 5 states have call predecessors, (140), 5 states have return successors, (140), 140 states have call predecessors, (140), 140 states have call successors, (140) [2025-02-06 01:05:50,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 815 transitions. [2025-02-06 01:05:50,442 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 815 transitions. Word has length 192 [2025-02-06 01:05:50,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:05:50,443 INFO L471 AbstractCegarLoop]: Abstraction has 532 states and 815 transitions. [2025-02-06 01:05:50,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:50,443 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 815 transitions. [2025-02-06 01:05:50,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2025-02-06 01:05:50,444 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:05:50,444 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:50,445 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 01:05:50,445 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:05:50,445 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:05:50,445 INFO L85 PathProgramCache]: Analyzing trace with hash 154919042, now seen corresponding path program 1 times [2025-02-06 01:05:50,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:05:50,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603103216] [2025-02-06 01:05:50,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:50,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:05:50,461 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 193 statements into 1 equivalence classes. [2025-02-06 01:05:50,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 193 of 193 statements. [2025-02-06 01:05:50,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:50,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:50,648 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-06 01:05:50,649 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:05:50,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603103216] [2025-02-06 01:05:50,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1603103216] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:05:50,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:05:50,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 01:05:50,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373026444] [2025-02-06 01:05:50,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:05:50,650 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 01:05:50,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:05:50,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 01:05:50,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 01:05:50,650 INFO L87 Difference]: Start difference. First operand 532 states and 815 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:51,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:05:51,007 INFO L93 Difference]: Finished difference Result 1442 states and 2211 transitions. [2025-02-06 01:05:51,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:05:51,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 193 [2025-02-06 01:05:51,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:05:51,012 INFO L225 Difference]: With dead ends: 1442 [2025-02-06 01:05:51,012 INFO L226 Difference]: Without dead ends: 978 [2025-02-06 01:05:51,013 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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 01:05:51,014 INFO L435 NwaCegarLoop]: 195 mSDtfsCounter, 166 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 166 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:05:51,014 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [166 Valid, 445 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:05:51,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2025-02-06 01:05:51,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 976. [2025-02-06 01:05:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 714 states have (on average 1.376750700280112) internal successors, (983), 714 states have internal predecessors, (983), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-02-06 01:05:51,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1487 transitions. [2025-02-06 01:05:51,151 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1487 transitions. Word has length 193 [2025-02-06 01:05:51,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:05:51,151 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1487 transitions. [2025-02-06 01:05:51,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:51,152 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1487 transitions. [2025-02-06 01:05:51,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2025-02-06 01:05:51,153 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:05:51,153 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:51,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 01:05:51,153 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:05:51,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:05:51,154 INFO L85 PathProgramCache]: Analyzing trace with hash -745319271, now seen corresponding path program 1 times [2025-02-06 01:05:51,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:05:51,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770500722] [2025-02-06 01:05:51,154 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:51,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:05:51,167 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 194 statements into 1 equivalence classes. [2025-02-06 01:05:51,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 194 of 194 statements. [2025-02-06 01:05:51,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:51,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:51,276 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-06 01:05:51,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:05:51,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770500722] [2025-02-06 01:05:51,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770500722] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:05:51,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:05:51,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 01:05:51,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928040603] [2025-02-06 01:05:51,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:05:51,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 01:05:51,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:05:51,279 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 01:05:51,279 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:05:51,279 INFO L87 Difference]: Start difference. First operand 976 states and 1487 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:05:51,469 INFO L93 Difference]: Finished difference Result 1962 states and 2994 transitions. [2025-02-06 01:05:51,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 01:05:51,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 194 [2025-02-06 01:05:51,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:05:51,476 INFO L225 Difference]: With dead ends: 1962 [2025-02-06 01:05:51,476 INFO L226 Difference]: Without dead ends: 1056 [2025-02-06 01:05:51,478 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 01:05:51,478 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 19 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 01:05:51,478 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 286 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 01:05:51,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1056 states. [2025-02-06 01:05:51,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1056 to 976. [2025-02-06 01:05:51,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 714 states have (on average 1.3711484593837535) internal successors, (979), 714 states have internal predecessors, (979), 252 states have call successors, (252), 9 states have call predecessors, (252), 9 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-02-06 01:05:51,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1483 transitions. [2025-02-06 01:05:51,617 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1483 transitions. Word has length 194 [2025-02-06 01:05:51,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:05:51,618 INFO L471 AbstractCegarLoop]: Abstraction has 976 states and 1483 transitions. [2025-02-06 01:05:51,618 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:51,618 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1483 transitions. [2025-02-06 01:05:51,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-06 01:05:51,619 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:05:51,619 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:51,620 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 01:05:51,620 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:05:51,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:05:51,620 INFO L85 PathProgramCache]: Analyzing trace with hash 495733117, now seen corresponding path program 1 times [2025-02-06 01:05:51,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:05:51,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049055623] [2025-02-06 01:05:51,620 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:51,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:05:51,632 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 01:05:51,687 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 01:05:51,687 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:51,687 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:52,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-02-06 01:05:52,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:05:52,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049055623] [2025-02-06 01:05:52,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049055623] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:05:52,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [89844819] [2025-02-06 01:05:52,133 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:52,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:05:52,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:05:52,135 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 01:05:52,137 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 01:05:52,198 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 01:05:52,257 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 01:05:52,257 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:52,257 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:52,259 INFO L256 TraceCheckSpWp]: Trace formula consists of 465 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-06 01:05:52,263 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:05:52,339 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-06 01:05:52,339 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:05:52,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [89844819] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:05:52,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:05:52,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2025-02-06 01:05:52,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044437753] [2025-02-06 01:05:52,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:05:52,340 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:05:52,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:05:52,340 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:05:52,340 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2025-02-06 01:05:52,341 INFO L87 Difference]: Start difference. First operand 976 states and 1483 transitions. Second operand has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:52,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:05:52,788 INFO L93 Difference]: Finished difference Result 2604 states and 3962 transitions. [2025-02-06 01:05:52,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 01:05:52,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2025-02-06 01:05:52,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:05:52,797 INFO L225 Difference]: With dead ends: 2604 [2025-02-06 01:05:52,798 INFO L226 Difference]: Without dead ends: 1694 [2025-02-06 01:05:52,800 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 207 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2025-02-06 01:05:52,800 INFO L435 NwaCegarLoop]: 279 mSDtfsCounter, 272 mSDsluCounter, 661 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 272 SdHoareTripleChecker+Valid, 940 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 01:05:52,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [272 Valid, 940 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 01:05:52,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1694 states. [2025-02-06 01:05:52,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1694 to 1422. [2025-02-06 01:05:52,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1422 states, 1044 states have (on average 1.353448275862069) internal successors, (1413), 1044 states have internal predecessors, (1413), 364 states have call successors, (364), 13 states have call predecessors, (364), 13 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-02-06 01:05:53,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1422 states to 1422 states and 2141 transitions. [2025-02-06 01:05:53,003 INFO L78 Accepts]: Start accepts. Automaton has 1422 states and 2141 transitions. Word has length 195 [2025-02-06 01:05:53,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:05:53,003 INFO L471 AbstractCegarLoop]: Abstraction has 1422 states and 2141 transitions. [2025-02-06 01:05:53,004 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.6) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:53,004 INFO L276 IsEmpty]: Start isEmpty. Operand 1422 states and 2141 transitions. [2025-02-06 01:05:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2025-02-06 01:05:53,005 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:05:53,005 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:53,013 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 01:05:53,206 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:05:53,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:05:53,207 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:05:53,207 INFO L85 PathProgramCache]: Analyzing trace with hash 1051160101, now seen corresponding path program 1 times [2025-02-06 01:05:53,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:05:53,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924815867] [2025-02-06 01:05:53,207 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:53,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:05:53,221 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 195 statements into 1 equivalence classes. [2025-02-06 01:05:53,250 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 195 of 195 statements. [2025-02-06 01:05:53,251 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:53,251 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:53,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-06 01:05:53,703 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:05:53,703 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924815867] [2025-02-06 01:05:53,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924815867] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:05:53,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:05:53,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-06 01:05:53,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [733222662] [2025-02-06 01:05:53,704 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:05:53,704 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-06 01:05:53,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:05:53,705 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-06 01:05:53,705 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2025-02-06 01:05:53,705 INFO L87 Difference]: Start difference. First operand 1422 states and 2141 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:55,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:05:55,275 INFO L93 Difference]: Finished difference Result 2875 states and 4323 transitions. [2025-02-06 01:05:55,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-06 01:05:55,276 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 195 [2025-02-06 01:05:55,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:05:55,284 INFO L225 Difference]: With dead ends: 2875 [2025-02-06 01:05:55,284 INFO L226 Difference]: Without dead ends: 1523 [2025-02-06 01:05:55,287 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-02-06 01:05:55,288 INFO L435 NwaCegarLoop]: 256 mSDtfsCounter, 443 mSDsluCounter, 647 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 903 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:05:55,288 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 903 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 01:05:55,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1523 states. [2025-02-06 01:05:55,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1523 to 1423. [2025-02-06 01:05:55,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1423 states, 1045 states have (on average 1.35311004784689) internal successors, (1414), 1045 states have internal predecessors, (1414), 364 states have call successors, (364), 13 states have call predecessors, (364), 13 states have return successors, (364), 364 states have call predecessors, (364), 364 states have call successors, (364) [2025-02-06 01:05:55,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1423 states to 1423 states and 2142 transitions. [2025-02-06 01:05:55,432 INFO L78 Accepts]: Start accepts. Automaton has 1423 states and 2142 transitions. Word has length 195 [2025-02-06 01:05:55,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:05:55,432 INFO L471 AbstractCegarLoop]: Abstraction has 1423 states and 2142 transitions. [2025-02-06 01:05:55,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:55,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1423 states and 2142 transitions. [2025-02-06 01:05:55,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-06 01:05:55,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:05:55,434 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:55,434 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 01:05:55,434 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:05:55,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:05:55,435 INFO L85 PathProgramCache]: Analyzing trace with hash 1788711873, now seen corresponding path program 1 times [2025-02-06 01:05:55,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:05:55,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145730597] [2025-02-06 01:05:55,435 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:55,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:05:55,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 01:05:55,501 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 01:05:55,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:55,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 3 refuted. 0 times theorem prover too weak. 1356 trivial. 0 not checked. [2025-02-06 01:05:55,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:05:55,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145730597] [2025-02-06 01:05:55,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2145730597] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:05:55,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [794968902] [2025-02-06 01:05:55,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:55,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:05:55,916 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:05:55,917 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 01:05:55,922 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 01:05:55,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 01:05:56,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 01:05:56,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:56,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:56,029 INFO L256 TraceCheckSpWp]: Trace formula consists of 466 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-06 01:05:56,032 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:05:56,158 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 283 proven. 3 refuted. 0 times theorem prover too weak. 1226 trivial. 0 not checked. [2025-02-06 01:05:56,158 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:05:56,443 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 153 proven. 6 refuted. 0 times theorem prover too weak. 1353 trivial. 0 not checked. [2025-02-06 01:05:56,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [794968902] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 01:05:56,444 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 01:05:56,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 9] total 15 [2025-02-06 01:05:56,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398379225] [2025-02-06 01:05:56,445 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 01:05:56,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-02-06 01:05:56,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:05:56,446 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-02-06 01:05:56,446 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2025-02-06 01:05:56,447 INFO L87 Difference]: Start difference. First operand 1423 states and 2142 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-06 01:05:56,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:05:56,985 INFO L93 Difference]: Finished difference Result 2227 states and 3281 transitions. [2025-02-06 01:05:56,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 01:05:56,986 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 196 [2025-02-06 01:05:56,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:05:56,992 INFO L225 Difference]: With dead ends: 2227 [2025-02-06 01:05:56,992 INFO L226 Difference]: Without dead ends: 874 [2025-02-06 01:05:56,995 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 415 GetRequests, 387 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 147 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=242, Invalid=514, Unknown=0, NotChecked=0, Total=756 [2025-02-06 01:05:56,995 INFO L435 NwaCegarLoop]: 124 mSDtfsCounter, 409 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 409 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:05:56,995 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [409 Valid, 497 Invalid, 557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:05:56,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2025-02-06 01:05:57,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 820. [2025-02-06 01:05:57,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 820 states, 602 states have (on average 1.313953488372093) internal successors, (791), 602 states have internal predecessors, (791), 196 states have call successors, (196), 21 states have call predecessors, (196), 21 states have return successors, (196), 196 states have call predecessors, (196), 196 states have call successors, (196) [2025-02-06 01:05:57,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 820 states to 820 states and 1183 transitions. [2025-02-06 01:05:57,130 INFO L78 Accepts]: Start accepts. Automaton has 820 states and 1183 transitions. Word has length 196 [2025-02-06 01:05:57,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:05:57,130 INFO L471 AbstractCegarLoop]: Abstraction has 820 states and 1183 transitions. [2025-02-06 01:05:57,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 15 states have internal predecessors, (80), 2 states have call successors, (30), 2 states have call predecessors, (30), 6 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2025-02-06 01:05:57,131 INFO L276 IsEmpty]: Start isEmpty. Operand 820 states and 1183 transitions. [2025-02-06 01:05:57,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-06 01:05:57,132 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:05:57,132 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:57,140 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 01:05:57,332 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:05:57,333 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:05:57,334 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:05:57,334 INFO L85 PathProgramCache]: Analyzing trace with hash 952555931, now seen corresponding path program 1 times [2025-02-06 01:05:57,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:05:57,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220582503] [2025-02-06 01:05:57,334 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:57,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:05:57,348 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 01:05:57,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 01:05:57,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:57,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:57,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-06 01:05:57,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:05:57,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220582503] [2025-02-06 01:05:57,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220582503] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:05:57,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:05:57,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 01:05:57,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148551881] [2025-02-06 01:05:57,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:05:57,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 01:05:57,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:05:57,532 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 01:05:57,532 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-06 01:05:57,533 INFO L87 Difference]: Start difference. First operand 820 states and 1183 transitions. Second operand has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:58,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:05:58,239 INFO L93 Difference]: Finished difference Result 2333 states and 3370 transitions. [2025-02-06 01:05:58,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 01:05:58,239 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2025-02-06 01:05:58,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:05:58,246 INFO L225 Difference]: With dead ends: 2333 [2025-02-06 01:05:58,247 INFO L226 Difference]: Without dead ends: 1591 [2025-02-06 01:05:58,248 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:05:58,248 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 280 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 402 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:05:58,249 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [280 Valid, 724 Invalid, 402 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 399 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 01:05:58,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1591 states. [2025-02-06 01:05:58,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1591 to 1131. [2025-02-06 01:05:58,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 851 states have (on average 1.3184488836662749) internal successors, (1122), 851 states have internal predecessors, (1122), 252 states have call successors, (252), 27 states have call predecessors, (252), 27 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-02-06 01:05:58,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1626 transitions. [2025-02-06 01:05:58,460 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1626 transitions. Word has length 196 [2025-02-06 01:05:58,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:05:58,461 INFO L471 AbstractCegarLoop]: Abstraction has 1131 states and 1626 transitions. [2025-02-06 01:05:58,461 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.8) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:05:58,461 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1626 transitions. [2025-02-06 01:05:58,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2025-02-06 01:05:58,462 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:05:58,462 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:05:58,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 01:05:58,463 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:05:58,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:05:58,463 INFO L85 PathProgramCache]: Analyzing trace with hash -1954499850, now seen corresponding path program 1 times [2025-02-06 01:05:58,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:05:58,463 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003993771] [2025-02-06 01:05:58,463 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:58,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:05:58,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 01:05:58,495 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 01:05:58,495 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:58,495 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 6 proven. 75 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2025-02-06 01:05:59,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:05:59,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003993771] [2025-02-06 01:05:59,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003993771] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 01:05:59,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977309618] [2025-02-06 01:05:59,203 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:05:59,203 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:05:59,203 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:05:59,205 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 01:05:59,208 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 01:05:59,299 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 196 statements into 1 equivalence classes. [2025-02-06 01:05:59,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 196 of 196 statements. [2025-02-06 01:05:59,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:05:59,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:05:59,348 INFO L256 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-02-06 01:05:59,354 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:06:00,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-06 01:06:00,640 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 01:06:00,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977309618] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:06:00,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 01:06:00,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [11] total 19 [2025-02-06 01:06:00,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180827866] [2025-02-06 01:06:00,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:06:00,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 01:06:00,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:06:00,642 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 01:06:00,642 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=270, Unknown=0, NotChecked=0, Total=342 [2025-02-06 01:06:00,643 INFO L87 Difference]: Start difference. First operand 1131 states and 1626 transitions. Second operand has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:06:01,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:06:01,175 INFO L93 Difference]: Finished difference Result 2377 states and 3406 transitions. [2025-02-06 01:06:01,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 01:06:01,176 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 196 [2025-02-06 01:06:01,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:06:01,182 INFO L225 Difference]: With dead ends: 2377 [2025-02-06 01:06:01,182 INFO L226 Difference]: Without dead ends: 1324 [2025-02-06 01:06:01,184 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=366, Unknown=0, NotChecked=0, Total=462 [2025-02-06 01:06:01,185 INFO L435 NwaCegarLoop]: 120 mSDtfsCounter, 127 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 677 SdHoareTripleChecker+Invalid, 581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 01:06:01,185 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 677 Invalid, 581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 01:06:01,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2025-02-06 01:06:01,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1182. [2025-02-06 01:06:01,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1182 states, 902 states have (on average 1.3203991130820398) internal successors, (1191), 902 states have internal predecessors, (1191), 252 states have call successors, (252), 27 states have call predecessors, (252), 27 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-02-06 01:06:01,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1182 states to 1182 states and 1695 transitions. [2025-02-06 01:06:01,429 INFO L78 Accepts]: Start accepts. Automaton has 1182 states and 1695 transitions. Word has length 196 [2025-02-06 01:06:01,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:06:01,430 INFO L471 AbstractCegarLoop]: Abstraction has 1182 states and 1695 transitions. [2025-02-06 01:06:01,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.363636363636363) internal successors, (59), 10 states have internal predecessors, (59), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:06:01,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1182 states and 1695 transitions. [2025-02-06 01:06:01,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2025-02-06 01:06:01,433 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:06:01,433 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:01,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-06 01:06:01,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-06 01:06:01,633 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:06:01,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:06:01,634 INFO L85 PathProgramCache]: Analyzing trace with hash 918529735, now seen corresponding path program 1 times [2025-02-06 01:06:01,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:06:01,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737082882] [2025-02-06 01:06:01,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:01,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:06:01,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 197 statements into 1 equivalence classes. [2025-02-06 01:06:01,665 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 197 of 197 statements. [2025-02-06 01:06:01,665 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:01,665 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:06:02,141 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2025-02-06 01:06:02,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 01:06:02,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737082882] [2025-02-06 01:06:02,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737082882] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 01:06:02,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 01:06:02,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 01:06:02,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352232345] [2025-02-06 01:06:02,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 01:06:02,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 01:06:02,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 01:06:02,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 01:06:02,143 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 01:06:02,143 INFO L87 Difference]: Start difference. First operand 1182 states and 1695 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:06:02,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 01:06:02,737 INFO L93 Difference]: Finished difference Result 2460 states and 3521 transitions. [2025-02-06 01:06:02,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 01:06:02,738 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 197 [2025-02-06 01:06:02,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 01:06:02,744 INFO L225 Difference]: With dead ends: 2460 [2025-02-06 01:06:02,744 INFO L226 Difference]: Without dead ends: 1407 [2025-02-06 01:06:02,746 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2025-02-06 01:06:02,747 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 323 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 353 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 323 SdHoareTripleChecker+Valid, 568 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 353 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 01:06:02,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [323 Valid, 568 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 353 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 01:06:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1407 states. [2025-02-06 01:06:02,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1407 to 1180. [2025-02-06 01:06:02,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 900 states have (on average 1.3155555555555556) internal successors, (1184), 900 states have internal predecessors, (1184), 252 states have call successors, (252), 27 states have call predecessors, (252), 27 states have return successors, (252), 252 states have call predecessors, (252), 252 states have call successors, (252) [2025-02-06 01:06:02,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1688 transitions. [2025-02-06 01:06:02,909 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1688 transitions. Word has length 197 [2025-02-06 01:06:02,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 01:06:02,910 INFO L471 AbstractCegarLoop]: Abstraction has 1180 states and 1688 transitions. [2025-02-06 01:06:02,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 6 states have internal predecessors, (60), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2025-02-06 01:06:02,910 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1688 transitions. [2025-02-06 01:06:02,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2025-02-06 01:06:02,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 01:06:02,911 INFO L218 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 01:06:02,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 01:06:02,911 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 01:06:02,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 01:06:02,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1649393997, now seen corresponding path program 1 times [2025-02-06 01:06:02,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 01:06:02,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488735414] [2025-02-06 01:06:02,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:02,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 01:06:02,923 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-06 01:06:02,974 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-06 01:06:02,974 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:02,974 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-02-06 01:06:02,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [413382343] [2025-02-06 01:06:02,978 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 01:06:02,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 01:06:02,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 01:06:02,983 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 01:06:02,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-06 01:06:03,047 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 198 statements into 1 equivalence classes. [2025-02-06 01:06:03,525 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 198 of 198 statements. [2025-02-06 01:06:03,525 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 01:06:03,525 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 01:06:03,528 INFO L256 TraceCheckSpWp]: Trace formula consists of 470 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-06 01:06:03,531 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 01:06:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 947 proven. 180 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2025-02-06 01:06:05,034 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 01:06:16,079 WARN L286 SmtUtils]: Spent 5.44s on a formula simplification. DAG size of input: 28 DAG size of output: 24 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne) [2025-02-06 01:06:25,203 WARN L286 SmtUtils]: Spent 8.35s on a formula simplification. DAG size of input: 30 DAG size of output: 26 (called from [L 188] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionTir.tryToEliminateOne)