./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-63.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-63.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 ce8f07b8a71bb59084eea52dad126a85a39d64ef48d7a1bf4787c5beab04d918 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 21:37:42,575 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 21:37:42,630 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:37:42,636 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 21:37:42,638 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 21:37:42,652 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 21:37:42,652 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 21:37:42,652 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 21:37:42,653 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 21:37:42,653 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 21:37:42,653 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 21:37:42,653 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 21:37:42,653 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 21:37:42,653 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 21:37:42,653 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 21:37:42,654 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 21:37:42,654 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 21:37:42,655 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 21:37:42,655 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 21:37:42,655 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 21:37:42,655 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 21:37:42,655 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 21:37:42,655 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 21:37:42,655 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 21:37:42,655 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 21:37:42,655 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 21:37:42,655 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 21:37:42,655 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 21:37:42,655 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 21:37:42,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 21:37:42,656 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 21:37:42,656 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 21:37:42,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:37:42,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 21:37:42,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 21:37:42,656 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 21:37:42,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 21:37:42,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 21:37:42,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 21:37:42,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 21:37:42,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 21:37:42,657 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 21:37:42,657 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 21:37:42,657 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 -> ce8f07b8a71bb59084eea52dad126a85a39d64ef48d7a1bf4787c5beab04d918 [2025-02-05 21:37:42,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 21:37:42,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 21:37:42,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 21:37:42,904 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 21:37:42,904 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 21:37:42,906 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-63.i [2025-02-05 21:37:44,182 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ec81794c/ecf78e352aa742e7b89bed4fb9c656ce/FLAG842a6b937 [2025-02-05 21:37:44,450 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 21:37:44,450 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-63.i [2025-02-05 21:37:44,463 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ec81794c/ecf78e352aa742e7b89bed4fb9c656ce/FLAG842a6b937 [2025-02-05 21:37:44,480 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/3ec81794c/ecf78e352aa742e7b89bed4fb9c656ce [2025-02-05 21:37:44,482 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 21:37:44,484 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 21:37:44,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 21:37:44,485 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 21:37:44,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 21:37:44,491 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:37:44" (1/1) ... [2025-02-05 21:37:44,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@476283f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44, skipping insertion in model container [2025-02-05 21:37:44,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 09:37:44" (1/1) ... [2025-02-05 21:37:44,522 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 21:37:44,630 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-63.i[916,929] [2025-02-05 21:37:44,768 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:37:44,786 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 21:37:44,796 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-63.i[916,929] [2025-02-05 21:37:44,870 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 21:37:44,885 INFO L204 MainTranslator]: Completed translation [2025-02-05 21:37:44,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44 WrapperNode [2025-02-05 21:37:44,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 21:37:44,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 21:37:44,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 21:37:44,887 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 21:37:44,891 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:37:44" (1/1) ... [2025-02-05 21:37:44,903 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:37:44" (1/1) ... [2025-02-05 21:37:44,952 INFO L138 Inliner]: procedures = 26, calls = 87, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 567 [2025-02-05 21:37:44,953 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 21:37:44,953 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 21:37:44,954 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 21:37:44,954 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 21:37:44,963 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44" (1/1) ... [2025-02-05 21:37:44,964 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44" (1/1) ... [2025-02-05 21:37:44,969 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44" (1/1) ... [2025-02-05 21:37:44,998 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:37:44,998 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44" (1/1) ... [2025-02-05 21:37:44,998 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44" (1/1) ... [2025-02-05 21:37:45,015 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44" (1/1) ... [2025-02-05 21:37:45,017 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44" (1/1) ... [2025-02-05 21:37:45,024 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44" (1/1) ... [2025-02-05 21:37:45,026 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44" (1/1) ... [2025-02-05 21:37:45,032 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 21:37:45,033 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 21:37:45,033 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 21:37:45,033 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 21:37:45,034 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44" (1/1) ... [2025-02-05 21:37:45,038 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 21:37:45,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:37:45,062 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:37:45,067 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:37:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 21:37:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-05 21:37:45,083 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-05 21:37:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 21:37:45,083 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 21:37:45,083 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 21:37:45,185 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 21:37:45,187 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 21:37:45,777 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L450: havoc property_#t~bitwise56#1;havoc property_#t~bitwise57#1;havoc property_#t~short58#1; [2025-02-05 21:37:45,867 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2025-02-05 21:37:45,868 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 21:37:45,889 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 21:37:45,889 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 21:37:45,890 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:37:45 BoogieIcfgContainer [2025-02-05 21:37:45,890 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 21:37:45,891 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 21:37:45,891 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 21:37:45,894 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 21:37:45,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 09:37:44" (1/3) ... [2025-02-05 21:37:45,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316bb0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:37:45, skipping insertion in model container [2025-02-05 21:37:45,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 09:37:44" (2/3) ... [2025-02-05 21:37:45,895 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@316bb0ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 09:37:45, skipping insertion in model container [2025-02-05 21:37:45,895 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 09:37:45" (3/3) ... [2025-02-05 21:37:45,896 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-63.i [2025-02-05 21:37:45,906 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 21:37:45,908 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-63.i that has 2 procedures, 238 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-05 21:37:45,961 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 21:37:45,971 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;@db37aab, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 21:37:45,972 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 21:37:45,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 238 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 162 states have internal predecessors, (247), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-05 21:37:45,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 21:37:45,990 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:45,991 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:45,991 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:45,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:45,995 INFO L85 PathProgramCache]: Analyzing trace with hash 2019800037, now seen corresponding path program 1 times [2025-02-05 21:37:46,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:46,000 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231686647] [2025-02-05 21:37:46,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:46,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:46,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:37:46,145 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:37:46,145 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:46,145 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:46,436 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 146 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-02-05 21:37:46,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:46,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231686647] [2025-02-05 21:37:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [231686647] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 21:37:46,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [835211760] [2025-02-05 21:37:46,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:46,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 21:37:46,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 21:37:46,444 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:37:46,445 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:37:46,563 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:37:46,727 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:37:46,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:46,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:46,734 INFO L256 TraceCheckSpWp]: Trace formula consists of 1076 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-05 21:37:46,750 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 21:37:46,798 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 146 proven. 0 refuted. 0 times theorem prover too weak. 10658 trivial. 0 not checked. [2025-02-05 21:37:46,798 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 21:37:46,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [835211760] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:46,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 21:37:46,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-05 21:37:46,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1627014232] [2025-02-05 21:37:46,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:46,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-05 21:37:46,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:46,819 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-05 21:37:46,819 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-05 21:37:46,821 INFO L87 Difference]: Start difference. First operand has 238 states, 161 states have (on average 1.5341614906832297) internal successors, (247), 162 states have internal predecessors, (247), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) Second operand has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-02-05 21:37:46,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:46,888 INFO L93 Difference]: Finished difference Result 470 states and 859 transitions. [2025-02-05 21:37:46,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-05 21:37:46,893 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) Word has length 476 [2025-02-05 21:37:46,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:46,903 INFO L225 Difference]: With dead ends: 470 [2025-02-05 21:37:46,904 INFO L226 Difference]: Without dead ends: 235 [2025-02-05 21:37:46,910 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 477 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:37:46,912 INFO L435 NwaCegarLoop]: 376 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:46,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 376 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:37:46,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2025-02-05 21:37:46,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 235. [2025-02-05 21:37:46,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 235 states, 159 states have (on average 1.5031446540880504) internal successors, (239), 159 states have internal predecessors, (239), 74 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 74 states have call predecessors, (74), 74 states have call successors, (74) [2025-02-05 21:37:46,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 235 states to 235 states and 387 transitions. [2025-02-05 21:37:46,979 INFO L78 Accepts]: Start accepts. Automaton has 235 states and 387 transitions. Word has length 476 [2025-02-05 21:37:46,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:46,980 INFO L471 AbstractCegarLoop]: Abstraction has 235 states and 387 transitions. [2025-02-05 21:37:46,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 55.5) internal successors, (111), 2 states have internal predecessors, (111), 2 states have call successors, (74), 2 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 2 states have call successors, (74) [2025-02-05 21:37:46,980 INFO L276 IsEmpty]: Start isEmpty. Operand 235 states and 387 transitions. [2025-02-05 21:37:46,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 21:37:46,987 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:46,987 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:46,997 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 21:37:47,188 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:37:47,188 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:47,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:47,189 INFO L85 PathProgramCache]: Analyzing trace with hash 1261162237, now seen corresponding path program 1 times [2025-02-05 21:37:47,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:47,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361621352] [2025-02-05 21:37:47,189 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:47,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:47,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:37:47,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:37:47,285 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:47,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:47,597 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:37:47,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:47,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361621352] [2025-02-05 21:37:47,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361621352] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:47,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:47,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:37:47,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226565999] [2025-02-05 21:37:47,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:47,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:37:47,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:47,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:37:47,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:47,600 INFO L87 Difference]: Start difference. First operand 235 states and 387 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:47,695 INFO L93 Difference]: Finished difference Result 615 states and 1010 transitions. [2025-02-05 21:37:47,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:37:47,696 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 476 [2025-02-05 21:37:47,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:47,700 INFO L225 Difference]: With dead ends: 615 [2025-02-05 21:37:47,700 INFO L226 Difference]: Without dead ends: 383 [2025-02-05 21:37:47,704 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:37:47,705 INFO L435 NwaCegarLoop]: 582 mSDtfsCounter, 237 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 941 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:47,705 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 941 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:37:47,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states. [2025-02-05 21:37:47,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 380. [2025-02-05 21:37:47,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 380 states, 265 states have (on average 1.5018867924528303) internal successors, (398), 266 states have internal predecessors, (398), 112 states have call successors, (112), 2 states have call predecessors, (112), 2 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2025-02-05 21:37:47,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 380 states to 380 states and 622 transitions. [2025-02-05 21:37:47,764 INFO L78 Accepts]: Start accepts. Automaton has 380 states and 622 transitions. Word has length 476 [2025-02-05 21:37:47,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:47,766 INFO L471 AbstractCegarLoop]: Abstraction has 380 states and 622 transitions. [2025-02-05 21:37:47,767 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 380 states and 622 transitions. [2025-02-05 21:37:47,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 21:37:47,773 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:47,773 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:47,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-05 21:37:47,773 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:47,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:47,776 INFO L85 PathProgramCache]: Analyzing trace with hash -1062865602, now seen corresponding path program 1 times [2025-02-05 21:37:47,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:47,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [903860877] [2025-02-05 21:37:47,777 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:47,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:47,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:37:47,874 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:37:47,874 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:47,874 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:48,150 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:37:48,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:48,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [903860877] [2025-02-05 21:37:48,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [903860877] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:48,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:48,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:37:48,151 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1744334560] [2025-02-05 21:37:48,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:48,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:37:48,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:48,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:37:48,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:48,153 INFO L87 Difference]: Start difference. First operand 380 states and 622 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:48,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:48,269 INFO L93 Difference]: Finished difference Result 1131 states and 1854 transitions. [2025-02-05 21:37:48,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:37:48,269 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 476 [2025-02-05 21:37:48,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:48,290 INFO L225 Difference]: With dead ends: 1131 [2025-02-05 21:37:48,292 INFO L226 Difference]: Without dead ends: 754 [2025-02-05 21:37:48,293 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:37:48,294 INFO L435 NwaCegarLoop]: 609 mSDtfsCounter, 358 mSDsluCounter, 367 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 976 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:48,295 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 976 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:37:48,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 754 states. [2025-02-05 21:37:48,399 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 754 to 748. [2025-02-05 21:37:48,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 748 states, 519 states have (on average 1.4913294797687862) internal successors, (774), 521 states have internal predecessors, (774), 224 states have call successors, (224), 4 states have call predecessors, (224), 4 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-02-05 21:37:48,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 748 states to 748 states and 1222 transitions. [2025-02-05 21:37:48,407 INFO L78 Accepts]: Start accepts. Automaton has 748 states and 1222 transitions. Word has length 476 [2025-02-05 21:37:48,407 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:48,407 INFO L471 AbstractCegarLoop]: Abstraction has 748 states and 1222 transitions. [2025-02-05 21:37:48,408 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:48,408 INFO L276 IsEmpty]: Start isEmpty. Operand 748 states and 1222 transitions. [2025-02-05 21:37:48,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 21:37:48,411 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:48,411 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:48,411 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 21:37:48,411 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:48,412 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:48,412 INFO L85 PathProgramCache]: Analyzing trace with hash -1413665539, now seen corresponding path program 1 times [2025-02-05 21:37:48,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:48,412 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370588778] [2025-02-05 21:37:48,412 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:48,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:48,436 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:37:48,466 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:37:48,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:48,467 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:48,665 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:37:48,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:48,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370588778] [2025-02-05 21:37:48,667 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370588778] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:48,667 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:48,667 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:37:48,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33179772] [2025-02-05 21:37:48,667 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:48,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:37:48,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:48,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:37:48,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:48,670 INFO L87 Difference]: Start difference. First operand 748 states and 1222 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:48,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:48,756 INFO L93 Difference]: Finished difference Result 1607 states and 2610 transitions. [2025-02-05 21:37:48,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:37:48,757 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 476 [2025-02-05 21:37:48,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:48,763 INFO L225 Difference]: With dead ends: 1607 [2025-02-05 21:37:48,763 INFO L226 Difference]: Without dead ends: 862 [2025-02-05 21:37:48,765 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:37:48,766 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 33 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 751 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:48,766 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 751 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:37:48,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 862 states. [2025-02-05 21:37:48,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 862 to 800. [2025-02-05 21:37:48,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 800 states, 571 states have (on average 1.4886164623467601) internal successors, (850), 573 states have internal predecessors, (850), 224 states have call successors, (224), 4 states have call predecessors, (224), 4 states have return successors, (224), 222 states have call predecessors, (224), 224 states have call successors, (224) [2025-02-05 21:37:48,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 800 states to 800 states and 1298 transitions. [2025-02-05 21:37:48,832 INFO L78 Accepts]: Start accepts. Automaton has 800 states and 1298 transitions. Word has length 476 [2025-02-05 21:37:48,833 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:48,833 INFO L471 AbstractCegarLoop]: Abstraction has 800 states and 1298 transitions. [2025-02-05 21:37:48,833 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:48,833 INFO L276 IsEmpty]: Start isEmpty. Operand 800 states and 1298 transitions. [2025-02-05 21:37:48,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 21:37:48,836 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:48,836 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:48,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-05 21:37:48,837 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:48,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:48,837 INFO L85 PathProgramCache]: Analyzing trace with hash -1057428195, now seen corresponding path program 1 times [2025-02-05 21:37:48,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:48,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [501702021] [2025-02-05 21:37:48,837 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:48,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:48,878 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:37:48,925 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:37:48,925 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:48,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:49,159 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:37:49,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:49,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [501702021] [2025-02-05 21:37:49,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [501702021] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:49,160 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:49,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:37:49,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083244016] [2025-02-05 21:37:49,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:49,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:37:49,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:49,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:37:49,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:37:49,163 INFO L87 Difference]: Start difference. First operand 800 states and 1298 transitions. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:49,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:49,408 INFO L93 Difference]: Finished difference Result 2673 states and 4311 transitions. [2025-02-05 21:37:49,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:37:49,409 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 476 [2025-02-05 21:37:49,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:49,422 INFO L225 Difference]: With dead ends: 2673 [2025-02-05 21:37:49,422 INFO L226 Difference]: Without dead ends: 1876 [2025-02-05 21:37:49,426 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:49,427 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 544 mSDsluCounter, 777 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1203 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:49,428 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1203 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:37:49,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1876 states. [2025-02-05 21:37:49,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1876 to 1864. [2025-02-05 21:37:49,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1864 states, 1479 states have (on average 1.524002704530088) internal successors, (2254), 1489 states have internal predecessors, (2254), 368 states have call successors, (368), 16 states have call predecessors, (368), 16 states have return successors, (368), 358 states have call predecessors, (368), 368 states have call successors, (368) [2025-02-05 21:37:49,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1864 states to 1864 states and 2990 transitions. [2025-02-05 21:37:49,572 INFO L78 Accepts]: Start accepts. Automaton has 1864 states and 2990 transitions. Word has length 476 [2025-02-05 21:37:49,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:49,573 INFO L471 AbstractCegarLoop]: Abstraction has 1864 states and 2990 transitions. [2025-02-05 21:37:49,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:49,573 INFO L276 IsEmpty]: Start isEmpty. Operand 1864 states and 2990 transitions. [2025-02-05 21:37:49,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 477 [2025-02-05 21:37:49,577 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:49,578 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:49,578 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-05 21:37:49,578 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:49,579 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:49,579 INFO L85 PathProgramCache]: Analyzing trace with hash -31936196, now seen corresponding path program 1 times [2025-02-05 21:37:49,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:49,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661720004] [2025-02-05 21:37:49,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:49,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:49,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 476 statements into 1 equivalence classes. [2025-02-05 21:37:49,641 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 476 of 476 statements. [2025-02-05 21:37:49,642 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:49,642 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:50,036 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:37:50,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:50,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661720004] [2025-02-05 21:37:50,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661720004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:50,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:50,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:37:50,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128830863] [2025-02-05 21:37:50,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:50,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:37:50,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:50,038 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:37:50,038 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:50,039 INFO L87 Difference]: Start difference. First operand 1864 states and 2990 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:50,160 INFO L93 Difference]: Finished difference Result 4665 states and 7494 transitions. [2025-02-05 21:37:50,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:37:50,161 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 476 [2025-02-05 21:37:50,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:50,177 INFO L225 Difference]: With dead ends: 4665 [2025-02-05 21:37:50,178 INFO L226 Difference]: Without dead ends: 2804 [2025-02-05 21:37:50,183 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:37:50,184 INFO L435 NwaCegarLoop]: 372 mSDtfsCounter, 251 mSDsluCounter, 365 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:50,184 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 737 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:37:50,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2804 states. [2025-02-05 21:37:50,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2804 to 2794. [2025-02-05 21:37:50,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2794 states, 2217 states have (on average 1.5245827695083447) internal successors, (3380), 2232 states have internal predecessors, (3380), 552 states have call successors, (552), 24 states have call predecessors, (552), 24 states have return successors, (552), 537 states have call predecessors, (552), 552 states have call successors, (552) [2025-02-05 21:37:50,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2794 states to 2794 states and 4484 transitions. [2025-02-05 21:37:50,350 INFO L78 Accepts]: Start accepts. Automaton has 2794 states and 4484 transitions. Word has length 476 [2025-02-05 21:37:50,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:50,351 INFO L471 AbstractCegarLoop]: Abstraction has 2794 states and 4484 transitions. [2025-02-05 21:37:50,351 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:50,351 INFO L276 IsEmpty]: Start isEmpty. Operand 2794 states and 4484 transitions. [2025-02-05 21:37:50,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 478 [2025-02-05 21:37:50,357 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:50,357 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:50,358 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-05 21:37:50,358 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:50,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:50,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1871507786, now seen corresponding path program 1 times [2025-02-05 21:37:50,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:50,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642874126] [2025-02-05 21:37:50,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:50,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:50,386 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 477 statements into 1 equivalence classes. [2025-02-05 21:37:50,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 477 of 477 statements. [2025-02-05 21:37:50,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:50,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:50,768 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:37:50,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:50,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642874126] [2025-02-05 21:37:50,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642874126] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:50,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:50,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:37:50,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1283202300] [2025-02-05 21:37:50,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:50,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:37:50,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:50,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:37:50,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:37:50,770 INFO L87 Difference]: Start difference. First operand 2794 states and 4484 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:50,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:50,922 INFO L93 Difference]: Finished difference Result 5653 states and 9053 transitions. [2025-02-05 21:37:50,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:37:50,922 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 477 [2025-02-05 21:37:50,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:50,937 INFO L225 Difference]: With dead ends: 5653 [2025-02-05 21:37:50,938 INFO L226 Difference]: Without dead ends: 2862 [2025-02-05 21:37:50,945 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:37:50,945 INFO L435 NwaCegarLoop]: 438 mSDtfsCounter, 229 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 229 SdHoareTripleChecker+Valid, 657 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:37:50,946 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [229 Valid, 657 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:37:50,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2862 states. [2025-02-05 21:37:51,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2862 to 2861. [2025-02-05 21:37:51,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2861 states, 2252 states have (on average 1.5124333925399644) internal successors, (3406), 2268 states have internal predecessors, (3406), 578 states have call successors, (578), 30 states have call predecessors, (578), 30 states have return successors, (578), 562 states have call predecessors, (578), 578 states have call successors, (578) [2025-02-05 21:37:51,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2861 states to 2861 states and 4562 transitions. [2025-02-05 21:37:51,096 INFO L78 Accepts]: Start accepts. Automaton has 2861 states and 4562 transitions. Word has length 477 [2025-02-05 21:37:51,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:51,097 INFO L471 AbstractCegarLoop]: Abstraction has 2861 states and 4562 transitions. [2025-02-05 21:37:51,097 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:51,097 INFO L276 IsEmpty]: Start isEmpty. Operand 2861 states and 4562 transitions. [2025-02-05 21:37:51,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2025-02-05 21:37:51,102 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:51,102 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:51,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-05 21:37:51,103 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:51,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:51,103 INFO L85 PathProgramCache]: Analyzing trace with hash -659002625, now seen corresponding path program 1 times [2025-02-05 21:37:51,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:51,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513050859] [2025-02-05 21:37:51,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:51,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:51,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 478 statements into 1 equivalence classes. [2025-02-05 21:37:51,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 478 of 478 statements. [2025-02-05 21:37:51,175 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:51,175 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:51,606 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:37:51,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:51,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513050859] [2025-02-05 21:37:51,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513050859] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:51,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:51,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:37:51,607 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574953266] [2025-02-05 21:37:51,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:51,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:37:51,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:51,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:37:51,609 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:51,609 INFO L87 Difference]: Start difference. First operand 2861 states and 4562 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:52,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:52,637 INFO L93 Difference]: Finished difference Result 8401 states and 13452 transitions. [2025-02-05 21:37:52,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:37:52,640 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 478 [2025-02-05 21:37:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:52,668 INFO L225 Difference]: With dead ends: 8401 [2025-02-05 21:37:52,668 INFO L226 Difference]: Without dead ends: 5586 [2025-02-05 21:37:52,677 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 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:37:52,678 INFO L435 NwaCegarLoop]: 706 mSDtfsCounter, 751 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 575 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 751 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 582 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:52,678 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [751 Valid, 1310 Invalid, 582 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 575 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-02-05 21:37:52,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5586 states. [2025-02-05 21:37:52,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5586 to 3656. [2025-02-05 21:37:52,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 2853 states have (on average 1.4738871363477042) internal successors, (4205), 2875 states have internal predecessors, (4205), 762 states have call successors, (762), 40 states have call predecessors, (762), 40 states have return successors, (762), 740 states have call predecessors, (762), 762 states have call successors, (762) [2025-02-05 21:37:52,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 5729 transitions. [2025-02-05 21:37:52,974 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 5729 transitions. Word has length 478 [2025-02-05 21:37:52,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:52,976 INFO L471 AbstractCegarLoop]: Abstraction has 3656 states and 5729 transitions. [2025-02-05 21:37:52,976 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:52,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 5729 transitions. [2025-02-05 21:37:52,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-02-05 21:37:52,982 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:52,983 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:52,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-05 21:37:52,983 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:52,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:52,984 INFO L85 PathProgramCache]: Analyzing trace with hash 343352408, now seen corresponding path program 1 times [2025-02-05 21:37:52,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:52,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431748393] [2025-02-05 21:37:52,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:52,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:53,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-02-05 21:37:53,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-02-05 21:37:53,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:53,063 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:53,652 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:37:53,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:53,652 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431748393] [2025-02-05 21:37:53,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431748393] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:53,652 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:53,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:37:53,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [668734717] [2025-02-05 21:37:53,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:53,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:37:53,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:53,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:37:53,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:37:53,654 INFO L87 Difference]: Start difference. First operand 3656 states and 5729 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:54,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:54,605 INFO L93 Difference]: Finished difference Result 10204 states and 15999 transitions. [2025-02-05 21:37:54,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:37:54,606 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 479 [2025-02-05 21:37:54,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:54,640 INFO L225 Difference]: With dead ends: 10204 [2025-02-05 21:37:54,640 INFO L226 Difference]: Without dead ends: 6594 [2025-02-05 21:37:54,652 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:37:54,653 INFO L435 NwaCegarLoop]: 703 mSDtfsCounter, 364 mSDsluCounter, 2125 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 364 SdHoareTripleChecker+Valid, 2828 SdHoareTripleChecker+Invalid, 504 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:54,653 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [364 Valid, 2828 Invalid, 504 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 21:37:54,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6594 states. [2025-02-05 21:37:55,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6594 to 3878. [2025-02-05 21:37:55,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3878 states, 3075 states have (on average 1.4689430894308944) internal successors, (4517), 3097 states have internal predecessors, (4517), 762 states have call successors, (762), 40 states have call predecessors, (762), 40 states have return successors, (762), 740 states have call predecessors, (762), 762 states have call successors, (762) [2025-02-05 21:37:55,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3878 states to 3878 states and 6041 transitions. [2025-02-05 21:37:55,049 INFO L78 Accepts]: Start accepts. Automaton has 3878 states and 6041 transitions. Word has length 479 [2025-02-05 21:37:55,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:55,050 INFO L471 AbstractCegarLoop]: Abstraction has 3878 states and 6041 transitions. [2025-02-05 21:37:55,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:55,050 INFO L276 IsEmpty]: Start isEmpty. Operand 3878 states and 6041 transitions. [2025-02-05 21:37:55,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-02-05 21:37:55,056 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:55,056 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:55,056 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 21:37:55,057 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:55,057 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:55,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1964791710, now seen corresponding path program 1 times [2025-02-05 21:37:55,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:55,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006812415] [2025-02-05 21:37:55,057 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:55,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:55,078 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-02-05 21:37:55,193 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-02-05 21:37:55,194 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:55,194 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:55,510 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:37:55,510 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:55,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006812415] [2025-02-05 21:37:55,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006812415] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:55,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:55,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 21:37:55,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2061821527] [2025-02-05 21:37:55,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:55,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 21:37:55,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:55,512 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 21:37:55,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 21:37:55,517 INFO L87 Difference]: Start difference. First operand 3878 states and 6041 transitions. Second operand has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:56,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:37:56,312 INFO L93 Difference]: Finished difference Result 18440 states and 28597 transitions. [2025-02-05 21:37:56,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:37:56,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 479 [2025-02-05 21:37:56,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:37:56,372 INFO L225 Difference]: With dead ends: 18440 [2025-02-05 21:37:56,372 INFO L226 Difference]: Without dead ends: 14608 [2025-02-05 21:37:56,388 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:37:56,389 INFO L435 NwaCegarLoop]: 370 mSDtfsCounter, 920 mSDsluCounter, 1086 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 920 SdHoareTripleChecker+Valid, 1456 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:37:56,389 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [920 Valid, 1456 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:37:56,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14608 states. [2025-02-05 21:37:57,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14608 to 13428. [2025-02-05 21:37:57,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13428 states, 11103 states have (on average 1.4845537242186797) internal successors, (16483), 11176 states have internal predecessors, (16483), 2194 states have call successors, (2194), 130 states have call predecessors, (2194), 130 states have return successors, (2194), 2121 states have call predecessors, (2194), 2194 states have call successors, (2194) [2025-02-05 21:37:57,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13428 states to 13428 states and 20871 transitions. [2025-02-05 21:37:57,282 INFO L78 Accepts]: Start accepts. Automaton has 13428 states and 20871 transitions. Word has length 479 [2025-02-05 21:37:57,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:37:57,283 INFO L471 AbstractCegarLoop]: Abstraction has 13428 states and 20871 transitions. [2025-02-05 21:37:57,284 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.0) internal successors, (112), 4 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:37:57,284 INFO L276 IsEmpty]: Start isEmpty. Operand 13428 states and 20871 transitions. [2025-02-05 21:37:57,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-02-05 21:37:57,294 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:37:57,295 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:57,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-05 21:37:57,295 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:37:57,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:37:57,296 INFO L85 PathProgramCache]: Analyzing trace with hash -720027229, now seen corresponding path program 1 times [2025-02-05 21:37:57,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:37:57,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378688106] [2025-02-05 21:37:57,296 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:37:57,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:37:57,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-02-05 21:37:57,342 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-02-05 21:37:57,342 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:37:57,342 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:37:57,759 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:37:57,759 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:37:57,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378688106] [2025-02-05 21:37:57,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378688106] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:37:57,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:37:57,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:37:57,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849405992] [2025-02-05 21:37:57,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:37:57,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:37:57,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:37:57,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:37:57,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:37:57,760 INFO L87 Difference]: Start difference. First operand 13428 states and 20871 transitions. Second operand has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:00,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:00,997 INFO L93 Difference]: Finished difference Result 47663 states and 74676 transitions. [2025-02-05 21:38:00,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:38:00,998 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 479 [2025-02-05 21:38:00,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:01,105 INFO L225 Difference]: With dead ends: 47663 [2025-02-05 21:38:01,106 INFO L226 Difference]: Without dead ends: 34281 [2025-02-05 21:38:01,149 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:38:01,150 INFO L435 NwaCegarLoop]: 1036 mSDtfsCounter, 1190 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 649 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1190 SdHoareTripleChecker+Valid, 2984 SdHoareTripleChecker+Invalid, 947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 649 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:01,150 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1190 Valid, 2984 Invalid, 947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 649 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2025-02-05 21:38:01,181 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34281 states. [2025-02-05 21:38:02,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34281 to 14379. [2025-02-05 21:38:02,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14379 states, 12166 states have (on average 1.470327141213217) internal successors, (17888), 12233 states have internal predecessors, (17888), 2090 states have call successors, (2090), 122 states have call predecessors, (2090), 122 states have return successors, (2090), 2023 states have call predecessors, (2090), 2090 states have call successors, (2090) [2025-02-05 21:38:02,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14379 states to 14379 states and 22068 transitions. [2025-02-05 21:38:02,451 INFO L78 Accepts]: Start accepts. Automaton has 14379 states and 22068 transitions. Word has length 479 [2025-02-05 21:38:02,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:02,452 INFO L471 AbstractCegarLoop]: Abstraction has 14379 states and 22068 transitions. [2025-02-05 21:38:02,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.666666666666668) internal successors, (112), 6 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 14379 states and 22068 transitions. [2025-02-05 21:38:02,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-02-05 21:38:02,466 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:02,466 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:02,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-05 21:38:02,467 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:02,467 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:02,467 INFO L85 PathProgramCache]: Analyzing trace with hash 787524580, now seen corresponding path program 1 times [2025-02-05 21:38:02,467 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:02,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568633975] [2025-02-05 21:38:02,468 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:02,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:02,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-02-05 21:38:02,543 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-02-05 21:38:02,543 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:02,543 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:03,105 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:03,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:03,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568633975] [2025-02-05 21:38:03,105 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [568633975] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:03,105 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:03,105 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:38:03,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373746243] [2025-02-05 21:38:03,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:03,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:38:03,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:03,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:38:03,106 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:38:03,106 INFO L87 Difference]: Start difference. First operand 14379 states and 22068 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:04,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:04,153 INFO L93 Difference]: Finished difference Result 32811 states and 49338 transitions. [2025-02-05 21:38:04,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:38:04,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 479 [2025-02-05 21:38:04,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:04,208 INFO L225 Difference]: With dead ends: 32811 [2025-02-05 21:38:04,208 INFO L226 Difference]: Without dead ends: 18561 [2025-02-05 21:38:04,232 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:38:04,233 INFO L435 NwaCegarLoop]: 380 mSDtfsCounter, 97 mSDsluCounter, 1430 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 1810 SdHoareTripleChecker+Invalid, 320 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:04,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 1810 Invalid, 320 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:38:04,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18561 states. [2025-02-05 21:38:05,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18561 to 14667. [2025-02-05 21:38:05,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14667 states, 12454 states have (on average 1.418981853219849) internal successors, (17672), 12521 states have internal predecessors, (17672), 2090 states have call successors, (2090), 122 states have call predecessors, (2090), 122 states have return successors, (2090), 2023 states have call predecessors, (2090), 2090 states have call successors, (2090) [2025-02-05 21:38:05,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14667 states to 14667 states and 21852 transitions. [2025-02-05 21:38:05,558 INFO L78 Accepts]: Start accepts. Automaton has 14667 states and 21852 transitions. Word has length 479 [2025-02-05 21:38:05,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:05,559 INFO L471 AbstractCegarLoop]: Abstraction has 14667 states and 21852 transitions. [2025-02-05 21:38:05,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 8 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:05,559 INFO L276 IsEmpty]: Start isEmpty. Operand 14667 states and 21852 transitions. [2025-02-05 21:38:05,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 480 [2025-02-05 21:38:05,575 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:05,575 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:05,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-05 21:38:05,575 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:05,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:05,576 INFO L85 PathProgramCache]: Analyzing trace with hash 1375626342, now seen corresponding path program 1 times [2025-02-05 21:38:05,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:05,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345639046] [2025-02-05 21:38:05,576 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:05,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:05,602 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 479 statements into 1 equivalence classes. [2025-02-05 21:38:05,625 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 479 of 479 statements. [2025-02-05 21:38:05,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:05,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:05,758 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:05,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:05,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345639046] [2025-02-05 21:38:05,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345639046] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:05,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:05,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:38:05,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242238750] [2025-02-05 21:38:05,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:05,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:38:05,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:05,760 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:38:05,760 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:38:05,760 INFO L87 Difference]: Start difference. First operand 14667 states and 21852 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:07,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:07,173 INFO L93 Difference]: Finished difference Result 38919 states and 58386 transitions. [2025-02-05 21:38:07,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:38:07,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 479 [2025-02-05 21:38:07,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:07,256 INFO L225 Difference]: With dead ends: 38919 [2025-02-05 21:38:07,257 INFO L226 Difference]: Without dead ends: 24381 [2025-02-05 21:38:07,288 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:38:07,289 INFO L435 NwaCegarLoop]: 390 mSDtfsCounter, 363 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 363 SdHoareTripleChecker+Valid, 747 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:07,289 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [363 Valid, 747 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:38:07,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24381 states. [2025-02-05 21:38:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24381 to 14883. [2025-02-05 21:38:08,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14883 states, 12670 states have (on average 1.406156274664562) internal successors, (17816), 12737 states have internal predecessors, (17816), 2090 states have call successors, (2090), 122 states have call predecessors, (2090), 122 states have return successors, (2090), 2023 states have call predecessors, (2090), 2090 states have call successors, (2090) [2025-02-05 21:38:08,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14883 states to 14883 states and 21996 transitions. [2025-02-05 21:38:08,286 INFO L78 Accepts]: Start accepts. Automaton has 14883 states and 21996 transitions. Word has length 479 [2025-02-05 21:38:08,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:08,287 INFO L471 AbstractCegarLoop]: Abstraction has 14883 states and 21996 transitions. [2025-02-05 21:38:08,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 14883 states and 21996 transitions. [2025-02-05 21:38:08,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-05 21:38:08,298 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:08,298 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:08,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-05 21:38:08,299 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:08,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:08,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1388996193, now seen corresponding path program 1 times [2025-02-05 21:38:08,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:08,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417116221] [2025-02-05 21:38:08,299 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:08,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:08,316 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-05 21:38:08,385 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-05 21:38:08,385 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:08,385 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:08,789 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:08,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:08,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417116221] [2025-02-05 21:38:08,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417116221] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:08,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:08,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:38:08,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669377331] [2025-02-05 21:38:08,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:08,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:38:08,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:08,790 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:38:08,790 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:38:08,790 INFO L87 Difference]: Start difference. First operand 14883 states and 21996 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:11,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:11,023 INFO L93 Difference]: Finished difference Result 39667 states and 60021 transitions. [2025-02-05 21:38:11,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:38:11,023 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 480 [2025-02-05 21:38:11,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:11,105 INFO L225 Difference]: With dead ends: 39667 [2025-02-05 21:38:11,106 INFO L226 Difference]: Without dead ends: 24913 [2025-02-05 21:38:11,135 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:38:11,135 INFO L435 NwaCegarLoop]: 1044 mSDtfsCounter, 988 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 988 SdHoareTripleChecker+Valid, 1579 SdHoareTripleChecker+Invalid, 395 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:11,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [988 Valid, 1579 Invalid, 395 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:38:11,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24913 states. [2025-02-05 21:38:12,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24913 to 13659. [2025-02-05 21:38:12,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13659 states, 11446 states have (on average 1.4181373405556525) internal successors, (16232), 11513 states have internal predecessors, (16232), 2090 states have call successors, (2090), 122 states have call predecessors, (2090), 122 states have return successors, (2090), 2023 states have call predecessors, (2090), 2090 states have call successors, (2090) [2025-02-05 21:38:12,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13659 states to 13659 states and 20412 transitions. [2025-02-05 21:38:12,395 INFO L78 Accepts]: Start accepts. Automaton has 13659 states and 20412 transitions. Word has length 480 [2025-02-05 21:38:12,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:12,396 INFO L471 AbstractCegarLoop]: Abstraction has 13659 states and 20412 transitions. [2025-02-05 21:38:12,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:12,396 INFO L276 IsEmpty]: Start isEmpty. Operand 13659 states and 20412 transitions. [2025-02-05 21:38:12,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-05 21:38:12,405 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:12,405 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:12,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-05 21:38:12,406 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:12,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:12,406 INFO L85 PathProgramCache]: Analyzing trace with hash -1023563512, now seen corresponding path program 1 times [2025-02-05 21:38:12,406 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:12,406 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400182070] [2025-02-05 21:38:12,406 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:12,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:12,423 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-05 21:38:12,469 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-05 21:38:12,469 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:12,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:13,033 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:13,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:13,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400182070] [2025-02-05 21:38:13,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [400182070] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:13,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:13,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:38:13,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177189423] [2025-02-05 21:38:13,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:13,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:38:13,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:13,035 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:38:13,035 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:38:13,035 INFO L87 Difference]: Start difference. First operand 13659 states and 20412 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:14,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:14,174 INFO L93 Difference]: Finished difference Result 31227 states and 45666 transitions. [2025-02-05 21:38:14,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:38:14,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 480 [2025-02-05 21:38:14,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:14,228 INFO L225 Difference]: With dead ends: 31227 [2025-02-05 21:38:14,229 INFO L226 Difference]: Without dead ends: 17697 [2025-02-05 21:38:14,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:38:14,255 INFO L435 NwaCegarLoop]: 392 mSDtfsCounter, 99 mSDsluCounter, 816 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 1208 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:14,255 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 1208 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:38:14,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17697 states. [2025-02-05 21:38:15,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17697 to 13803. [2025-02-05 21:38:15,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13803 states, 11590 states have (on average 1.4191544434857637) internal successors, (16448), 11657 states have internal predecessors, (16448), 2090 states have call successors, (2090), 122 states have call predecessors, (2090), 122 states have return successors, (2090), 2023 states have call predecessors, (2090), 2090 states have call successors, (2090) [2025-02-05 21:38:15,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13803 states to 13803 states and 20628 transitions. [2025-02-05 21:38:15,291 INFO L78 Accepts]: Start accepts. Automaton has 13803 states and 20628 transitions. Word has length 480 [2025-02-05 21:38:15,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:15,292 INFO L471 AbstractCegarLoop]: Abstraction has 13803 states and 20628 transitions. [2025-02-05 21:38:15,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:15,292 INFO L276 IsEmpty]: Start isEmpty. Operand 13803 states and 20628 transitions. [2025-02-05 21:38:15,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-05 21:38:15,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:15,302 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:15,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-05 21:38:15,302 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:15,302 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:15,302 INFO L85 PathProgramCache]: Analyzing trace with hash 2139587394, now seen corresponding path program 1 times [2025-02-05 21:38:15,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:15,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199549965] [2025-02-05 21:38:15,303 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:15,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:15,319 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-05 21:38:15,392 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-05 21:38:15,392 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:15,392 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:16,064 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:16,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:16,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199549965] [2025-02-05 21:38:16,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199549965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:16,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:16,064 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:38:16,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974675446] [2025-02-05 21:38:16,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:16,065 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:38:16,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:16,065 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:38:16,065 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:38:16,065 INFO L87 Difference]: Start difference. First operand 13803 states and 20628 transitions. Second operand has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:17,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:17,099 INFO L93 Difference]: Finished difference Result 34251 states and 50059 transitions. [2025-02-05 21:38:17,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:38:17,099 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 480 [2025-02-05 21:38:17,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:17,147 INFO L225 Difference]: With dead ends: 34251 [2025-02-05 21:38:17,147 INFO L226 Difference]: Without dead ends: 20577 [2025-02-05 21:38:17,166 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:38:17,167 INFO L435 NwaCegarLoop]: 362 mSDtfsCounter, 65 mSDsluCounter, 1051 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 1413 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:17,167 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 1413 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:38:17,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20577 states. [2025-02-05 21:38:18,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20577 to 20503. [2025-02-05 21:38:18,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20503 states, 18073 states have (on average 1.3803463730426604) internal successors, (24947), 18212 states have internal predecessors, (24947), 2234 states have call successors, (2234), 195 states have call predecessors, (2234), 195 states have return successors, (2234), 2095 states have call predecessors, (2234), 2234 states have call successors, (2234) [2025-02-05 21:38:18,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20503 states to 20503 states and 29415 transitions. [2025-02-05 21:38:18,143 INFO L78 Accepts]: Start accepts. Automaton has 20503 states and 29415 transitions. Word has length 480 [2025-02-05 21:38:18,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:18,143 INFO L471 AbstractCegarLoop]: Abstraction has 20503 states and 29415 transitions. [2025-02-05 21:38:18,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 22.6) internal successors, (113), 5 states have internal predecessors, (113), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:18,144 INFO L276 IsEmpty]: Start isEmpty. Operand 20503 states and 29415 transitions. [2025-02-05 21:38:18,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 481 [2025-02-05 21:38:18,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:18,157 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:18,157 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-05 21:38:18,157 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:18,158 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:18,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1629053217, now seen corresponding path program 1 times [2025-02-05 21:38:18,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:18,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1916975260] [2025-02-05 21:38:18,158 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:18,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:18,174 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 480 statements into 1 equivalence classes. [2025-02-05 21:38:18,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 480 of 480 statements. [2025-02-05 21:38:18,202 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:18,202 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:18,605 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:18,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:18,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1916975260] [2025-02-05 21:38:18,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1916975260] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:18,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:18,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 21:38:18,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194313527] [2025-02-05 21:38:18,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:18,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 21:38:18,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:18,607 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 21:38:18,607 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 21:38:18,608 INFO L87 Difference]: Start difference. First operand 20503 states and 29415 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:21,025 INFO L93 Difference]: Finished difference Result 51595 states and 74589 transitions. [2025-02-05 21:38:21,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 21:38:21,025 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 480 [2025-02-05 21:38:21,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:21,104 INFO L225 Difference]: With dead ends: 51595 [2025-02-05 21:38:21,104 INFO L226 Difference]: Without dead ends: 31225 [2025-02-05 21:38:21,127 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:38:21,129 INFO L435 NwaCegarLoop]: 714 mSDtfsCounter, 353 mSDsluCounter, 2153 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 353 SdHoareTripleChecker+Valid, 2867 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:21,129 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [353 Valid, 2867 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-05 21:38:21,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31225 states. [2025-02-05 21:38:22,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31225 to 21655. [2025-02-05 21:38:22,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21655 states, 19225 states have (on average 1.3650455136540962) internal successors, (26243), 19364 states have internal predecessors, (26243), 2234 states have call successors, (2234), 195 states have call predecessors, (2234), 195 states have return successors, (2234), 2095 states have call predecessors, (2234), 2234 states have call successors, (2234) [2025-02-05 21:38:22,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21655 states to 21655 states and 30711 transitions. [2025-02-05 21:38:22,744 INFO L78 Accepts]: Start accepts. Automaton has 21655 states and 30711 transitions. Word has length 480 [2025-02-05 21:38:22,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:22,745 INFO L471 AbstractCegarLoop]: Abstraction has 21655 states and 30711 transitions. [2025-02-05 21:38:22,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 6 states have internal predecessors, (113), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:22,745 INFO L276 IsEmpty]: Start isEmpty. Operand 21655 states and 30711 transitions. [2025-02-05 21:38:22,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-05 21:38:22,756 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:22,756 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:22,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-05 21:38:22,756 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:22,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:22,757 INFO L85 PathProgramCache]: Analyzing trace with hash 1540992315, now seen corresponding path program 1 times [2025-02-05 21:38:22,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:22,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548476054] [2025-02-05 21:38:22,757 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:22,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:22,775 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 21:38:22,815 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 21:38:22,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:22,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:23,185 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:23,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:23,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548476054] [2025-02-05 21:38:23,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548476054] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:23,186 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:23,186 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:38:23,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631946014] [2025-02-05 21:38:23,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:23,186 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:38:23,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:23,187 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:38:23,188 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:38:23,188 INFO L87 Difference]: Start difference. First operand 21655 states and 30711 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:30,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:30,090 INFO L93 Difference]: Finished difference Result 91139 states and 131424 transitions. [2025-02-05 21:38:30,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-05 21:38:30,091 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 481 [2025-02-05 21:38:30,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:30,222 INFO L225 Difference]: With dead ends: 91139 [2025-02-05 21:38:30,222 INFO L226 Difference]: Without dead ends: 69617 [2025-02-05 21:38:30,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2025-02-05 21:38:30,250 INFO L435 NwaCegarLoop]: 686 mSDtfsCounter, 1919 mSDsluCounter, 2988 mSDsCounter, 0 mSdLazyCounter, 1035 mSolverCounterSat, 1041 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1919 SdHoareTripleChecker+Valid, 3674 SdHoareTripleChecker+Invalid, 2076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1041 IncrementalHoareTripleChecker+Valid, 1035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:30,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1919 Valid, 3674 Invalid, 2076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1041 Valid, 1035 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-02-05 21:38:30,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69617 states. [2025-02-05 21:38:32,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69617 to 23959. [2025-02-05 21:38:32,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23959 states, 21529 states have (on average 1.372799479771471) internal successors, (29555), 21668 states have internal predecessors, (29555), 2234 states have call successors, (2234), 195 states have call predecessors, (2234), 195 states have return successors, (2234), 2095 states have call predecessors, (2234), 2234 states have call successors, (2234) [2025-02-05 21:38:32,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23959 states to 23959 states and 34023 transitions. [2025-02-05 21:38:32,547 INFO L78 Accepts]: Start accepts. Automaton has 23959 states and 34023 transitions. Word has length 481 [2025-02-05 21:38:32,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:32,547 INFO L471 AbstractCegarLoop]: Abstraction has 23959 states and 34023 transitions. [2025-02-05 21:38:32,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:32,548 INFO L276 IsEmpty]: Start isEmpty. Operand 23959 states and 34023 transitions. [2025-02-05 21:38:32,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-05 21:38:32,563 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:32,564 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:32,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2025-02-05 21:38:32,564 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:32,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:32,564 INFO L85 PathProgramCache]: Analyzing trace with hash -266462148, now seen corresponding path program 1 times [2025-02-05 21:38:32,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:32,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541622559] [2025-02-05 21:38:32,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:32,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:32,581 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 21:38:32,614 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 21:38:32,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:32,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:33,084 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:33,085 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:33,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541622559] [2025-02-05 21:38:33,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541622559] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:33,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:33,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:38:33,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832644624] [2025-02-05 21:38:33,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:33,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:38:33,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:33,086 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:38:33,086 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:38:33,087 INFO L87 Difference]: Start difference. First operand 23959 states and 34023 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:35,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:35,139 INFO L93 Difference]: Finished difference Result 55711 states and 77637 transitions. [2025-02-05 21:38:35,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:38:35,140 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 481 [2025-02-05 21:38:35,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:35,207 INFO L225 Difference]: With dead ends: 55711 [2025-02-05 21:38:35,207 INFO L226 Difference]: Without dead ends: 31885 [2025-02-05 21:38:35,238 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:38:35,239 INFO L435 NwaCegarLoop]: 401 mSDtfsCounter, 83 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 331 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 1914 SdHoareTripleChecker+Invalid, 333 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:35,239 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 1914 Invalid, 333 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 331 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:38:35,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31885 states. [2025-02-05 21:38:37,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31885 to 22951. [2025-02-05 21:38:37,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22951 states, 20521 states have (on average 1.3770771404902296) internal successors, (28259), 20660 states have internal predecessors, (28259), 2234 states have call successors, (2234), 195 states have call predecessors, (2234), 195 states have return successors, (2234), 2095 states have call predecessors, (2234), 2234 states have call successors, (2234) [2025-02-05 21:38:37,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22951 states to 22951 states and 32727 transitions. [2025-02-05 21:38:37,615 INFO L78 Accepts]: Start accepts. Automaton has 22951 states and 32727 transitions. Word has length 481 [2025-02-05 21:38:37,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:37,615 INFO L471 AbstractCegarLoop]: Abstraction has 22951 states and 32727 transitions. [2025-02-05 21:38:37,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 22951 states and 32727 transitions. [2025-02-05 21:38:37,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-05 21:38:37,630 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:37,631 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:37,631 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-02-05 21:38:37,631 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:37,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:37,632 INFO L85 PathProgramCache]: Analyzing trace with hash 640541015, now seen corresponding path program 1 times [2025-02-05 21:38:37,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:37,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235346556] [2025-02-05 21:38:37,632 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:37,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:37,648 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 21:38:37,662 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 21:38:37,662 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:37,662 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:37,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:37,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235346556] [2025-02-05 21:38:37,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235346556] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:37,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:37,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:38:37,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055949787] [2025-02-05 21:38:37,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:37,723 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:38:37,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:37,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:38:37,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:38:37,723 INFO L87 Difference]: Start difference. First operand 22951 states and 32727 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:40,417 INFO L93 Difference]: Finished difference Result 59083 states and 84381 transitions. [2025-02-05 21:38:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:38:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 481 [2025-02-05 21:38:40,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:40,488 INFO L225 Difference]: With dead ends: 59083 [2025-02-05 21:38:40,488 INFO L226 Difference]: Without dead ends: 36265 [2025-02-05 21:38:40,522 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:38:40,522 INFO L435 NwaCegarLoop]: 373 mSDtfsCounter, 370 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 728 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:40,522 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 728 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 21:38:40,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36265 states. [2025-02-05 21:38:42,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36265 to 26551. [2025-02-05 21:38:42,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26551 states, 24121 states have (on average 1.3506488122382985) internal successors, (32579), 24260 states have internal predecessors, (32579), 2234 states have call successors, (2234), 195 states have call predecessors, (2234), 195 states have return successors, (2234), 2095 states have call predecessors, (2234), 2234 states have call successors, (2234) [2025-02-05 21:38:42,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26551 states to 26551 states and 37047 transitions. [2025-02-05 21:38:42,225 INFO L78 Accepts]: Start accepts. Automaton has 26551 states and 37047 transitions. Word has length 481 [2025-02-05 21:38:42,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:42,226 INFO L471 AbstractCegarLoop]: Abstraction has 26551 states and 37047 transitions. [2025-02-05 21:38:42,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:42,226 INFO L276 IsEmpty]: Start isEmpty. Operand 26551 states and 37047 transitions. [2025-02-05 21:38:42,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-05 21:38:42,242 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:42,242 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:42,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-05 21:38:42,243 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:42,243 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:42,243 INFO L85 PathProgramCache]: Analyzing trace with hash -765468597, now seen corresponding path program 1 times [2025-02-05 21:38:42,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:42,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662766642] [2025-02-05 21:38:42,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:42,258 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 21:38:42,270 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 21:38:42,270 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:42,270 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:42,356 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:42,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:42,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662766642] [2025-02-05 21:38:42,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1662766642] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:42,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:42,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-05 21:38:42,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600146084] [2025-02-05 21:38:42,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:42,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-05 21:38:42,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:42,358 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-05 21:38:42,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-05 21:38:42,359 INFO L87 Difference]: Start difference. First operand 26551 states and 37047 transitions. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:45,635 INFO L93 Difference]: Finished difference Result 62395 states and 88125 transitions. [2025-02-05 21:38:45,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-05 21:38:45,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 481 [2025-02-05 21:38:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:45,693 INFO L225 Difference]: With dead ends: 62395 [2025-02-05 21:38:45,693 INFO L226 Difference]: Without dead ends: 35977 [2025-02-05 21:38:45,711 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:38:45,711 INFO L435 NwaCegarLoop]: 708 mSDtfsCounter, 355 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:45,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [355 Valid, 1067 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:38:45,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35977 states. [2025-02-05 21:38:47,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35977 to 24823. [2025-02-05 21:38:47,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24823 states, 22393 states have (on average 1.3391238333407762) internal successors, (29987), 22532 states have internal predecessors, (29987), 2234 states have call successors, (2234), 195 states have call predecessors, (2234), 195 states have return successors, (2234), 2095 states have call predecessors, (2234), 2234 states have call successors, (2234) [2025-02-05 21:38:47,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24823 states to 24823 states and 34455 transitions. [2025-02-05 21:38:47,284 INFO L78 Accepts]: Start accepts. Automaton has 24823 states and 34455 transitions. Word has length 481 [2025-02-05 21:38:47,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:47,285 INFO L471 AbstractCegarLoop]: Abstraction has 24823 states and 34455 transitions. [2025-02-05 21:38:47,285 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:47,285 INFO L276 IsEmpty]: Start isEmpty. Operand 24823 states and 34455 transitions. [2025-02-05 21:38:47,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 482 [2025-02-05 21:38:47,299 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:47,299 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:47,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2025-02-05 21:38:47,300 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:47,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:47,300 INFO L85 PathProgramCache]: Analyzing trace with hash -2071340980, now seen corresponding path program 1 times [2025-02-05 21:38:47,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:47,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364953140] [2025-02-05 21:38:47,300 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:47,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:47,315 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 481 statements into 1 equivalence classes. [2025-02-05 21:38:47,345 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 481 of 481 statements. [2025-02-05 21:38:47,345 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:47,346 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:47,790 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:47,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:47,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364953140] [2025-02-05 21:38:47,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364953140] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:47,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:47,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:38:47,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115382889] [2025-02-05 21:38:47,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:47,792 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:38:47,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:47,793 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:38:47,793 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:38:47,793 INFO L87 Difference]: Start difference. First operand 24823 states and 34455 transitions. Second operand has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:49,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:49,683 INFO L93 Difference]: Finished difference Result 56429 states and 76772 transitions. [2025-02-05 21:38:49,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:38:49,684 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 481 [2025-02-05 21:38:49,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:49,754 INFO L225 Difference]: With dead ends: 56429 [2025-02-05 21:38:49,754 INFO L226 Difference]: Without dead ends: 31739 [2025-02-05 21:38:49,786 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:38:49,788 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 62 mSDsluCounter, 1513 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1912 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:49,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1912 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 21:38:49,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31739 states. [2025-02-05 21:38:51,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31739 to 24247. [2025-02-05 21:38:51,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24247 states, 21817 states have (on average 1.3480771875143236) internal successors, (29411), 21956 states have internal predecessors, (29411), 2234 states have call successors, (2234), 195 states have call predecessors, (2234), 195 states have return successors, (2234), 2095 states have call predecessors, (2234), 2234 states have call successors, (2234) [2025-02-05 21:38:51,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24247 states to 24247 states and 33879 transitions. [2025-02-05 21:38:51,484 INFO L78 Accepts]: Start accepts. Automaton has 24247 states and 33879 transitions. Word has length 481 [2025-02-05 21:38:51,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:51,484 INFO L471 AbstractCegarLoop]: Abstraction has 24247 states and 33879 transitions. [2025-02-05 21:38:51,484 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.25) internal successors, (114), 8 states have internal predecessors, (114), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand 24247 states and 33879 transitions. [2025-02-05 21:38:51,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-02-05 21:38:51,499 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:51,500 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:51,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-02-05 21:38:51,500 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:51,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:51,500 INFO L85 PathProgramCache]: Analyzing trace with hash -1358627585, now seen corresponding path program 1 times [2025-02-05 21:38:51,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:51,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234973805] [2025-02-05 21:38:51,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:51,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:51,520 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-02-05 21:38:51,556 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-02-05 21:38:51,557 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:51,557 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:51,930 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:51,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:51,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234973805] [2025-02-05 21:38:51,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234973805] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:51,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:51,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-05 21:38:51,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972628362] [2025-02-05 21:38:51,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:51,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-02-05 21:38:51,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:51,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-02-05 21:38:51,932 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2025-02-05 21:38:51,932 INFO L87 Difference]: Start difference. First operand 24247 states and 33879 transitions. Second operand has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:53,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:53,769 INFO L93 Difference]: Finished difference Result 54125 states and 74324 transitions. [2025-02-05 21:38:53,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-02-05 21:38:53,769 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 482 [2025-02-05 21:38:53,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:53,835 INFO L225 Difference]: With dead ends: 54125 [2025-02-05 21:38:53,835 INFO L226 Difference]: Without dead ends: 30011 [2025-02-05 21:38:53,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2025-02-05 21:38:53,870 INFO L435 NwaCegarLoop]: 399 mSDtfsCounter, 64 mSDsluCounter, 1164 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 1563 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:53,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 1563 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 21:38:53,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30011 states. [2025-02-05 21:38:55,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30011 to 22231. [2025-02-05 21:38:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22231 states, 19801 states have (on average 1.3616989040957528) internal successors, (26963), 19940 states have internal predecessors, (26963), 2234 states have call successors, (2234), 195 states have call predecessors, (2234), 195 states have return successors, (2234), 2095 states have call predecessors, (2234), 2234 states have call successors, (2234) [2025-02-05 21:38:55,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22231 states to 22231 states and 31431 transitions. [2025-02-05 21:38:55,621 INFO L78 Accepts]: Start accepts. Automaton has 22231 states and 31431 transitions. Word has length 482 [2025-02-05 21:38:55,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 21:38:55,622 INFO L471 AbstractCegarLoop]: Abstraction has 22231 states and 31431 transitions. [2025-02-05 21:38:55,622 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.375) internal successors, (115), 8 states have internal predecessors, (115), 1 states have call successors, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:55,622 INFO L276 IsEmpty]: Start isEmpty. Operand 22231 states and 31431 transitions. [2025-02-05 21:38:55,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 483 [2025-02-05 21:38:55,637 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 21:38:55,637 INFO L218 NwaCegarLoop]: trace histogram [74, 74, 74, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:38:55,637 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-05 21:38:55,637 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 21:38:55,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 21:38:55,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1673518265, now seen corresponding path program 1 times [2025-02-05 21:38:55,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 21:38:55,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205719908] [2025-02-05 21:38:55,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 21:38:55,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 21:38:55,658 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 482 statements into 1 equivalence classes. [2025-02-05 21:38:55,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 482 of 482 statements. [2025-02-05 21:38:55,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 21:38:55,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 21:38:56,073 INFO L134 CoverageAnalysis]: Checked inductivity of 10804 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10804 trivial. 0 not checked. [2025-02-05 21:38:56,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 21:38:56,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205719908] [2025-02-05 21:38:56,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205719908] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 21:38:56,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 21:38:56,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-05 21:38:56,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052506866] [2025-02-05 21:38:56,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 21:38:56,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-05 21:38:56,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 21:38:56,074 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-05 21:38:56,074 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-05 21:38:56,075 INFO L87 Difference]: Start difference. First operand 22231 states and 31431 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) [2025-02-05 21:38:57,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 21:38:57,967 INFO L93 Difference]: Finished difference Result 51631 states and 73168 transitions. [2025-02-05 21:38:57,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-05 21:38:57,968 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, (74), 1 states have call predecessors, (74), 1 states have return successors, (74), 1 states have call predecessors, (74), 1 states have call successors, (74) Word has length 482 [2025-02-05 21:38:57,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 21:38:58,027 INFO L225 Difference]: With dead ends: 51631 [2025-02-05 21:38:58,027 INFO L226 Difference]: Without dead ends: 29533 [2025-02-05 21:38:58,044 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-02-05 21:38:58,045 INFO L435 NwaCegarLoop]: 368 mSDtfsCounter, 359 mSDsluCounter, 944 mSDsCounter, 0 mSdLazyCounter, 226 mSolverCounterSat, 223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1312 SdHoareTripleChecker+Invalid, 449 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 223 IncrementalHoareTripleChecker+Valid, 226 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 21:38:58,045 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1312 Invalid, 449 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [223 Valid, 226 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 21:38:58,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29533 states.