./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-97.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-97.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 02165d2842f12d5b69765c0782f17776c7bdb8b210882abfa812daaf9c359651 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:41:58,595 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:41:58,654 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:41:58,658 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:41:58,659 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:41:58,678 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:41:58,679 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:41:58,679 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:41:58,679 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:41:58,679 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:41:58,679 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:41:58,681 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:41:58,681 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:41:58,681 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:41:58,682 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:41:58,682 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:41:58,682 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:41:58,682 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:41:58,683 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:41:58,683 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:41:58,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:41:58,684 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:41:58,685 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:41:58,685 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:41:58,685 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 -> 02165d2842f12d5b69765c0782f17776c7bdb8b210882abfa812daaf9c359651 [2025-02-05 21:41:58,992 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:41:59,001 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:41:59,003 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:41:59,005 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:41:59,005 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:41:59,007 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-97.i [2025-02-05 21:42:00,224 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5426b2d84/eae902646fb64c8887eda1631a017efc/FLAGac3ef7191 [2025-02-05 21:42:00,555 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:42:00,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-97.i [2025-02-05 21:42:00,566 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5426b2d84/eae902646fb64c8887eda1631a017efc/FLAGac3ef7191 [2025-02-05 21:42:00,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5426b2d84/eae902646fb64c8887eda1631a017efc [2025-02-05 21:42:00,587 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:42:00,589 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:42:00,590 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:42:00,591 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:42:00,594 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:42:00,595 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:42:00" (1/1) ... [2025-02-05 21:42:00,597 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d594386 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:00, skipping insertion in model container [2025-02-05 21:42:00,598 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:42:00" (1/1) ... [2025-02-05 21:42:00,624 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:42:00,753 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-97.i[916,929] [2025-02-05 21:42:00,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:42:00,897 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:42:00,911 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-97.i[916,929] [2025-02-05 21:42:00,987 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:42:01,007 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:42:01,009 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:01 WrapperNode [2025-02-05 21:42:01,009 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:42:01,011 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:42:01,011 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:42:01,011 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:42:01,016 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:01" (1/1) ... [2025-02-05 21:42:01,034 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:01" (1/1) ... [2025-02-05 21:42:01,097 INFO L138 Inliner]: procedures = 26, calls = 97, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 614 [2025-02-05 21:42:01,097 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:42:01,098 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:42:01,101 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:42:01,102 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:42:01,112 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:01" (1/1) ... [2025-02-05 21:42:01,113 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:01" (1/1) ... [2025-02-05 21:42:01,128 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:01" (1/1) ... [2025-02-05 21:42:01,175 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:01,176 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:01" (1/1) ... [2025-02-05 21:42:01,176 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:01" (1/1) ... [2025-02-05 21:42:01,204 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:01" (1/1) ... [2025-02-05 21:42:01,207 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:01" (1/1) ... [2025-02-05 21:42:01,216 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:01" (1/1) ... [2025-02-05 21:42:01,223 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:01" (1/1) ... [2025-02-05 21:42:01,237 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:42:01,238 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:42:01,238 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:42:01,239 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:42:01,240 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:01" (1/1) ... [2025-02-05 21:42:01,245 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:42:01,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:01,287 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:01,297 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:01,324 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:42:01,324 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:42:01,324 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:42:01,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:42:01,325 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:42:01,325 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:42:01,441 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:42:01,442 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:42:02,063 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L454: havoc property_#t~ite63#1;havoc property_#t~ite62#1;havoc property_#t~bitwise61#1;havoc property_#t~short64#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short67#1; [2025-02-05 21:42:02,182 INFO L? ?]: Removed 29 outVars from TransFormulas that were not future-live. [2025-02-05 21:42:02,182 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:42:02,210 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:42:02,210 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:42:02,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:42:02 BoogieIcfgContainer [2025-02-05 21:42:02,211 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:42:02,213 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:42:02,213 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:42:02,218 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:42:02,219 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:42:00" (1/3) ... [2025-02-05 21:42:02,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18de3678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:42:02, skipping insertion in model container [2025-02-05 21:42:02,220 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:42:01" (2/3) ... [2025-02-05 21:42:02,220 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@18de3678 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:42:02, skipping insertion in model container [2025-02-05 21:42:02,221 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:42:02" (3/3) ... [2025-02-05 21:42:02,222 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-97.i [2025-02-05 21:42:02,258 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:42:02,261 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-97.i that has 2 procedures, 256 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:42:02,338 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:42:02,349 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;@23db9ff0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:42:02,350 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:42:02,356 INFO L276 IsEmpty]: Start isEmpty. Operand has 256 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 170 states have internal predecessors, (257), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:42:02,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-02-05 21:42:02,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:02,387 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:02,388 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:02,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:02,396 INFO L85 PathProgramCache]: Analyzing trace with hash 719157468, now seen corresponding path program 1 times [2025-02-05 21:42:02,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:02,403 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201990250] [2025-02-05 21:42:02,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:02,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:02,527 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-02-05 21:42:02,576 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-02-05 21:42:02,577 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:02,577 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:02,990 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 166 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2025-02-05 21:42:02,991 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:02,991 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201990250] [2025-02-05 21:42:02,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201990250] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:02,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [422189978] [2025-02-05 21:42:02,993 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:02,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:02,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:02,995 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:02,997 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:03,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-02-05 21:42:03,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-02-05 21:42:03,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:03,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:03,266 INFO L256 TraceCheckSpWp]: Trace formula consists of 1164 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:42:03,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:03,349 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 13778 trivial. 0 not checked. [2025-02-05 21:42:03,349 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:42:03,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [422189978] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:03,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:42:03,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:42:03,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370283808] [2025-02-05 21:42:03,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:03,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:42:03,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:03,376 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:42:03,376 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:42:03,379 INFO L87 Difference]: Start difference. First operand has 256 states, 169 states have (on average 1.5207100591715976) internal successors, (257), 170 states have internal predecessors, (257), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) Second operand has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) [2025-02-05 21:42:03,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:03,437 INFO L93 Difference]: Finished difference Result 506 states and 929 transitions. [2025-02-05 21:42:03,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:42:03,439 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) Word has length 525 [2025-02-05 21:42:03,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:03,448 INFO L225 Difference]: With dead ends: 506 [2025-02-05 21:42:03,448 INFO L226 Difference]: Without dead ends: 253 [2025-02-05 21:42:03,455 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 526 GetRequests, 526 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:03,458 INFO L435 NwaCegarLoop]: 405 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 405 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:03,460 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 405 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:42:03,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states. [2025-02-05 21:42:03,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 253. [2025-02-05 21:42:03,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 167 states have (on average 1.4970059880239521) internal successors, (250), 167 states have internal predecessors, (250), 84 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2025-02-05 21:42:03,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 418 transitions. [2025-02-05 21:42:03,544 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 418 transitions. Word has length 525 [2025-02-05 21:42:03,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:03,546 INFO L471 AbstractCegarLoop]: Abstraction has 253 states and 418 transitions. [2025-02-05 21:42:03,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.0) internal successors, (110), 2 states have internal predecessors, (110), 2 states have call successors, (84), 2 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 2 states have call successors, (84) [2025-02-05 21:42:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 418 transitions. [2025-02-05 21:42:03,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 526 [2025-02-05 21:42:03,559 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:03,559 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:03,568 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:03,763 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:03,763 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:03,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:03,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1359308637, now seen corresponding path program 1 times [2025-02-05 21:42:03,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:03,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676509893] [2025-02-05 21:42:03,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:03,766 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:03,828 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 525 statements into 1 equivalence classes. [2025-02-05 21:42:03,944 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 525 of 525 statements. [2025-02-05 21:42:03,944 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:03,944 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:04,278 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:04,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:04,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676509893] [2025-02-05 21:42:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676509893] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:04,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:04,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:42:04,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721316950] [2025-02-05 21:42:04,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:04,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:42:04,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:04,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:42:04,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:04,283 INFO L87 Difference]: Start difference. First operand 253 states and 418 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:04,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:04,387 INFO L93 Difference]: Finished difference Result 640 states and 1060 transitions. [2025-02-05 21:42:04,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:42:04,388 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 525 [2025-02-05 21:42:04,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:04,399 INFO L225 Difference]: With dead ends: 640 [2025-02-05 21:42:04,399 INFO L226 Difference]: Without dead ends: 390 [2025-02-05 21:42:04,401 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:04,401 INFO L435 NwaCegarLoop]: 615 mSDtfsCounter, 235 mSDsluCounter, 388 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 235 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:04,402 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [235 Valid, 1003 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:42:04,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2025-02-05 21:42:04,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 387. [2025-02-05 21:42:04,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 387 states, 284 states have (on average 1.556338028169014) internal successors, (442), 285 states have internal predecessors, (442), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 21:42:04,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 387 states to 387 states and 642 transitions. [2025-02-05 21:42:04,450 INFO L78 Accepts]: Start accepts. Automaton has 387 states and 642 transitions. Word has length 525 [2025-02-05 21:42:04,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:04,453 INFO L471 AbstractCegarLoop]: Abstraction has 387 states and 642 transitions. [2025-02-05 21:42:04,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:04,453 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 642 transitions. [2025-02-05 21:42:04,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-02-05 21:42:04,463 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:04,463 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:04,463 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:42:04,463 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:04,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:04,464 INFO L85 PathProgramCache]: Analyzing trace with hash 170100024, now seen corresponding path program 1 times [2025-02-05 21:42:04,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:04,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166770064] [2025-02-05 21:42:04,466 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:04,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:04,518 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-02-05 21:42:04,574 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-02-05 21:42:04,574 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:04,574 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:04,901 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:04,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:04,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166770064] [2025-02-05 21:42:04,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166770064] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:04,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:04,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:42:04,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177543217] [2025-02-05 21:42:04,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:04,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:42:04,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:04,904 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:42:04,904 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:04,904 INFO L87 Difference]: Start difference. First operand 387 states and 642 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:05,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:05,058 INFO L93 Difference]: Finished difference Result 1127 states and 1874 transitions. [2025-02-05 21:42:05,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:42:05,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 526 [2025-02-05 21:42:05,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:05,069 INFO L225 Difference]: With dead ends: 1127 [2025-02-05 21:42:05,070 INFO L226 Difference]: Without dead ends: 743 [2025-02-05 21:42:05,072 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:05,073 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 403 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 403 SdHoareTripleChecker+Valid, 1142 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:05,074 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [403 Valid, 1142 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:42:05,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2025-02-05 21:42:05,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 429. [2025-02-05 21:42:05,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 326 states have (on average 1.5337423312883436) internal successors, (500), 327 states have internal predecessors, (500), 100 states have call successors, (100), 2 states have call predecessors, (100), 2 states have return successors, (100), 99 states have call predecessors, (100), 100 states have call successors, (100) [2025-02-05 21:42:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 700 transitions. [2025-02-05 21:42:05,148 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 700 transitions. Word has length 526 [2025-02-05 21:42:05,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:05,150 INFO L471 AbstractCegarLoop]: Abstraction has 429 states and 700 transitions. [2025-02-05 21:42:05,150 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:05,150 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 700 transitions. [2025-02-05 21:42:05,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-02-05 21:42:05,160 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:05,161 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:05,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:42:05,161 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:05,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:05,162 INFO L85 PathProgramCache]: Analyzing trace with hash 1677651833, now seen corresponding path program 1 times [2025-02-05 21:42:05,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:05,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146085193] [2025-02-05 21:42:05,162 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:05,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:05,196 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-02-05 21:42:05,284 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-02-05 21:42:05,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:05,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:05,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:05,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146085193] [2025-02-05 21:42:05,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146085193] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:05,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:05,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:42:05,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594385894] [2025-02-05 21:42:05,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:05,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:42:05,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:05,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:42:05,963 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:42:05,964 INFO L87 Difference]: Start difference. First operand 429 states and 700 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:06,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:06,493 INFO L93 Difference]: Finished difference Result 1503 states and 2457 transitions. [2025-02-05 21:42:06,494 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:42:06,494 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 526 [2025-02-05 21:42:06,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:06,500 INFO L225 Difference]: With dead ends: 1503 [2025-02-05 21:42:06,500 INFO L226 Difference]: Without dead ends: 1077 [2025-02-05 21:42:06,502 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:42:06,502 INFO L435 NwaCegarLoop]: 623 mSDtfsCounter, 498 mSDsluCounter, 1401 mSDsCounter, 0 mSdLazyCounter, 351 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 498 SdHoareTripleChecker+Valid, 2024 SdHoareTripleChecker+Invalid, 357 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 351 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:06,502 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [498 Valid, 2024 Invalid, 357 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 351 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:42:06,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2025-02-05 21:42:06,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 798. [2025-02-05 21:42:06,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 798 states, 644 states have (on average 1.5807453416149069) internal successors, (1018), 647 states have internal predecessors, (1018), 149 states have call successors, (149), 4 states have call predecessors, (149), 4 states have return successors, (149), 146 states have call predecessors, (149), 149 states have call successors, (149) [2025-02-05 21:42:06,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 798 states to 798 states and 1316 transitions. [2025-02-05 21:42:06,567 INFO L78 Accepts]: Start accepts. Automaton has 798 states and 1316 transitions. Word has length 526 [2025-02-05 21:42:06,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:06,569 INFO L471 AbstractCegarLoop]: Abstraction has 798 states and 1316 transitions. [2025-02-05 21:42:06,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:06,569 INFO L276 IsEmpty]: Start isEmpty. Operand 798 states and 1316 transitions. [2025-02-05 21:42:06,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-02-05 21:42:06,578 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:06,579 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:42:06,579 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:06,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash 1437111704, now seen corresponding path program 1 times [2025-02-05 21:42:06,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:06,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063652831] [2025-02-05 21:42:06,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:06,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:06,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-02-05 21:42:06,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-02-05 21:42:06,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:06,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:07,149 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:07,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:07,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063652831] [2025-02-05 21:42:07,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2063652831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:07,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:07,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:42:07,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541026636] [2025-02-05 21:42:07,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:07,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:42:07,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:07,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:42:07,151 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:07,151 INFO L87 Difference]: Start difference. First operand 798 states and 1316 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:07,242 INFO L93 Difference]: Finished difference Result 2388 states and 3942 transitions. [2025-02-05 21:42:07,242 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:42:07,242 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 526 [2025-02-05 21:42:07,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:07,250 INFO L225 Difference]: With dead ends: 2388 [2025-02-05 21:42:07,250 INFO L226 Difference]: Without dead ends: 1593 [2025-02-05 21:42:07,253 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:07,254 INFO L435 NwaCegarLoop]: 404 mSDtfsCounter, 249 mSDsluCounter, 399 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 803 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:07,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [249 Valid, 803 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:42:07,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1593 states. [2025-02-05 21:42:07,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1593 to 1591. [2025-02-05 21:42:07,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1591 states, 1284 states have (on average 1.5794392523364487) internal successors, (2028), 1290 states have internal predecessors, (2028), 298 states have call successors, (298), 8 states have call predecessors, (298), 8 states have return successors, (298), 292 states have call predecessors, (298), 298 states have call successors, (298) [2025-02-05 21:42:07,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1591 states to 1591 states and 2624 transitions. [2025-02-05 21:42:07,389 INFO L78 Accepts]: Start accepts. Automaton has 1591 states and 2624 transitions. Word has length 526 [2025-02-05 21:42:07,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:07,390 INFO L471 AbstractCegarLoop]: Abstraction has 1591 states and 2624 transitions. [2025-02-05 21:42:07,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:07,392 INFO L276 IsEmpty]: Start isEmpty. Operand 1591 states and 2624 transitions. [2025-02-05 21:42:07,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2025-02-05 21:42:07,397 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:07,398 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:42:07,400 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:07,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:07,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1613091111, now seen corresponding path program 1 times [2025-02-05 21:42:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:07,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1682404102] [2025-02-05 21:42:07,402 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:07,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:07,431 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 526 statements into 1 equivalence classes. [2025-02-05 21:42:07,529 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 526 of 526 statements. [2025-02-05 21:42:07,529 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:07,529 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:07,909 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:07,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:07,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1682404102] [2025-02-05 21:42:07,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1682404102] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:07,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:07,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:42:07,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1051422037] [2025-02-05 21:42:07,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:07,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:42:07,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:07,911 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:42:07,911 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:42:07,911 INFO L87 Difference]: Start difference. First operand 1591 states and 2624 transitions. Second operand has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:08,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:08,672 INFO L93 Difference]: Finished difference Result 5209 states and 8668 transitions. [2025-02-05 21:42:08,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:42:08,673 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 526 [2025-02-05 21:42:08,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:08,695 INFO L225 Difference]: With dead ends: 5209 [2025-02-05 21:42:08,695 INFO L226 Difference]: Without dead ends: 3621 [2025-02-05 21:42:08,700 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:08,701 INFO L435 NwaCegarLoop]: 735 mSDtfsCounter, 467 mSDsluCounter, 1325 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 170 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 467 SdHoareTripleChecker+Valid, 2060 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 170 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:08,702 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [467 Valid, 2060 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [170 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:42:08,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3621 states. [2025-02-05 21:42:08,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3621 to 3268. [2025-02-05 21:42:08,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3268 states, 2569 states have (on average 1.5605293888672636) internal successors, (4009), 2582 states have internal predecessors, (4009), 680 states have call successors, (680), 18 states have call predecessors, (680), 18 states have return successors, (680), 667 states have call predecessors, (680), 680 states have call successors, (680) [2025-02-05 21:42:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3268 states to 3268 states and 5369 transitions. [2025-02-05 21:42:08,906 INFO L78 Accepts]: Start accepts. Automaton has 3268 states and 5369 transitions. Word has length 526 [2025-02-05 21:42:08,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:08,907 INFO L471 AbstractCegarLoop]: Abstraction has 3268 states and 5369 transitions. [2025-02-05 21:42:08,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.8) internal successors, (109), 5 states have internal predecessors, (109), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:08,907 INFO L276 IsEmpty]: Start isEmpty. Operand 3268 states and 5369 transitions. [2025-02-05 21:42:08,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-02-05 21:42:08,911 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:08,911 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:42:08,911 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:08,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:08,912 INFO L85 PathProgramCache]: Analyzing trace with hash -1388371077, now seen corresponding path program 1 times [2025-02-05 21:42:08,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:08,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283284907] [2025-02-05 21:42:08,912 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:08,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:08,935 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-02-05 21:42:09,027 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-02-05 21:42:09,027 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:09,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:09,628 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:09,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:09,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283284907] [2025-02-05 21:42:09,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283284907] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:09,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:09,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:42:09,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798750600] [2025-02-05 21:42:09,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:09,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:42:09,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:09,630 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:42:09,630 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:42:09,630 INFO L87 Difference]: Start difference. First operand 3268 states and 5369 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:11,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:11,470 INFO L93 Difference]: Finished difference Result 15114 states and 24810 transitions. [2025-02-05 21:42:11,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-05 21:42:11,471 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 527 [2025-02-05 21:42:11,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:11,525 INFO L225 Difference]: With dead ends: 15114 [2025-02-05 21:42:11,525 INFO L226 Difference]: Without dead ends: 11988 [2025-02-05 21:42:11,535 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:42:11,535 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 1713 mSDsluCounter, 1165 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 509 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1713 SdHoareTripleChecker+Valid, 1703 SdHoareTripleChecker+Invalid, 1318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 509 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:11,536 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1713 Valid, 1703 Invalid, 1318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [509 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-05 21:42:11,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11988 states. [2025-02-05 21:42:12,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11988 to 7801. [2025-02-05 21:42:12,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7801 states, 6164 states have (on average 1.5600259571706685) internal successors, (9616), 6196 states have internal predecessors, (9616), 1592 states have call successors, (1592), 44 states have call predecessors, (1592), 44 states have return successors, (1592), 1560 states have call predecessors, (1592), 1592 states have call successors, (1592) [2025-02-05 21:42:12,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7801 states to 7801 states and 12800 transitions. [2025-02-05 21:42:12,126 INFO L78 Accepts]: Start accepts. Automaton has 7801 states and 12800 transitions. Word has length 527 [2025-02-05 21:42:12,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:12,126 INFO L471 AbstractCegarLoop]: Abstraction has 7801 states and 12800 transitions. [2025-02-05 21:42:12,127 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:12,130 INFO L276 IsEmpty]: Start isEmpty. Operand 7801 states and 12800 transitions. [2025-02-05 21:42:12,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-02-05 21:42:12,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:12,138 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,138 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:42:12,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:12,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:12,139 INFO L85 PathProgramCache]: Analyzing trace with hash 244432922, now seen corresponding path program 1 times [2025-02-05 21:42:12,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:12,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210108115] [2025-02-05 21:42:12,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:12,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:12,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-02-05 21:42:12,185 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-02-05 21:42:12,186 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:12,186 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:12,280 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:12,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:12,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210108115] [2025-02-05 21:42:12,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210108115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:12,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:12,280 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:42:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916225474] [2025-02-05 21:42:12,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:12,281 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:42:12,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:12,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:42:12,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:12,282 INFO L87 Difference]: Start difference. First operand 7801 states and 12800 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:12,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:12,733 INFO L93 Difference]: Finished difference Result 20888 states and 34186 transitions. [2025-02-05 21:42:12,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:42:12,735 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 527 [2025-02-05 21:42:12,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:12,801 INFO L225 Difference]: With dead ends: 20888 [2025-02-05 21:42:12,801 INFO L226 Difference]: Without dead ends: 13090 [2025-02-05 21:42:12,830 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:12,831 INFO L435 NwaCegarLoop]: 513 mSDtfsCounter, 254 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:12,832 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 904 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:42:12,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13090 states. [2025-02-05 21:42:13,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13090 to 13079. [2025-02-05 21:42:13,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13079 states, 10507 states have (on average 1.5432568763681356) internal successors, (16215), 10572 states have internal predecessors, (16215), 2490 states have call successors, (2490), 81 states have call predecessors, (2490), 81 states have return successors, (2490), 2425 states have call predecessors, (2490), 2490 states have call successors, (2490) [2025-02-05 21:42:13,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13079 states to 13079 states and 21195 transitions. [2025-02-05 21:42:13,711 INFO L78 Accepts]: Start accepts. Automaton has 13079 states and 21195 transitions. Word has length 527 [2025-02-05 21:42:13,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:13,713 INFO L471 AbstractCegarLoop]: Abstraction has 13079 states and 21195 transitions. [2025-02-05 21:42:13,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:13,714 INFO L276 IsEmpty]: Start isEmpty. Operand 13079 states and 21195 transitions. [2025-02-05 21:42:13,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-02-05 21:42:13,723 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:13,724 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:13,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:42:13,724 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:13,724 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:13,724 INFO L85 PathProgramCache]: Analyzing trace with hash -1264297830, now seen corresponding path program 1 times [2025-02-05 21:42:13,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:13,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678214246] [2025-02-05 21:42:13,725 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:13,725 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:13,749 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-02-05 21:42:13,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-02-05 21:42:13,847 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:13,847 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:14,182 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:14,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:14,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678214246] [2025-02-05 21:42:14,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678214246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:14,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:14,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:42:14,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488411134] [2025-02-05 21:42:14,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:14,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:42:14,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:14,184 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:42:14,185 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:42:14,185 INFO L87 Difference]: Start difference. First operand 13079 states and 21195 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:15,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:15,999 INFO L93 Difference]: Finished difference Result 45555 states and 73199 transitions. [2025-02-05 21:42:15,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:42:15,999 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 527 [2025-02-05 21:42:16,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:16,108 INFO L225 Difference]: With dead ends: 45555 [2025-02-05 21:42:16,108 INFO L226 Difference]: Without dead ends: 32549 [2025-02-05 21:42:16,150 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:42:16,151 INFO L435 NwaCegarLoop]: 425 mSDtfsCounter, 843 mSDsluCounter, 1197 mSDsCounter, 0 mSdLazyCounter, 394 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 843 SdHoareTripleChecker+Valid, 1622 SdHoareTripleChecker+Invalid, 531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 394 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:16,152 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [843 Valid, 1622 Invalid, 531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 394 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:42:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32549 states. [2025-02-05 21:42:16,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32549 to 8416. [2025-02-05 21:42:16,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8416 states, 6791 states have (on average 1.5601531438668825) internal successors, (10595), 6821 states have internal predecessors, (10595), 1564 states have call successors, (1564), 60 states have call predecessors, (1564), 60 states have return successors, (1564), 1534 states have call predecessors, (1564), 1564 states have call successors, (1564) [2025-02-05 21:42:16,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8416 states to 8416 states and 13723 transitions. [2025-02-05 21:42:16,853 INFO L78 Accepts]: Start accepts. Automaton has 8416 states and 13723 transitions. Word has length 527 [2025-02-05 21:42:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:16,854 INFO L471 AbstractCegarLoop]: Abstraction has 8416 states and 13723 transitions. [2025-02-05 21:42:16,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 8416 states and 13723 transitions. [2025-02-05 21:42:16,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-02-05 21:42:16,860 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:16,860 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16,860 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:42:16,860 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:16,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:16,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1837067716, now seen corresponding path program 1 times [2025-02-05 21:42:16,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:16,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465987782] [2025-02-05 21:42:16,861 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:16,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:16,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-02-05 21:42:16,967 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-02-05 21:42:16,968 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:16,968 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:17,393 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:17,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:17,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465987782] [2025-02-05 21:42:17,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465987782] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:17,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:17,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:42:17,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960053381] [2025-02-05 21:42:17,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:17,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:42:17,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:17,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:42:17,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:42:17,395 INFO L87 Difference]: Start difference. First operand 8416 states and 13723 transitions. Second operand has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:19,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:19,183 INFO L93 Difference]: Finished difference Result 28361 states and 46045 transitions. [2025-02-05 21:42:19,183 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:42:19,184 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 527 [2025-02-05 21:42:19,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:19,270 INFO L225 Difference]: With dead ends: 28361 [2025-02-05 21:42:19,270 INFO L226 Difference]: Without dead ends: 19948 [2025-02-05 21:42:19,300 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 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:19,300 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 1009 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 206 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1009 SdHoareTripleChecker+Valid, 1591 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 206 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:19,301 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1009 Valid, 1591 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [206 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:42:19,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19948 states. [2025-02-05 21:42:20,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19948 to 6399. [2025-02-05 21:42:20,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6399 states, 5162 states have (on average 1.5579232855482372) internal successors, (8042), 5185 states have internal predecessors, (8042), 1190 states have call successors, (1190), 46 states have call predecessors, (1190), 46 states have return successors, (1190), 1167 states have call predecessors, (1190), 1190 states have call successors, (1190) [2025-02-05 21:42:20,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6399 states to 6399 states and 10422 transitions. [2025-02-05 21:42:20,047 INFO L78 Accepts]: Start accepts. Automaton has 6399 states and 10422 transitions. Word has length 527 [2025-02-05 21:42:20,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:20,048 INFO L471 AbstractCegarLoop]: Abstraction has 6399 states and 10422 transitions. [2025-02-05 21:42:20,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.0) internal successors, (110), 5 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:20,049 INFO L276 IsEmpty]: Start isEmpty. Operand 6399 states and 10422 transitions. [2025-02-05 21:42:20,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 528 [2025-02-05 21:42:20,055 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:20,055 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,055 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:42:20,055 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:20,056 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:20,056 INFO L85 PathProgramCache]: Analyzing trace with hash 1420392634, now seen corresponding path program 1 times [2025-02-05 21:42:20,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:20,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580733685] [2025-02-05 21:42:20,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:20,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:20,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 527 statements into 1 equivalence classes. [2025-02-05 21:42:20,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 527 of 527 statements. [2025-02-05 21:42:20,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:20,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:20,633 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:20,633 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:20,633 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580733685] [2025-02-05 21:42:20,633 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580733685] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:20,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:20,634 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-02-05 21:42:20,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [560988135] [2025-02-05 21:42:20,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:20,634 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-05 21:42:20,634 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:20,635 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-05 21:42:20,635 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:42:20,635 INFO L87 Difference]: Start difference. First operand 6399 states and 10422 transitions. Second operand has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:21,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:21,790 INFO L93 Difference]: Finished difference Result 16955 states and 27487 transitions. [2025-02-05 21:42:21,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:42:21,791 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 527 [2025-02-05 21:42:21,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:21,827 INFO L225 Difference]: With dead ends: 16955 [2025-02-05 21:42:21,827 INFO L226 Difference]: Without dead ends: 10559 [2025-02-05 21:42:21,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2025-02-05 21:42:21,843 INFO L435 NwaCegarLoop]: 431 mSDtfsCounter, 534 mSDsluCounter, 1364 mSDsCounter, 0 mSdLazyCounter, 427 mSolverCounterSat, 339 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 534 SdHoareTripleChecker+Valid, 1795 SdHoareTripleChecker+Invalid, 766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 339 IncrementalHoareTripleChecker+Valid, 427 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:21,844 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [534 Valid, 1795 Invalid, 766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [339 Valid, 427 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:42:21,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10559 states. [2025-02-05 21:42:22,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10559 to 10171. [2025-02-05 21:42:22,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10171 states, 8234 states have (on average 1.547971824143794) internal successors, (12746), 8270 states have internal predecessors, (12746), 1864 states have call successors, (1864), 72 states have call predecessors, (1864), 72 states have return successors, (1864), 1828 states have call predecessors, (1864), 1864 states have call successors, (1864) [2025-02-05 21:42:22,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10171 states to 10171 states and 16474 transitions. [2025-02-05 21:42:22,553 INFO L78 Accepts]: Start accepts. Automaton has 10171 states and 16474 transitions. Word has length 527 [2025-02-05 21:42:22,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:22,554 INFO L471 AbstractCegarLoop]: Abstraction has 10171 states and 16474 transitions. [2025-02-05 21:42:22,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.714285714285714) internal successors, (110), 7 states have internal predecessors, (110), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 10171 states and 16474 transitions. [2025-02-05 21:42:22,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-02-05 21:42:22,560 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:22,561 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,561 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:42:22,561 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:22,561 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:22,562 INFO L85 PathProgramCache]: Analyzing trace with hash 1594384760, now seen corresponding path program 1 times [2025-02-05 21:42:22,562 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:22,562 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1366672800] [2025-02-05 21:42:22,562 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:22,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:22,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-02-05 21:42:22,637 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-02-05 21:42:22,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:22,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:22,935 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:22,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:22,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1366672800] [2025-02-05 21:42:22,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1366672800] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:22,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:22,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:42:22,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [88010913] [2025-02-05 21:42:22,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:22,937 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:42:22,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:22,938 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:42:22,938 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:42:22,938 INFO L87 Difference]: Start difference. First operand 10171 states and 16474 transitions. Second operand has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:24,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:24,282 INFO L93 Difference]: Finished difference Result 16607 states and 27104 transitions. [2025-02-05 21:42:24,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:42:24,283 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 528 [2025-02-05 21:42:24,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:24,328 INFO L225 Difference]: With dead ends: 16607 [2025-02-05 21:42:24,328 INFO L226 Difference]: Without dead ends: 13887 [2025-02-05 21:42:24,338 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:24,339 INFO L435 NwaCegarLoop]: 1090 mSDtfsCounter, 663 mSDsluCounter, 1979 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 168 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 663 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 545 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 168 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:24,339 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [663 Valid, 3069 Invalid, 545 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [168 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-05 21:42:24,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13887 states. [2025-02-05 21:42:25,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13887 to 10243. [2025-02-05 21:42:25,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10243 states, 8306 states have (on average 1.5475559836262942) internal successors, (12854), 8342 states have internal predecessors, (12854), 1864 states have call successors, (1864), 72 states have call predecessors, (1864), 72 states have return successors, (1864), 1828 states have call predecessors, (1864), 1864 states have call successors, (1864) [2025-02-05 21:42:25,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10243 states to 10243 states and 16582 transitions. [2025-02-05 21:42:25,064 INFO L78 Accepts]: Start accepts. Automaton has 10243 states and 16582 transitions. Word has length 528 [2025-02-05 21:42:25,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:25,065 INFO L471 AbstractCegarLoop]: Abstraction has 10243 states and 16582 transitions. [2025-02-05 21:42:25,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.2) internal successors, (111), 5 states have internal predecessors, (111), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:25,065 INFO L276 IsEmpty]: Start isEmpty. Operand 10243 states and 16582 transitions. [2025-02-05 21:42:25,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2025-02-05 21:42:25,071 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:25,071 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:25,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:42:25,071 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:25,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:25,072 INFO L85 PathProgramCache]: Analyzing trace with hash 236441090, now seen corresponding path program 1 times [2025-02-05 21:42:25,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:25,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677429246] [2025-02-05 21:42:25,072 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:25,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:25,090 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 528 statements into 1 equivalence classes. [2025-02-05 21:42:25,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 528 of 528 statements. [2025-02-05 21:42:25,171 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:25,171 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:25,595 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:25,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:25,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677429246] [2025-02-05 21:42:25,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677429246] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:25,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:25,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:42:25,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814590351] [2025-02-05 21:42:25,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:25,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:42:25,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:25,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:42:25,597 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:42:25,598 INFO L87 Difference]: Start difference. First operand 10243 states and 16582 transitions. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:26,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:26,703 INFO L93 Difference]: Finished difference Result 21725 states and 35343 transitions. [2025-02-05 21:42:26,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 21:42:26,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 528 [2025-02-05 21:42:26,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:26,744 INFO L225 Difference]: With dead ends: 21725 [2025-02-05 21:42:26,745 INFO L226 Difference]: Without dead ends: 11485 [2025-02-05 21:42:26,765 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:42:26,765 INFO L435 NwaCegarLoop]: 743 mSDtfsCounter, 391 mSDsluCounter, 1096 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 1839 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:26,765 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 1839 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:42:26,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11485 states. [2025-02-05 21:42:27,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11485 to 10243. [2025-02-05 21:42:27,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10243 states, 8306 states have (on average 1.5331085961955213) internal successors, (12734), 8342 states have internal predecessors, (12734), 1864 states have call successors, (1864), 72 states have call predecessors, (1864), 72 states have return successors, (1864), 1828 states have call predecessors, (1864), 1864 states have call successors, (1864) [2025-02-05 21:42:27,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10243 states to 10243 states and 16462 transitions. [2025-02-05 21:42:27,539 INFO L78 Accepts]: Start accepts. Automaton has 10243 states and 16462 transitions. Word has length 528 [2025-02-05 21:42:27,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:27,540 INFO L471 AbstractCegarLoop]: Abstraction has 10243 states and 16462 transitions. [2025-02-05 21:42:27,540 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:27,540 INFO L276 IsEmpty]: Start isEmpty. Operand 10243 states and 16462 transitions. [2025-02-05 21:42:27,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-02-05 21:42:27,546 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:27,547 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:42:27,548 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:27,548 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:27,548 INFO L85 PathProgramCache]: Analyzing trace with hash 841167572, now seen corresponding path program 1 times [2025-02-05 21:42:27,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:27,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965010198] [2025-02-05 21:42:27,549 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:27,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:27,571 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-02-05 21:42:27,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-02-05 21:42:27,612 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:27,612 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:27,804 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:27,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:27,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965010198] [2025-02-05 21:42:27,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965010198] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:27,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:27,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:42:27,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592856322] [2025-02-05 21:42:27,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:27,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:42:27,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:27,807 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:42:27,807 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:27,807 INFO L87 Difference]: Start difference. First operand 10243 states and 16462 transitions. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:28,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:28,423 INFO L93 Difference]: Finished difference Result 20507 states and 32969 transitions. [2025-02-05 21:42:28,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:42:28,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 532 [2025-02-05 21:42:28,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:28,465 INFO L225 Difference]: With dead ends: 20507 [2025-02-05 21:42:28,466 INFO L226 Difference]: Without dead ends: 10267 [2025-02-05 21:42:28,486 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:42:28,486 INFO L435 NwaCegarLoop]: 403 mSDtfsCounter, 0 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 801 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:28,486 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 801 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:42:28,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10267 states. [2025-02-05 21:42:29,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10267 to 10267. [2025-02-05 21:42:29,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10267 states, 8330 states have (on average 1.5277310924369747) internal successors, (12726), 8366 states have internal predecessors, (12726), 1864 states have call successors, (1864), 72 states have call predecessors, (1864), 72 states have return successors, (1864), 1828 states have call predecessors, (1864), 1864 states have call successors, (1864) [2025-02-05 21:42:29,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10267 states to 10267 states and 16454 transitions. [2025-02-05 21:42:29,233 INFO L78 Accepts]: Start accepts. Automaton has 10267 states and 16454 transitions. Word has length 532 [2025-02-05 21:42:29,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:29,234 INFO L471 AbstractCegarLoop]: Abstraction has 10267 states and 16454 transitions. [2025-02-05 21:42:29,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:29,235 INFO L276 IsEmpty]: Start isEmpty. Operand 10267 states and 16454 transitions. [2025-02-05 21:42:29,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-02-05 21:42:29,240 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:29,240 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:29,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:42:29,240 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:29,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:29,241 INFO L85 PathProgramCache]: Analyzing trace with hash -2100490027, now seen corresponding path program 1 times [2025-02-05 21:42:29,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:29,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302546429] [2025-02-05 21:42:29,241 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:29,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:29,260 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-02-05 21:42:29,310 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-02-05 21:42:29,310 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:29,310 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:29,534 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:29,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:29,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302546429] [2025-02-05 21:42:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1302546429] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:29,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:29,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:42:29,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [774566952] [2025-02-05 21:42:29,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:29,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:42:29,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:29,538 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:42:29,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:42:29,539 INFO L87 Difference]: Start difference. First operand 10267 states and 16454 transitions. Second operand has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:32,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:32,082 INFO L93 Difference]: Finished difference Result 31367 states and 49837 transitions. [2025-02-05 21:42:32,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:42:32,083 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 532 [2025-02-05 21:42:32,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:32,150 INFO L225 Difference]: With dead ends: 31367 [2025-02-05 21:42:32,151 INFO L226 Difference]: Without dead ends: 21103 [2025-02-05 21:42:32,174 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:42:32,174 INFO L435 NwaCegarLoop]: 446 mSDtfsCounter, 948 mSDsluCounter, 1348 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 681 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 948 SdHoareTripleChecker+Valid, 1794 SdHoareTripleChecker+Invalid, 1050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 681 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:32,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [948 Valid, 1794 Invalid, 1050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [681 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-02-05 21:42:32,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21103 states. [2025-02-05 21:42:33,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21103 to 16043. [2025-02-05 21:42:33,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16043 states, 13034 states have (on average 1.5066748503912843) internal successors, (19638), 13090 states have internal predecessors, (19638), 2896 states have call successors, (2896), 112 states have call predecessors, (2896), 112 states have return successors, (2896), 2840 states have call predecessors, (2896), 2896 states have call successors, (2896) [2025-02-05 21:42:33,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16043 states to 16043 states and 25430 transitions. [2025-02-05 21:42:33,736 INFO L78 Accepts]: Start accepts. Automaton has 16043 states and 25430 transitions. Word has length 532 [2025-02-05 21:42:33,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:33,737 INFO L471 AbstractCegarLoop]: Abstraction has 16043 states and 25430 transitions. [2025-02-05 21:42:33,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.0) internal successors, (115), 5 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 16043 states and 25430 transitions. [2025-02-05 21:42:33,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-02-05 21:42:33,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:33,741 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:33,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 21:42:33,742 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:33,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:33,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1757377405, now seen corresponding path program 1 times [2025-02-05 21:42:33,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:33,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374794995] [2025-02-05 21:42:33,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:33,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:33,760 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-02-05 21:42:33,823 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-02-05 21:42:33,824 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:33,824 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 13944 trivial. 0 not checked. [2025-02-05 21:42:38,907 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:38,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374794995] [2025-02-05 21:42:38,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [374794995] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:42:38,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:42:38,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-05 21:42:38,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [431124811] [2025-02-05 21:42:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:42:38,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-05 21:42:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:38,909 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-05 21:42:38,909 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:42:38,909 INFO L87 Difference]: Start difference. First operand 16043 states and 25430 transitions. Second operand has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:42,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:42,523 INFO L93 Difference]: Finished difference Result 28643 states and 43807 transitions. [2025-02-05 21:42:42,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-05 21:42:42,524 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) Word has length 532 [2025-02-05 21:42:42,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:42,586 INFO L225 Difference]: With dead ends: 28643 [2025-02-05 21:42:42,586 INFO L226 Difference]: Without dead ends: 22151 [2025-02-05 21:42:42,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:42:42,601 INFO L435 NwaCegarLoop]: 384 mSDtfsCounter, 223 mSDsluCounter, 1206 mSDsCounter, 0 mSdLazyCounter, 440 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 223 SdHoareTripleChecker+Valid, 1590 SdHoareTripleChecker+Invalid, 453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 440 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:42,601 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [223 Valid, 1590 Invalid, 453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 440 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-05 21:42:42,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22151 states. [2025-02-05 21:42:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22151 to 21159. [2025-02-05 21:42:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21159 states, 17946 states have (on average 1.450239607712025) internal successors, (26026), 18070 states have internal predecessors, (26026), 3032 states have call successors, (3032), 180 states have call predecessors, (3032), 180 states have return successors, (3032), 2908 states have call predecessors, (3032), 3032 states have call successors, (3032) [2025-02-05 21:42:45,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21159 states to 21159 states and 32090 transitions. [2025-02-05 21:42:45,069 INFO L78 Accepts]: Start accepts. Automaton has 21159 states and 32090 transitions. Word has length 532 [2025-02-05 21:42:45,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:42:45,071 INFO L471 AbstractCegarLoop]: Abstraction has 21159 states and 32090 transitions. [2025-02-05 21:42:45,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.5) internal successors, (115), 10 states have internal predecessors, (115), 1 states have call successors, (84), 1 states have call predecessors, (84), 1 states have return successors, (84), 1 states have call predecessors, (84), 1 states have call successors, (84) [2025-02-05 21:42:45,071 INFO L276 IsEmpty]: Start isEmpty. Operand 21159 states and 32090 transitions. [2025-02-05 21:42:45,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 533 [2025-02-05 21:42:45,112 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:42:45,113 INFO L218 NwaCegarLoop]: trace histogram [84, 84, 84, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:45,113 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 21:42:45,114 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:42:45,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:42:45,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1292825410, now seen corresponding path program 1 times [2025-02-05 21:42:45,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:42:45,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [201153752] [2025-02-05 21:42:45,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:45,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:42:45,188 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-02-05 21:42:45,730 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-02-05 21:42:45,730 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:45,730 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:47,662 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 78 proven. 171 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-02-05 21:42:47,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:42:47,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [201153752] [2025-02-05 21:42:47,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [201153752] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:42:47,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [18086453] [2025-02-05 21:42:47,666 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:42:47,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:42:47,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:42:47,669 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:47,673 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:47,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 532 statements into 1 equivalence classes. [2025-02-05 21:42:47,962 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 532 of 532 statements. [2025-02-05 21:42:47,962 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:42:47,962 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:42:47,968 INFO L256 TraceCheckSpWp]: Trace formula consists of 1172 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-05 21:42:47,985 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:42:48,589 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 6593 proven. 156 refuted. 0 times theorem prover too weak. 7195 trivial. 0 not checked. [2025-02-05 21:42:48,589 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 21:42:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 13944 backedges. 93 proven. 156 refuted. 0 times theorem prover too weak. 13695 trivial. 0 not checked. [2025-02-05 21:42:49,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [18086453] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 21:42:49,144 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 21:42:49,144 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 14 [2025-02-05 21:42:49,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647300715] [2025-02-05 21:42:49,144 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 21:42:49,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-05 21:42:49,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:42:49,147 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-05 21:42:49,147 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2025-02-05 21:42:49,147 INFO L87 Difference]: Start difference. First operand 21159 states and 32090 transitions. Second operand has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 14 states have internal predecessors, (221), 4 states have call successors, (193), 2 states have call predecessors, (193), 4 states have return successors, (195), 4 states have call predecessors, (195), 4 states have call successors, (195) [2025-02-05 21:42:57,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:42:57,816 INFO L93 Difference]: Finished difference Result 88811 states and 132466 transitions. [2025-02-05 21:42:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-02-05 21:42:57,817 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 15.785714285714286) internal successors, (221), 14 states have internal predecessors, (221), 4 states have call successors, (193), 2 states have call predecessors, (193), 4 states have return successors, (195), 4 states have call predecessors, (195), 4 states have call successors, (195) Word has length 532 [2025-02-05 21:42:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:42:57,982 INFO L225 Difference]: With dead ends: 88811 [2025-02-05 21:42:57,982 INFO L226 Difference]: Without dead ends: 67655 [2025-02-05 21:42:58,021 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1099 GetRequests, 1063 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 293 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=410, Invalid=996, Unknown=0, NotChecked=0, Total=1406 [2025-02-05 21:42:58,021 INFO L435 NwaCegarLoop]: 485 mSDtfsCounter, 2849 mSDsluCounter, 1601 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 944 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2855 SdHoareTripleChecker+Valid, 2086 SdHoareTripleChecker+Invalid, 2696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 944 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:42:58,022 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2855 Valid, 2086 Invalid, 2696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [944 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 21:42:58,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67655 states.