./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-99.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_fillercode_fillercodesize_ps-cn-250_file-99.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 51679f677755cdcbe89cef639d9e0fff08a3a1c877b6770e3f1b1827d281f800 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:42:03,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:42:03,158 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 21:42:03,161 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:42:03,162 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:42:03,175 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:42:03,176 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:42:03,176 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:42:03,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:42:03,176 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:42:03,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:42:03,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:42:03,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:42:03,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:42:03,177 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:42:03,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:42:03,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:42:03,177 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:42:03,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:42:03,177 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:42:03,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:42:03,177 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:42:03,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:42:03,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:42:03,178 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:42:03,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:42:03,178 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:42:03,178 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:42:03,178 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:42:03,178 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:42:03,178 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:42:03,178 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:42:03,178 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:42:03,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:42:03,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:42:03,179 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:42:03,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:42:03,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:42:03,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:42:03,179 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:42:03,179 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:42:03,179 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:42:03,179 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:42:03,179 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 -> 51679f677755cdcbe89cef639d9e0fff08a3a1c877b6770e3f1b1827d281f800 [2025-02-05 21:42:03,347 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:42:03,353 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:42:03,354 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:42:03,355 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:42:03,355 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:42:03,355 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-99.i [2025-02-05 21:42:04,467 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/689486fbd/bf1a5c2d733245d9902ea415fb3f4a7a/FLAG04e255f50 [2025-02-05 21:42:04,766 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:42:04,766 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-99.i [2025-02-05 21:42:04,780 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/689486fbd/bf1a5c2d733245d9902ea415fb3f4a7a/FLAG04e255f50 [2025-02-05 21:42:05,028 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/689486fbd/bf1a5c2d733245d9902ea415fb3f4a7a [2025-02-05 21:42:05,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:42:05,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:42:05,034 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:42:05,034 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:42:05,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:42:05,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a72b5f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05, skipping insertion in model container [2025-02-05 21:42:05,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,061 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:42:05,177 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-99.i[916,929] [2025-02-05 21:42:05,288 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:42:05,303 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:42:05,312 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-99.i[916,929] [2025-02-05 21:42:05,380 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:42:05,401 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:42:05,402 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05 WrapperNode [2025-02-05 21:42:05,402 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:42:05,403 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:42:05,403 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:42:05,403 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:42:05,407 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,422 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,478 INFO L138 Inliner]: procedures = 26, calls = 93, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 586 [2025-02-05 21:42:05,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:42:05,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:42:05,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:42:05,481 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:42:05,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,499 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,532 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-05 21:42:05,532 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,532 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,549 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,551 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,560 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,571 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:42:05,572 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:42:05,572 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:42:05,572 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:42:05,573 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (1/1) ... [2025-02-05 21:42:05,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:42:05,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:05,603 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-05 21:42:05,609 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-05 21:42:05,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:42:05,629 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:42:05,629 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:42:05,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:42:05,629 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:42:05,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:42:05,741 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:42:05,746 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:42:06,329 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L441: havoc property_#t~bitwise60#1;havoc property_#t~short61#1; [2025-02-05 21:42:06,406 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2025-02-05 21:42:06,407 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:42:06,435 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:42:06,439 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:42:06,439 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:42:06 BoogieIcfgContainer [2025-02-05 21:42:06,439 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:42:06,440 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:42:06,440 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:42:06,444 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:42:06,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:42:05" (1/3) ... [2025-02-05 21:42:06,444 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7a831d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:42:06, skipping insertion in model container [2025-02-05 21:42:06,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:05" (2/3) ... [2025-02-05 21:42:06,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c7a831d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:42:06, skipping insertion in model container [2025-02-05 21:42:06,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:42:06" (3/3) ... [2025-02-05 21:42:06,446 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-99.i [2025-02-05 21:42:06,455 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:42:06,457 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-99.i that has 2 procedures, 246 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:42:06,504 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:42:06,513 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;@11958502, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:42:06,514 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:42:06,518 INFO L276 IsEmpty]: Start isEmpty. Operand has 246 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 164 states have internal predecessors, (249), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 21:42:06,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-02-05 21:42:06,538 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:06,538 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:42:06,539 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:06,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:06,547 INFO L85 PathProgramCache]: Analyzing trace with hash 823254237, now seen corresponding path program 1 times [2025-02-05 21:42:06,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:06,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127423911] [2025-02-05 21:42:06,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:06,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:06,666 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-02-05 21:42:06,693 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-02-05 21:42:06,694 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:06,694 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 158 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-02-05 21:42:07,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127423911] [2025-02-05 21:42:07,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127423911] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:07,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1860878912] [2025-02-05 21:42:07,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:07,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:07,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:07,052 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-05 21:42:07,056 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-05 21:42:07,172 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-02-05 21:42:07,306 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-02-05 21:42:07,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:07,307 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:07,312 INFO L256 TraceCheckSpWp]: Trace formula consists of 1108 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:42:07,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:07,377 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 158 proven. 0 refuted. 0 times theorem prover too weak. 12482 trivial. 0 not checked. [2025-02-05 21:42:07,377 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:42:07,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1860878912] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:07,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:42:07,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:42:07,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313256686] [2025-02-05 21:42:07,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:07,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:42:07,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:07,402 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:42:07,402 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:42:07,405 INFO L87 Difference]: Start difference. First operand has 246 states, 163 states have (on average 1.5276073619631902) internal successors, (249), 164 states have internal predecessors, (249), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) Second operand has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-05 21:42:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:07,466 INFO L93 Difference]: Finished difference Result 486 states and 893 transitions. [2025-02-05 21:42:07,467 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:42:07,468 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) Word has length 500 [2025-02-05 21:42:07,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:07,477 INFO L225 Difference]: With dead ends: 486 [2025-02-05 21:42:07,477 INFO L226 Difference]: Without dead ends: 243 [2025-02-05 21:42:07,481 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 501 GetRequests, 501 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-05 21:42:07,482 INFO L435 NwaCegarLoop]: 391 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:07,483 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 391 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:42:07,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 243 states. [2025-02-05 21:42:07,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 243 to 243. [2025-02-05 21:42:07,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 161 states have (on average 1.5093167701863355) internal successors, (243), 161 states have internal predecessors, (243), 80 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 80 states have call predecessors, (80), 80 states have call successors, (80) [2025-02-05 21:42:07,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 403 transitions. [2025-02-05 21:42:07,550 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 403 transitions. Word has length 500 [2025-02-05 21:42:07,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:07,552 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 403 transitions. [2025-02-05 21:42:07,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 52.5) internal successors, (105), 2 states have internal predecessors, (105), 2 states have call successors, (80), 2 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 2 states have call successors, (80) [2025-02-05 21:42:07,552 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 403 transitions. [2025-02-05 21:42:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-02-05 21:42:07,571 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:07,572 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:42:07,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-05 21:42:07,772 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-05 21:42:07,773 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:07,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:07,775 INFO L85 PathProgramCache]: Analyzing trace with hash 272523677, now seen corresponding path program 1 times [2025-02-05 21:42:07,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:07,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802888899] [2025-02-05 21:42:07,775 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:07,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:07,809 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-02-05 21:42:07,850 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-02-05 21:42:07,851 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:07,851 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:08,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 21:42:08,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:08,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802888899] [2025-02-05 21:42:08,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802888899] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:08,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:08,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:42:08,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032847247] [2025-02-05 21:42:08,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:08,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:42:08,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:08,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:42:08,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:08,111 INFO L87 Difference]: Start difference. First operand 243 states and 403 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:08,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:08,220 INFO L93 Difference]: Finished difference Result 650 states and 1082 transitions. [2025-02-05 21:42:08,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:42:08,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 500 [2025-02-05 21:42:08,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:08,227 INFO L225 Difference]: With dead ends: 650 [2025-02-05 21:42:08,228 INFO L226 Difference]: Without dead ends: 410 [2025-02-05 21:42:08,230 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:08,230 INFO L435 NwaCegarLoop]: 495 mSDtfsCounter, 269 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 867 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:08,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 867 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:42:08,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2025-02-05 21:42:08,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 407. [2025-02-05 21:42:08,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 281 states have (on average 1.5373665480427046) internal successors, (432), 282 states have internal predecessors, (432), 123 states have call successors, (123), 2 states have call predecessors, (123), 2 states have return successors, (123), 122 states have call predecessors, (123), 123 states have call successors, (123) [2025-02-05 21:42:08,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 678 transitions. [2025-02-05 21:42:08,286 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 678 transitions. Word has length 500 [2025-02-05 21:42:08,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:08,289 INFO L471 AbstractCegarLoop]: Abstraction has 407 states and 678 transitions. [2025-02-05 21:42:08,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:08,289 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 678 transitions. [2025-02-05 21:42:08,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-02-05 21:42:08,296 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:08,296 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:42:08,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:42:08,297 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:08,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:08,297 INFO L85 PathProgramCache]: Analyzing trace with hash -2072143364, now seen corresponding path program 1 times [2025-02-05 21:42:08,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:08,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439171085] [2025-02-05 21:42:08,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:08,335 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-02-05 21:42:08,378 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-02-05 21:42:08,378 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:08,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:08,550 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 21:42:08,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:08,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439171085] [2025-02-05 21:42:08,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439171085] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:08,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:08,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:42:08,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522605433] [2025-02-05 21:42:08,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:08,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:42:08,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:08,556 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:42:08,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:08,556 INFO L87 Difference]: Start difference. First operand 407 states and 678 transitions. Second operand has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:08,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:08,667 INFO L93 Difference]: Finished difference Result 1141 states and 1904 transitions. [2025-02-05 21:42:08,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:42:08,668 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 500 [2025-02-05 21:42:08,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:08,676 INFO L225 Difference]: With dead ends: 1141 [2025-02-05 21:42:08,677 INFO L226 Difference]: Without dead ends: 737 [2025-02-05 21:42:08,679 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:08,681 INFO L435 NwaCegarLoop]: 568 mSDtfsCounter, 275 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:08,681 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [275 Valid, 942 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:42:08,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 737 states. [2025-02-05 21:42:08,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 737 to 734. [2025-02-05 21:42:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 518 states have (on average 1.5347490347490347) internal successors, (795), 521 states have internal predecessors, (795), 211 states have call successors, (211), 4 states have call predecessors, (211), 4 states have return successors, (211), 208 states have call predecessors, (211), 211 states have call successors, (211) [2025-02-05 21:42:08,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1217 transitions. [2025-02-05 21:42:08,754 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1217 transitions. Word has length 500 [2025-02-05 21:42:08,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:08,758 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1217 transitions. [2025-02-05 21:42:08,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.333333333333336) internal successors, (103), 3 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:08,759 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1217 transitions. [2025-02-05 21:42:08,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2025-02-05 21:42:08,765 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:08,765 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:42:08,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:42:08,765 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:08,766 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:08,766 INFO L85 PathProgramCache]: Analyzing trace with hash 1968087387, now seen corresponding path program 1 times [2025-02-05 21:42:08,766 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:08,766 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234635027] [2025-02-05 21:42:08,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:08,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:08,797 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 500 statements into 1 equivalence classes. [2025-02-05 21:42:08,830 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 500 of 500 statements. [2025-02-05 21:42:08,830 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:08,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:09,127 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 21:42:09,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:09,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234635027] [2025-02-05 21:42:09,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234635027] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:09,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:09,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:42:09,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [293152489] [2025-02-05 21:42:09,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:09,128 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:42:09,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:09,128 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:42:09,128 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:42:09,129 INFO L87 Difference]: Start difference. First operand 734 states and 1217 transitions. Second operand has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:09,896 INFO L93 Difference]: Finished difference Result 2798 states and 4635 transitions. [2025-02-05 21:42:09,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:42:09,896 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 500 [2025-02-05 21:42:09,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:09,906 INFO L225 Difference]: With dead ends: 2798 [2025-02-05 21:42:09,907 INFO L226 Difference]: Without dead ends: 2067 [2025-02-05 21:42:09,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:42:09,909 INFO L435 NwaCegarLoop]: 603 mSDtfsCounter, 1099 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 564 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1099 SdHoareTripleChecker+Valid, 1502 SdHoareTripleChecker+Invalid, 847 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 564 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:09,909 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1099 Valid, 1502 Invalid, 847 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [564 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:42:09,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2067 states. [2025-02-05 21:42:10,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2067 to 1429. [2025-02-05 21:42:10,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1429 states, 1011 states have (on average 1.5370919881305638) internal successors, (1554), 1018 states have internal predecessors, (1554), 409 states have call successors, (409), 8 states have call predecessors, (409), 8 states have return successors, (409), 402 states have call predecessors, (409), 409 states have call successors, (409) [2025-02-05 21:42:10,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1429 states to 1429 states and 2372 transitions. [2025-02-05 21:42:10,026 INFO L78 Accepts]: Start accepts. Automaton has 1429 states and 2372 transitions. Word has length 500 [2025-02-05 21:42:10,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:10,027 INFO L471 AbstractCegarLoop]: Abstraction has 1429 states and 2372 transitions. [2025-02-05 21:42:10,027 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.6) internal successors, (103), 5 states have internal predecessors, (103), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:10,027 INFO L276 IsEmpty]: Start isEmpty. Operand 1429 states and 2372 transitions. [2025-02-05 21:42:10,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-02-05 21:42:10,033 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:10,033 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:42:10,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:42:10,033 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:10,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:10,034 INFO L85 PathProgramCache]: Analyzing trace with hash -967976161, now seen corresponding path program 1 times [2025-02-05 21:42:10,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:10,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595049893] [2025-02-05 21:42:10,034 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:10,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:10,056 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-02-05 21:42:10,077 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-02-05 21:42:10,078 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:10,078 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:10,168 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 21:42:10,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:10,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595049893] [2025-02-05 21:42:10,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595049893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:10,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:10,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:42:10,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [203961373] [2025-02-05 21:42:10,169 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:10,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:42:10,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:10,170 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:42:10,170 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:10,170 INFO L87 Difference]: Start difference. First operand 1429 states and 2372 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:10,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:10,344 INFO L93 Difference]: Finished difference Result 3939 states and 6510 transitions. [2025-02-05 21:42:10,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:42:10,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 501 [2025-02-05 21:42:10,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:10,357 INFO L225 Difference]: With dead ends: 3939 [2025-02-05 21:42:10,357 INFO L226 Difference]: Without dead ends: 2513 [2025-02-05 21:42:10,360 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:10,361 INFO L435 NwaCegarLoop]: 601 mSDtfsCounter, 274 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:10,361 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 979 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:42:10,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2513 states. [2025-02-05 21:42:10,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2513 to 2509. [2025-02-05 21:42:10,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2509 states, 1723 states have (on average 1.4973882762623332) internal successors, (2580), 1738 states have internal predecessors, (2580), 769 states have call successors, (769), 16 states have call predecessors, (769), 16 states have return successors, (769), 754 states have call predecessors, (769), 769 states have call successors, (769) [2025-02-05 21:42:10,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2509 states to 2509 states and 4118 transitions. [2025-02-05 21:42:10,525 INFO L78 Accepts]: Start accepts. Automaton has 2509 states and 4118 transitions. Word has length 501 [2025-02-05 21:42:10,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:10,526 INFO L471 AbstractCegarLoop]: Abstraction has 2509 states and 4118 transitions. [2025-02-05 21:42:10,526 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:10,526 INFO L276 IsEmpty]: Start isEmpty. Operand 2509 states and 4118 transitions. [2025-02-05 21:42:10,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-02-05 21:42:10,534 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:10,535 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:42:10,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:42:10,535 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:10,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:10,536 INFO L85 PathProgramCache]: Analyzing trace with hash -956660034, now seen corresponding path program 1 times [2025-02-05 21:42:10,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:10,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477996213] [2025-02-05 21:42:10,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:10,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:10,562 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-02-05 21:42:10,585 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-02-05 21:42:10,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:10,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 21:42:10,678 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:10,678 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477996213] [2025-02-05 21:42:10,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477996213] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:10,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:10,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:42:10,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72421518] [2025-02-05 21:42:10,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:10,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:42:10,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:10,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:42:10,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:10,679 INFO L87 Difference]: Start difference. First operand 2509 states and 4118 transitions. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:10,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:10,852 INFO L93 Difference]: Finished difference Result 5203 states and 8560 transitions. [2025-02-05 21:42:10,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:42:10,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 501 [2025-02-05 21:42:10,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:10,866 INFO L225 Difference]: With dead ends: 5203 [2025-02-05 21:42:10,866 INFO L226 Difference]: Without dead ends: 2697 [2025-02-05 21:42:10,871 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:10,872 INFO L435 NwaCegarLoop]: 519 mSDtfsCounter, 285 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 891 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:10,872 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 891 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:42:10,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2697 states. [2025-02-05 21:42:10,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2697 to 1851. [2025-02-05 21:42:10,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1851 states, 1431 states have (on average 1.5737246680642907) internal successors, (2252), 1438 states have internal predecessors, (2252), 409 states have call successors, (409), 10 states have call predecessors, (409), 10 states have return successors, (409), 402 states have call predecessors, (409), 409 states have call successors, (409) [2025-02-05 21:42:10,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1851 states to 1851 states and 3070 transitions. [2025-02-05 21:42:10,968 INFO L78 Accepts]: Start accepts. Automaton has 1851 states and 3070 transitions. Word has length 501 [2025-02-05 21:42:10,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:10,969 INFO L471 AbstractCegarLoop]: Abstraction has 1851 states and 3070 transitions. [2025-02-05 21:42:10,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:10,969 INFO L276 IsEmpty]: Start isEmpty. Operand 1851 states and 3070 transitions. [2025-02-05 21:42:10,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 502 [2025-02-05 21:42:10,973 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:10,973 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:42:10,973 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:42:10,973 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:10,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:10,974 INFO L85 PathProgramCache]: Analyzing trace with hash 943440449, now seen corresponding path program 1 times [2025-02-05 21:42:10,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:10,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064068837] [2025-02-05 21:42:10,974 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:10,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:10,995 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 501 statements into 1 equivalence classes. [2025-02-05 21:42:11,021 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 501 of 501 statements. [2025-02-05 21:42:11,021 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:11,021 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:11,430 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 21:42:11,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:11,430 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064068837] [2025-02-05 21:42:11,430 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064068837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:11,430 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:11,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:42:11,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294446556] [2025-02-05 21:42:11,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:11,431 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:42:11,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:11,431 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:42:11,431 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:42:11,432 INFO L87 Difference]: Start difference. First operand 1851 states and 3070 transitions. Second operand has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:12,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:12,097 INFO L93 Difference]: Finished difference Result 5241 states and 8676 transitions. [2025-02-05 21:42:12,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:42:12,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 501 [2025-02-05 21:42:12,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:12,114 INFO L225 Difference]: With dead ends: 5241 [2025-02-05 21:42:12,114 INFO L226 Difference]: Without dead ends: 3393 [2025-02-05 21:42:12,119 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:42:12,119 INFO L435 NwaCegarLoop]: 383 mSDtfsCounter, 570 mSDsluCounter, 416 mSDsCounter, 0 mSdLazyCounter, 406 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 570 SdHoareTripleChecker+Valid, 799 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 406 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:12,119 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [570 Valid, 799 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 406 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:42:12,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3393 states. [2025-02-05 21:42:12,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3393 to 3383. [2025-02-05 21:42:12,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3383 states, 2659 states have (on average 1.5697630688228656) internal successors, (4174), 2674 states have internal predecessors, (4174), 705 states have call successors, (705), 18 states have call predecessors, (705), 18 states have return successors, (705), 690 states have call predecessors, (705), 705 states have call successors, (705) [2025-02-05 21:42:12,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3383 states to 3383 states and 5584 transitions. [2025-02-05 21:42:12,314 INFO L78 Accepts]: Start accepts. Automaton has 3383 states and 5584 transitions. Word has length 501 [2025-02-05 21:42:12,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:12,315 INFO L471 AbstractCegarLoop]: Abstraction has 3383 states and 5584 transitions. [2025-02-05 21:42:12,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 20.8) internal successors, (104), 5 states have internal predecessors, (104), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:12,315 INFO L276 IsEmpty]: Start isEmpty. Operand 3383 states and 5584 transitions. [2025-02-05 21:42:12,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-05 21:42:12,320 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:12,320 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:42:12,320 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:42:12,320 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:12,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:12,321 INFO L85 PathProgramCache]: Analyzing trace with hash -1758767122, now seen corresponding path program 1 times [2025-02-05 21:42:12,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:12,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593249164] [2025-02-05 21:42:12,321 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:12,321 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:12,341 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-05 21:42:12,388 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-05 21:42:12,389 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:12,389 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:12,599 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 21:42:12,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:12,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [593249164] [2025-02-05 21:42:12,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [593249164] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:12,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:12,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:42:12,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329318123] [2025-02-05 21:42:12,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:12,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:42:12,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:12,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:42:12,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:42:12,601 INFO L87 Difference]: Start difference. First operand 3383 states and 5584 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:13,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:13,503 INFO L93 Difference]: Finished difference Result 13005 states and 21442 transitions. [2025-02-05 21:42:13,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:42:13,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 503 [2025-02-05 21:42:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:13,599 INFO L225 Difference]: With dead ends: 13005 [2025-02-05 21:42:13,600 INFO L226 Difference]: Without dead ends: 9625 [2025-02-05 21:42:13,609 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:42:13,610 INFO L435 NwaCegarLoop]: 656 mSDtfsCounter, 924 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1540 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:13,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1540 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:42:13,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9625 states. [2025-02-05 21:42:13,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9625 to 6095. [2025-02-05 21:42:13,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6095 states, 4796 states have (on average 1.5698498748957463) internal successors, (7529), 4822 states have internal predecessors, (7529), 1262 states have call successors, (1262), 36 states have call predecessors, (1262), 36 states have return successors, (1262), 1236 states have call predecessors, (1262), 1262 states have call successors, (1262) [2025-02-05 21:42:13,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6095 states to 6095 states and 10053 transitions. [2025-02-05 21:42:14,001 INFO L78 Accepts]: Start accepts. Automaton has 6095 states and 10053 transitions. Word has length 503 [2025-02-05 21:42:14,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:14,002 INFO L471 AbstractCegarLoop]: Abstraction has 6095 states and 10053 transitions. [2025-02-05 21:42:14,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:14,005 INFO L276 IsEmpty]: Start isEmpty. Operand 6095 states and 10053 transitions. [2025-02-05 21:42:14,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-05 21:42:14,017 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:14,018 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:42:14,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:42:14,018 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:14,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:14,018 INFO L85 PathProgramCache]: Analyzing trace with hash 835459695, now seen corresponding path program 1 times [2025-02-05 21:42:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:14,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916633108] [2025-02-05 21:42:14,019 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:14,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:14,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-05 21:42:14,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-05 21:42:14,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:14,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:15,255 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12640 trivial. 0 not checked. [2025-02-05 21:42:15,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:15,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916633108] [2025-02-05 21:42:15,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916633108] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:15,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:15,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:42:15,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714290343] [2025-02-05 21:42:15,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:15,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:42:15,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:15,257 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:42:15,257 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:42:15,257 INFO L87 Difference]: Start difference. First operand 6095 states and 10053 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:17,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:17,292 INFO L93 Difference]: Finished difference Result 26107 states and 42937 transitions. [2025-02-05 21:42:17,293 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:42:17,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) Word has length 503 [2025-02-05 21:42:17,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:17,375 INFO L225 Difference]: With dead ends: 26107 [2025-02-05 21:42:17,376 INFO L226 Difference]: Without dead ends: 20015 [2025-02-05 21:42:17,395 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:42:17,399 INFO L435 NwaCegarLoop]: 480 mSDtfsCounter, 886 mSDsluCounter, 1470 mSDsCounter, 0 mSdLazyCounter, 527 mSolverCounterSat, 256 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 886 SdHoareTripleChecker+Valid, 1950 SdHoareTripleChecker+Invalid, 783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 256 IncrementalHoareTripleChecker+Valid, 527 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:17,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [886 Valid, 1950 Invalid, 783 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [256 Valid, 527 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:42:17,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20015 states. [2025-02-05 21:42:18,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20015 to 19943. [2025-02-05 21:42:18,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19943 states, 15604 states have (on average 1.559728274801333) internal successors, (24338), 15714 states have internal predecessors, (24338), 4210 states have call successors, (4210), 128 states have call predecessors, (4210), 128 states have return successors, (4210), 4100 states have call predecessors, (4210), 4210 states have call successors, (4210) [2025-02-05 21:42:18,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19943 states to 19943 states and 32758 transitions. [2025-02-05 21:42:18,540 INFO L78 Accepts]: Start accepts. Automaton has 19943 states and 32758 transitions. Word has length 503 [2025-02-05 21:42:18,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:18,541 INFO L471 AbstractCegarLoop]: Abstraction has 19943 states and 32758 transitions. [2025-02-05 21:42:18,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 6 states have internal predecessors, (106), 1 states have call successors, (80), 1 states have call predecessors, (80), 1 states have return successors, (80), 1 states have call predecessors, (80), 1 states have call successors, (80) [2025-02-05 21:42:18,542 INFO L276 IsEmpty]: Start isEmpty. Operand 19943 states and 32758 transitions. [2025-02-05 21:42:18,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-05 21:42:18,562 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:18,563 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:42:18,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:42:18,563 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:18,563 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:18,563 INFO L85 PathProgramCache]: Analyzing trace with hash -9012176, now seen corresponding path program 1 times [2025-02-05 21:42:18,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:18,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106179509] [2025-02-05 21:42:18,564 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:18,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:18,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-05 21:42:18,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-05 21:42:18,823 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:18,823 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:19,638 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 21 proven. 447 refuted. 0 times theorem prover too weak. 12172 trivial. 0 not checked. [2025-02-05 21:42:19,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:19,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106179509] [2025-02-05 21:42:19,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106179509] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:19,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [332569818] [2025-02-05 21:42:19,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:19,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:19,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:19,641 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-05 21:42:19,642 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-05 21:42:19,792 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-05 21:42:19,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-05 21:42:19,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:19,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:19,914 INFO L256 TraceCheckSpWp]: Trace formula consists of 1106 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-02-05 21:42:19,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:21,780 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 1373 proven. 447 refuted. 0 times theorem prover too weak. 10820 trivial. 0 not checked. [2025-02-05 21:42:21,780 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:42:23,073 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 21 proven. 450 refuted. 0 times theorem prover too weak. 12169 trivial. 0 not checked. [2025-02-05 21:42:23,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [332569818] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:42:23,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:42:23,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 16 [2025-02-05 21:42:23,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208024829] [2025-02-05 21:42:23,073 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:42:23,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-02-05 21:42:23,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:23,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-02-05 21:42:23,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=167, Unknown=0, NotChecked=0, Total=240 [2025-02-05 21:42:23,075 INFO L87 Difference]: Start difference. First operand 19943 states and 32758 transitions. Second operand has 16 states, 16 states have (on average 8.25) internal successors, (132), 16 states have internal predecessors, (132), 3 states have call successors, (156), 3 states have call predecessors, (156), 7 states have return successors, (158), 3 states have call predecessors, (158), 3 states have call successors, (158) [2025-02-05 21:42:28,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:28,115 INFO L93 Difference]: Finished difference Result 88037 states and 139856 transitions. [2025-02-05 21:42:28,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2025-02-05 21:42:28,116 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 16 states have internal predecessors, (132), 3 states have call successors, (156), 3 states have call predecessors, (156), 7 states have return successors, (158), 3 states have call predecessors, (158), 3 states have call successors, (158) Word has length 503 [2025-02-05 21:42:28,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:28,314 INFO L225 Difference]: With dead ends: 88037 [2025-02-05 21:42:28,315 INFO L226 Difference]: Without dead ends: 68097 [2025-02-05 21:42:28,372 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1054 GetRequests, 1003 SyntacticMatches, 2 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 765 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=706, Invalid=1844, Unknown=0, NotChecked=0, Total=2550 [2025-02-05 21:42:28,373 INFO L435 NwaCegarLoop]: 562 mSDtfsCounter, 1612 mSDsluCounter, 2865 mSDsCounter, 0 mSdLazyCounter, 2340 mSolverCounterSat, 367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1694 SdHoareTripleChecker+Valid, 3427 SdHoareTripleChecker+Invalid, 2707 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 367 IncrementalHoareTripleChecker+Valid, 2340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:28,373 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1694 Valid, 3427 Invalid, 2707 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [367 Valid, 2340 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-02-05 21:42:28,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68097 states. [2025-02-05 21:42:32,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68097 to 45257. [2025-02-05 21:42:32,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45257 states, 35796 states have (on average 1.5098893731143144) internal successors, (54048), 36128 states have internal predecessors, (54048), 8644 states have call successors, (8644), 816 states have call predecessors, (8644), 816 states have return successors, (8644), 8312 states have call predecessors, (8644), 8644 states have call successors, (8644) [2025-02-05 21:42:32,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45257 states to 45257 states and 71336 transitions. [2025-02-05 21:42:32,215 INFO L78 Accepts]: Start accepts. Automaton has 45257 states and 71336 transitions. Word has length 503 [2025-02-05 21:42:32,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:32,216 INFO L471 AbstractCegarLoop]: Abstraction has 45257 states and 71336 transitions. [2025-02-05 21:42:32,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 8.25) internal successors, (132), 16 states have internal predecessors, (132), 3 states have call successors, (156), 3 states have call predecessors, (156), 7 states have return successors, (158), 3 states have call predecessors, (158), 3 states have call successors, (158) [2025-02-05 21:42:32,216 INFO L276 IsEmpty]: Start isEmpty. Operand 45257 states and 71336 transitions. [2025-02-05 21:42:32,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2025-02-05 21:42:32,243 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:32,243 INFO L218 NwaCegarLoop]: trace histogram [80, 80, 80, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-05 21:42:32,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 21:42:32,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:32,447 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:32,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash -514570801, now seen corresponding path program 1 times [2025-02-05 21:42:32,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:32,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420581178] [2025-02-05 21:42:32,448 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:32,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:32,465 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-05 21:42:32,624 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-05 21:42:32,624 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:32,624 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:35,926 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 387 proven. 81 refuted. 0 times theorem prover too weak. 12172 trivial. 0 not checked. [2025-02-05 21:42:35,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:35,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420581178] [2025-02-05 21:42:35,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420581178] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:35,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1981547737] [2025-02-05 21:42:35,927 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:35,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:35,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:35,932 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-05 21:42:35,936 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-05 21:42:36,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 503 statements into 1 equivalence classes. [2025-02-05 21:42:36,136 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 503 of 503 statements. [2025-02-05 21:42:36,137 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:36,137 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:36,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 1105 conjuncts, 42 conjuncts are in the unsatisfiable core [2025-02-05 21:42:36,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:43,553 INFO L134 CoverageAnalysis]: Checked inductivity of 12640 backedges. 5125 proven. 516 refuted. 0 times theorem prover too weak. 6999 trivial. 0 not checked. [2025-02-05 21:42:43,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:42:57,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1981547737] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:57,493 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-05 21:42:57,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 25] total 42 [2025-02-05 21:42:57,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418438977] [2025-02-05 21:42:57,494 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-05 21:42:57,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-05 21:42:57,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:57,496 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-05 21:42:57,497 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=364, Invalid=2828, Unknown=0, NotChecked=0, Total=3192 [2025-02-05 21:42:57,497 INFO L87 Difference]: Start difference. First operand 45257 states and 71336 transitions. Second operand has 42 states, 42 states have (on average 5.0476190476190474) internal successors, (212), 41 states have internal predecessors, (212), 7 states have call successors, (160), 6 states have call predecessors, (160), 11 states have return successors, (160), 8 states have call predecessors, (160), 7 states have call successors, (160)