./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-33.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-33.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 9f8ffce10679cb0f0915b9100941533aa878d3327a8e4914196d12bd2837e821 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:39:26,916 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:39:26,965 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-06 02:39:26,969 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:39:26,969 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:39:26,982 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:39:26,983 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:39:26,983 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:39:26,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:39:26,984 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:39:26,984 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:39:26,985 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:39:26,985 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:39:26,985 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:39:26,985 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:39:26,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:39:26,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:39:26,986 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:39:26,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:39:26,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:39:26,986 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:39:26,986 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:39:26,986 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:39:26,986 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:39:26,986 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:39:26,986 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:39:26,987 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:39:26,987 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:39:26,987 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:39:26,987 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 -> 9f8ffce10679cb0f0915b9100941533aa878d3327a8e4914196d12bd2837e821 [2025-02-06 02:39:27,208 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:39:27,221 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:39:27,222 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:39:27,223 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:39:27,223 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:39:27,224 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-33.i [2025-02-06 02:39:28,407 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc134117b/d27d45ef21924f249e77e5d0c20e0ee0/FLAGbe8db0ea9 [2025-02-06 02:39:28,749 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:39:28,751 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-33.i [2025-02-06 02:39:28,762 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc134117b/d27d45ef21924f249e77e5d0c20e0ee0/FLAGbe8db0ea9 [2025-02-06 02:39:28,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/fc134117b/d27d45ef21924f249e77e5d0c20e0ee0 [2025-02-06 02:39:28,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:39:28,988 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:39:28,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:39:28,989 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:39:28,992 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:39:28,992 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:39:28" (1/1) ... [2025-02-06 02:39:28,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7bb21166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:28, skipping insertion in model container [2025-02-06 02:39:28,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:39:28" (1/1) ... [2025-02-06 02:39:29,029 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:39:29,139 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-33.i[916,929] [2025-02-06 02:39:29,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:39:29,356 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:39:29,365 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-33.i[916,929] [2025-02-06 02:39:29,464 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:39:29,477 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:39:29,478 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29 WrapperNode [2025-02-06 02:39:29,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:39:29,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:39:29,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:39:29,479 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:39:29,484 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (1/1) ... [2025-02-06 02:39:29,505 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (1/1) ... [2025-02-06 02:39:29,590 INFO L138 Inliner]: procedures = 26, calls = 109, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 859 [2025-02-06 02:39:29,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:39:29,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:39:29,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:39:29,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:39:29,597 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (1/1) ... [2025-02-06 02:39:29,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (1/1) ... [2025-02-06 02:39:29,617 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (1/1) ... [2025-02-06 02:39:29,693 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-02-06 02:39:29,695 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (1/1) ... [2025-02-06 02:39:29,695 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (1/1) ... [2025-02-06 02:39:29,732 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (1/1) ... [2025-02-06 02:39:29,736 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (1/1) ... [2025-02-06 02:39:29,743 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (1/1) ... [2025-02-06 02:39:29,749 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (1/1) ... [2025-02-06 02:39:29,761 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:39:29,762 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:39:29,762 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:39:29,762 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:39:29,763 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (1/1) ... [2025-02-06 02:39:29,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:39:29,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:29,789 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-06 02:39:29,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-06 02:39:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:39:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:39:29,811 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:39:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:39:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:39:29,812 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:39:29,920 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:39:29,922 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:39:30,918 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L717: havoc property_#t~bitwise62#1;havoc property_#t~bitwise63#1;havoc property_#t~short64#1;havoc property_#t~ite66#1;havoc property_#t~bitwise65#1;havoc property_#t~short67#1;havoc property_#t~bitwise68#1;havoc property_#t~short69#1;havoc property_#t~ite73#1;havoc property_#t~ite72#1;havoc property_#t~ite71#1;havoc property_#t~bitwise70#1;havoc property_#t~short74#1;havoc property_#t~ite77#1;havoc property_#t~ite76#1;havoc property_#t~bitwise75#1;havoc property_#t~short78#1; [2025-02-06 02:39:31,103 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2025-02-06 02:39:31,104 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:39:31,124 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:39:31,124 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:39:31,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:39:31 BoogieIcfgContainer [2025-02-06 02:39:31,125 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:39:31,127 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:39:31,127 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:39:31,130 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:39:31,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:39:28" (1/3) ... [2025-02-06 02:39:31,130 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3186de62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:39:31, skipping insertion in model container [2025-02-06 02:39:31,130 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:39:29" (2/3) ... [2025-02-06 02:39:31,131 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3186de62 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:39:31, skipping insertion in model container [2025-02-06 02:39:31,131 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:39:31" (3/3) ... [2025-02-06 02:39:31,131 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-33.i [2025-02-06 02:39:31,141 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:39:31,144 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-33.i that has 2 procedures, 350 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:39:31,183 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:39:31,190 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;@131ff493, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:39:31,191 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:39:31,194 INFO L276 IsEmpty]: Start isEmpty. Operand has 350 states, 251 states have (on average 1.545816733067729) internal successors, (388), 252 states have internal predecessors, (388), 96 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 02:39:31,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2025-02-06 02:39:31,215 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:31,216 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:31,216 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:31,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:31,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1347045419, now seen corresponding path program 1 times [2025-02-06 02:39:31,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:31,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925532761] [2025-02-06 02:39:31,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:31,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:31,359 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-02-06 02:39:31,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-02-06 02:39:31,416 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:31,416 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:31,933 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 190 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2025-02-06 02:39:31,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:31,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925532761] [2025-02-06 02:39:31,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925532761] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:39:31,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1178938251] [2025-02-06 02:39:31,935 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:31,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:39:31,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:39:31,939 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:39:31,940 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-06 02:39:32,114 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-02-06 02:39:32,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-02-06 02:39:32,306 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:32,306 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:32,313 INFO L256 TraceCheckSpWp]: Trace formula consists of 1502 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:39:32,328 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:39:32,382 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 190 proven. 0 refuted. 0 times theorem prover too weak. 18050 trivial. 0 not checked. [2025-02-06 02:39:32,382 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:39:32,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1178938251] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:32,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:39:32,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:39:32,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683515509] [2025-02-06 02:39:32,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:32,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:39:32,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:32,408 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:39:32,408 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:39:32,410 INFO L87 Difference]: Start difference. First operand has 350 states, 251 states have (on average 1.545816733067729) internal successors, (388), 252 states have internal predecessors, (388), 96 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) Second operand has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-06 02:39:32,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:32,486 INFO L93 Difference]: Finished difference Result 694 states and 1251 transitions. [2025-02-06 02:39:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:39:32,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 2 states have call successors, (96) Word has length 629 [2025-02-06 02:39:32,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:32,498 INFO L225 Difference]: With dead ends: 694 [2025-02-06 02:39:32,499 INFO L226 Difference]: Without dead ends: 347 [2025-02-06 02:39:32,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 630 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:39:32,508 INFO L435 NwaCegarLoop]: 561 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:32,510 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 561 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:39:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2025-02-06 02:39:32,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 347. [2025-02-06 02:39:32,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 249 states have (on average 1.5301204819277108) internal successors, (381), 249 states have internal predecessors, (381), 96 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 96 states have call predecessors, (96), 96 states have call successors, (96) [2025-02-06 02:39:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 573 transitions. [2025-02-06 02:39:32,597 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 573 transitions. Word has length 629 [2025-02-06 02:39:32,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:32,598 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 573 transitions. [2025-02-06 02:39:32,598 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 77.0) internal successors, (154), 2 states have internal predecessors, (154), 2 states have call successors, (96), 2 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-06 02:39:32,600 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 573 transitions. [2025-02-06 02:39:32,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2025-02-06 02:39:32,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:32,615 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:32,625 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-06 02:39:32,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-02-06 02:39:32,821 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:32,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:32,822 INFO L85 PathProgramCache]: Analyzing trace with hash 54139917, now seen corresponding path program 1 times [2025-02-06 02:39:32,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:32,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906684280] [2025-02-06 02:39:32,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:32,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:32,883 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-02-06 02:39:32,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-02-06 02:39:32,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:32,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:33,533 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:33,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:33,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906684280] [2025-02-06 02:39:33,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906684280] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:33,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:33,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:33,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892466072] [2025-02-06 02:39:33,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:33,538 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:33,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:33,539 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:33,539 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:33,540 INFO L87 Difference]: Start difference. First operand 347 states and 573 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:33,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:33,756 INFO L93 Difference]: Finished difference Result 1034 states and 1711 transitions. [2025-02-06 02:39:33,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:33,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 629 [2025-02-06 02:39:33,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:33,765 INFO L225 Difference]: With dead ends: 1034 [2025-02-06 02:39:33,767 INFO L226 Difference]: Without dead ends: 690 [2025-02-06 02:39:33,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:33,768 INFO L435 NwaCegarLoop]: 551 mSDtfsCounter, 556 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 556 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:33,769 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [556 Valid, 1081 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:33,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 690 states. [2025-02-06 02:39:33,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 690 to 688. [2025-02-06 02:39:33,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 688 states, 493 states have (on average 1.5172413793103448) internal successors, (748), 493 states have internal predecessors, (748), 192 states have call successors, (192), 2 states have call predecessors, (192), 2 states have return successors, (192), 192 states have call predecessors, (192), 192 states have call successors, (192) [2025-02-06 02:39:33,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 688 states to 688 states and 1132 transitions. [2025-02-06 02:39:33,878 INFO L78 Accepts]: Start accepts. Automaton has 688 states and 1132 transitions. Word has length 629 [2025-02-06 02:39:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:33,879 INFO L471 AbstractCegarLoop]: Abstraction has 688 states and 1132 transitions. [2025-02-06 02:39:33,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:33,880 INFO L276 IsEmpty]: Start isEmpty. Operand 688 states and 1132 transitions. [2025-02-06 02:39:33,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 630 [2025-02-06 02:39:33,887 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:33,887 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:33,888 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:39:33,888 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:33,888 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:33,888 INFO L85 PathProgramCache]: Analyzing trace with hash 1009661196, now seen corresponding path program 1 times [2025-02-06 02:39:33,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:33,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515592949] [2025-02-06 02:39:33,889 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:33,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:33,937 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 629 statements into 1 equivalence classes. [2025-02-06 02:39:33,994 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 629 of 629 statements. [2025-02-06 02:39:33,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:33,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:34,209 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:34,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:34,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515592949] [2025-02-06 02:39:34,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515592949] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:34,209 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:34,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:34,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181415999] [2025-02-06 02:39:34,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:34,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:34,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:34,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:34,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:34,212 INFO L87 Difference]: Start difference. First operand 688 states and 1132 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:34,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:34,515 INFO L93 Difference]: Finished difference Result 1834 states and 3016 transitions. [2025-02-06 02:39:34,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:34,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 629 [2025-02-06 02:39:34,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:34,524 INFO L225 Difference]: With dead ends: 1834 [2025-02-06 02:39:34,524 INFO L226 Difference]: Without dead ends: 1149 [2025-02-06 02:39:34,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:34,525 INFO L435 NwaCegarLoop]: 853 mSDtfsCounter, 359 mSDsluCounter, 537 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:34,526 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1390 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-06 02:39:34,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1149 states. [2025-02-06 02:39:34,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1149 to 1145. [2025-02-06 02:39:34,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 894 states have (on average 1.5480984340044743) internal successors, (1384), 896 states have internal predecessors, (1384), 246 states have call successors, (246), 4 states have call predecessors, (246), 4 states have return successors, (246), 244 states have call predecessors, (246), 246 states have call successors, (246) [2025-02-06 02:39:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1876 transitions. [2025-02-06 02:39:34,614 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1876 transitions. Word has length 629 [2025-02-06 02:39:34,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:34,615 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1876 transitions. [2025-02-06 02:39:34,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:34,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1876 transitions. [2025-02-06 02:39:34,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 631 [2025-02-06 02:39:34,622 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:34,623 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:34,623 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:39:34,623 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:34,624 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:34,624 INFO L85 PathProgramCache]: Analyzing trace with hash 126982790, now seen corresponding path program 1 times [2025-02-06 02:39:34,624 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:34,624 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080329459] [2025-02-06 02:39:34,624 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:34,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:34,664 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 630 statements into 1 equivalence classes. [2025-02-06 02:39:34,710 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 630 of 630 statements. [2025-02-06 02:39:34,713 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:34,713 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:34,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:34,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080329459] [2025-02-06 02:39:34,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080329459] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:34,891 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:34,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:34,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945554046] [2025-02-06 02:39:34,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:34,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:34,892 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:34,893 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:34,893 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:34,893 INFO L87 Difference]: Start difference. First operand 1145 states and 1876 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:35,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:35,057 INFO L93 Difference]: Finished difference Result 3417 states and 5600 transitions. [2025-02-06 02:39:35,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:35,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 630 [2025-02-06 02:39:35,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:35,073 INFO L225 Difference]: With dead ends: 3417 [2025-02-06 02:39:35,073 INFO L226 Difference]: Without dead ends: 2275 [2025-02-06 02:39:35,076 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:35,077 INFO L435 NwaCegarLoop]: 550 mSDtfsCounter, 544 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 544 SdHoareTripleChecker+Valid, 1084 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:35,077 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [544 Valid, 1084 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:35,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2275 states. [2025-02-06 02:39:35,200 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2275 to 2265. [2025-02-06 02:39:35,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 1764 states have (on average 1.5317460317460319) internal successors, (2702), 1768 states have internal predecessors, (2702), 492 states have call successors, (492), 8 states have call predecessors, (492), 8 states have return successors, (492), 488 states have call predecessors, (492), 492 states have call successors, (492) [2025-02-06 02:39:35,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 3686 transitions. [2025-02-06 02:39:35,212 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 3686 transitions. Word has length 630 [2025-02-06 02:39:35,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:35,213 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 3686 transitions. [2025-02-06 02:39:35,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:35,213 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 3686 transitions. [2025-02-06 02:39:35,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-06 02:39:35,218 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:35,218 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:35,218 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:39:35,219 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:35,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:35,219 INFO L85 PathProgramCache]: Analyzing trace with hash -441017740, now seen corresponding path program 1 times [2025-02-06 02:39:35,219 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:35,219 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893570117] [2025-02-06 02:39:35,219 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:35,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:35,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-06 02:39:35,291 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-06 02:39:35,291 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:35,291 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:35,459 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:35,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:35,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893570117] [2025-02-06 02:39:35,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893570117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:35,460 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:35,460 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:35,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566726065] [2025-02-06 02:39:35,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:35,461 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:35,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:35,462 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:35,462 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:35,462 INFO L87 Difference]: Start difference. First operand 2265 states and 3686 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:35,694 INFO L93 Difference]: Finished difference Result 6311 states and 10232 transitions. [2025-02-06 02:39:35,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:35,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 631 [2025-02-06 02:39:35,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:35,715 INFO L225 Difference]: With dead ends: 6311 [2025-02-06 02:39:35,715 INFO L226 Difference]: Without dead ends: 4049 [2025-02-06 02:39:35,721 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:35,722 INFO L435 NwaCegarLoop]: 773 mSDtfsCounter, 420 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 420 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:35,722 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [420 Valid, 1302 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:35,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4049 states. [2025-02-06 02:39:35,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4049 to 4043. [2025-02-06 02:39:35,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4043 states, 3186 states have (on average 1.5204017576898934) internal successors, (4844), 3198 states have internal predecessors, (4844), 840 states have call successors, (840), 16 states have call predecessors, (840), 16 states have return successors, (840), 828 states have call predecessors, (840), 840 states have call successors, (840) [2025-02-06 02:39:35,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4043 states to 4043 states and 6524 transitions. [2025-02-06 02:39:35,996 INFO L78 Accepts]: Start accepts. Automaton has 4043 states and 6524 transitions. Word has length 631 [2025-02-06 02:39:35,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:35,998 INFO L471 AbstractCegarLoop]: Abstraction has 4043 states and 6524 transitions. [2025-02-06 02:39:35,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:35,999 INFO L276 IsEmpty]: Start isEmpty. Operand 4043 states and 6524 transitions. [2025-02-06 02:39:36,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-06 02:39:36,006 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:36,006 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:36,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-06 02:39:36,007 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:36,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:36,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1231528755, now seen corresponding path program 1 times [2025-02-06 02:39:36,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:36,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1185950211] [2025-02-06 02:39:36,007 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:36,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:36,044 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-06 02:39:36,082 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-06 02:39:36,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:36,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:36,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:36,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:36,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1185950211] [2025-02-06 02:39:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1185950211] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:36,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:36,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650736665] [2025-02-06 02:39:36,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:36,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:36,242 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:36,242 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:36,242 INFO L87 Difference]: Start difference. First operand 4043 states and 6524 transitions. Second operand has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:36,479 INFO L93 Difference]: Finished difference Result 8123 states and 13109 transitions. [2025-02-06 02:39:36,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:36,480 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 631 [2025-02-06 02:39:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:36,501 INFO L225 Difference]: With dead ends: 8123 [2025-02-06 02:39:36,502 INFO L226 Difference]: Without dead ends: 4083 [2025-02-06 02:39:36,511 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:36,513 INFO L435 NwaCegarLoop]: 871 mSDtfsCounter, 532 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 532 SdHoareTripleChecker+Valid, 1401 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:36,513 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [532 Valid, 1401 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:36,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4083 states. [2025-02-06 02:39:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4083 to 4081. [2025-02-06 02:39:36,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4081 states, 3224 states have (on average 1.505272952853598) internal successors, (4853), 3236 states have internal predecessors, (4853), 840 states have call successors, (840), 16 states have call predecessors, (840), 16 states have return successors, (840), 828 states have call predecessors, (840), 840 states have call successors, (840) [2025-02-06 02:39:36,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4081 states to 4081 states and 6533 transitions. [2025-02-06 02:39:36,717 INFO L78 Accepts]: Start accepts. Automaton has 4081 states and 6533 transitions. Word has length 631 [2025-02-06 02:39:36,717 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:36,717 INFO L471 AbstractCegarLoop]: Abstraction has 4081 states and 6533 transitions. [2025-02-06 02:39:36,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:36,718 INFO L276 IsEmpty]: Start isEmpty. Operand 4081 states and 6533 transitions. [2025-02-06 02:39:36,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 632 [2025-02-06 02:39:36,724 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:36,724 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:36,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:39:36,725 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:36,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:36,725 INFO L85 PathProgramCache]: Analyzing trace with hash 1680985457, now seen corresponding path program 1 times [2025-02-06 02:39:36,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:36,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267835762] [2025-02-06 02:39:36,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:36,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:36,758 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 631 statements into 1 equivalence classes. [2025-02-06 02:39:36,845 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 631 of 631 statements. [2025-02-06 02:39:36,845 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:36,845 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:37,336 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:37,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:37,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267835762] [2025-02-06 02:39:37,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267835762] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:37,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:37,337 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:39:37,337 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833277211] [2025-02-06 02:39:37,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:37,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:39:37,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:37,339 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:39:37,339 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:37,339 INFO L87 Difference]: Start difference. First operand 4081 states and 6533 transitions. Second operand has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:38,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:38,066 INFO L93 Difference]: Finished difference Result 12689 states and 20292 transitions. [2025-02-06 02:39:38,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:39:38,067 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 631 [2025-02-06 02:39:38,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:38,102 INFO L225 Difference]: With dead ends: 12689 [2025-02-06 02:39:38,103 INFO L226 Difference]: Without dead ends: 8611 [2025-02-06 02:39:38,112 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:38,113 INFO L435 NwaCegarLoop]: 802 mSDtfsCounter, 689 mSDsluCounter, 1081 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 1883 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:38,114 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 1883 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:39:38,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8611 states. [2025-02-06 02:39:38,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8611 to 6103. [2025-02-06 02:39:38,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6103 states, 4818 states have (on average 1.5024906600249066) internal successors, (7239), 4836 states have internal predecessors, (7239), 1260 states have call successors, (1260), 24 states have call predecessors, (1260), 24 states have return successors, (1260), 1242 states have call predecessors, (1260), 1260 states have call successors, (1260) [2025-02-06 02:39:38,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6103 states to 6103 states and 9759 transitions. [2025-02-06 02:39:38,531 INFO L78 Accepts]: Start accepts. Automaton has 6103 states and 9759 transitions. Word has length 631 [2025-02-06 02:39:38,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:38,532 INFO L471 AbstractCegarLoop]: Abstraction has 6103 states and 9759 transitions. [2025-02-06 02:39:38,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.5) internal successors, (154), 4 states have internal predecessors, (154), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:38,533 INFO L276 IsEmpty]: Start isEmpty. Operand 6103 states and 9759 transitions. [2025-02-06 02:39:38,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-02-06 02:39:38,544 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:38,544 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:38,544 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:39:38,545 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:38,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:38,545 INFO L85 PathProgramCache]: Analyzing trace with hash -903323665, now seen corresponding path program 1 times [2025-02-06 02:39:38,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:38,545 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474393944] [2025-02-06 02:39:38,545 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:38,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:38,587 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-02-06 02:39:39,000 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-02-06 02:39:39,001 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:39,001 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:39,792 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:39,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:39,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474393944] [2025-02-06 02:39:39,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474393944] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:39,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:39,792 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-06 02:39:39,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152537741] [2025-02-06 02:39:39,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:39,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-06 02:39:39,793 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:39,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-06 02:39:39,795 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:39,798 INFO L87 Difference]: Start difference. First operand 6103 states and 9759 transitions. Second operand has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:40,731 INFO L93 Difference]: Finished difference Result 18167 states and 29065 transitions. [2025-02-06 02:39:40,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:39:40,732 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 632 [2025-02-06 02:39:40,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:40,770 INFO L225 Difference]: With dead ends: 18167 [2025-02-06 02:39:40,770 INFO L226 Difference]: Without dead ends: 12067 [2025-02-06 02:39:40,785 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:39:40,786 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 1126 mSDsluCounter, 1522 mSDsCounter, 0 mSdLazyCounter, 308 mSolverCounterSat, 289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1126 SdHoareTripleChecker+Valid, 2169 SdHoareTripleChecker+Invalid, 597 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 289 IncrementalHoareTripleChecker+Valid, 308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:40,786 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1126 Valid, 2169 Invalid, 597 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [289 Valid, 308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-02-06 02:39:40,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12067 states. [2025-02-06 02:39:41,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12067 to 6266. [2025-02-06 02:39:41,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6266 states, 4883 states have (on average 1.4962113454843333) internal successors, (7306), 4901 states have internal predecessors, (7306), 1356 states have call successors, (1356), 26 states have call predecessors, (1356), 26 states have return successors, (1356), 1338 states have call predecessors, (1356), 1356 states have call successors, (1356) [2025-02-06 02:39:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6266 states to 6266 states and 10018 transitions. [2025-02-06 02:39:41,167 INFO L78 Accepts]: Start accepts. Automaton has 6266 states and 10018 transitions. Word has length 632 [2025-02-06 02:39:41,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:41,168 INFO L471 AbstractCegarLoop]: Abstraction has 6266 states and 10018 transitions. [2025-02-06 02:39:41,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.0) internal successors, (155), 5 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:41,169 INFO L276 IsEmpty]: Start isEmpty. Operand 6266 states and 10018 transitions. [2025-02-06 02:39:41,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-02-06 02:39:41,177 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:41,177 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:41,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:39:41,177 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:41,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:41,178 INFO L85 PathProgramCache]: Analyzing trace with hash -1873614672, now seen corresponding path program 1 times [2025-02-06 02:39:41,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726726134] [2025-02-06 02:39:41,178 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:41,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-02-06 02:39:41,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-02-06 02:39:41,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:41,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:42,212 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:42,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:42,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726726134] [2025-02-06 02:39:42,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726726134] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:42,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:42,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-06 02:39:42,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644063382] [2025-02-06 02:39:42,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:42,214 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-06 02:39:42,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:42,214 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-06 02:39:42,214 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-06 02:39:42,215 INFO L87 Difference]: Start difference. First operand 6266 states and 10018 transitions. Second operand has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-06 02:39:43,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:43,715 INFO L93 Difference]: Finished difference Result 21449 states and 34183 transitions. [2025-02-06 02:39:43,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-06 02:39:43,716 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) Word has length 632 [2025-02-06 02:39:43,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:43,765 INFO L225 Difference]: With dead ends: 21449 [2025-02-06 02:39:43,765 INFO L226 Difference]: Without dead ends: 15349 [2025-02-06 02:39:43,788 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2025-02-06 02:39:43,789 INFO L435 NwaCegarLoop]: 1314 mSDtfsCounter, 1697 mSDsluCounter, 1512 mSDsCounter, 0 mSdLazyCounter, 627 mSolverCounterSat, 335 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 2826 SdHoareTripleChecker+Invalid, 962 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 335 IncrementalHoareTripleChecker+Valid, 627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:43,789 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1697 Valid, 2826 Invalid, 962 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [335 Valid, 627 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-02-06 02:39:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15349 states. [2025-02-06 02:39:44,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15349 to 13432. [2025-02-06 02:39:44,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13432 states, 10633 states have (on average 1.4975077588639143) internal successors, (15923), 10681 states have internal predecessors, (15923), 2736 states have call successors, (2736), 62 states have call predecessors, (2736), 62 states have return successors, (2736), 2688 states have call predecessors, (2736), 2736 states have call successors, (2736) [2025-02-06 02:39:44,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13432 states to 13432 states and 21395 transitions. [2025-02-06 02:39:44,558 INFO L78 Accepts]: Start accepts. Automaton has 13432 states and 21395 transitions. Word has length 632 [2025-02-06 02:39:44,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:44,559 INFO L471 AbstractCegarLoop]: Abstraction has 13432 states and 21395 transitions. [2025-02-06 02:39:44,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.833333333333332) internal successors, (155), 6 states have internal predecessors, (155), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-06 02:39:44,560 INFO L276 IsEmpty]: Start isEmpty. Operand 13432 states and 21395 transitions. [2025-02-06 02:39:44,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-02-06 02:39:44,572 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:44,572 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:44,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:39:44,572 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:44,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:44,573 INFO L85 PathProgramCache]: Analyzing trace with hash 1201689236, now seen corresponding path program 1 times [2025-02-06 02:39:44,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:44,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850914439] [2025-02-06 02:39:44,573 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:44,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:44,606 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-02-06 02:39:44,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-02-06 02:39:44,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:44,657 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:45,228 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:45,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:45,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850914439] [2025-02-06 02:39:45,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850914439] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:45,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:45,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:39:45,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754227397] [2025-02-06 02:39:45,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:45,229 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:39:45,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:45,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:39:45,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:45,230 INFO L87 Difference]: Start difference. First operand 13432 states and 21395 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:45,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:45,899 INFO L93 Difference]: Finished difference Result 18362 states and 29243 transitions. [2025-02-06 02:39:45,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-06 02:39:45,900 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 632 [2025-02-06 02:39:45,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:45,942 INFO L225 Difference]: With dead ends: 18362 [2025-02-06 02:39:45,942 INFO L226 Difference]: Without dead ends: 14284 [2025-02-06 02:39:45,955 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:39:45,956 INFO L435 NwaCegarLoop]: 622 mSDtfsCounter, 1004 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1004 SdHoareTripleChecker+Valid, 1567 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:45,956 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1004 Valid, 1567 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:39:45,969 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14284 states. [2025-02-06 02:39:46,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14284 to 13422. [2025-02-06 02:39:46,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13422 states, 10622 states have (on average 1.4971756731312371) internal successors, (15903), 10670 states have internal predecessors, (15903), 2736 states have call successors, (2736), 63 states have call predecessors, (2736), 63 states have return successors, (2736), 2688 states have call predecessors, (2736), 2736 states have call successors, (2736) [2025-02-06 02:39:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13422 states to 13422 states and 21375 transitions. [2025-02-06 02:39:46,565 INFO L78 Accepts]: Start accepts. Automaton has 13422 states and 21375 transitions. Word has length 632 [2025-02-06 02:39:46,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:46,566 INFO L471 AbstractCegarLoop]: Abstraction has 13422 states and 21375 transitions. [2025-02-06 02:39:46,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:46,567 INFO L276 IsEmpty]: Start isEmpty. Operand 13422 states and 21375 transitions. [2025-02-06 02:39:46,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 633 [2025-02-06 02:39:46,579 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:46,579 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:46,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:39:46,579 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:46,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:46,580 INFO L85 PathProgramCache]: Analyzing trace with hash -713618863, now seen corresponding path program 1 times [2025-02-06 02:39:46,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:46,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898568527] [2025-02-06 02:39:46,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:46,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:46,609 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 632 statements into 1 equivalence classes. [2025-02-06 02:39:46,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 632 of 632 statements. [2025-02-06 02:39:46,985 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:46,985 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:47,690 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:47,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:47,691 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898568527] [2025-02-06 02:39:47,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898568527] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:47,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:47,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:39:47,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505069719] [2025-02-06 02:39:47,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:47,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:39:47,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:47,693 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:39:47,693 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:47,693 INFO L87 Difference]: Start difference. First operand 13422 states and 21375 transitions. Second operand has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:48,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:48,248 INFO L93 Difference]: Finished difference Result 21974 states and 34978 transitions. [2025-02-06 02:39:48,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:39:48,249 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 632 [2025-02-06 02:39:48,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:48,301 INFO L225 Difference]: With dead ends: 21974 [2025-02-06 02:39:48,302 INFO L226 Difference]: Without dead ends: 15888 [2025-02-06 02:39:48,321 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:48,322 INFO L435 NwaCegarLoop]: 995 mSDtfsCounter, 769 mSDsluCounter, 814 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 769 SdHoareTripleChecker+Valid, 1809 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:48,322 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [769 Valid, 1809 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:39:48,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15888 states. [2025-02-06 02:39:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15888 to 14522. [2025-02-06 02:39:48,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14522 states, 11722 states have (on average 1.5008530967411704) internal successors, (17593), 11770 states have internal predecessors, (17593), 2736 states have call successors, (2736), 63 states have call predecessors, (2736), 63 states have return successors, (2736), 2688 states have call predecessors, (2736), 2736 states have call successors, (2736) [2025-02-06 02:39:48,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14522 states to 14522 states and 23065 transitions. [2025-02-06 02:39:48,962 INFO L78 Accepts]: Start accepts. Automaton has 14522 states and 23065 transitions. Word has length 632 [2025-02-06 02:39:48,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:48,963 INFO L471 AbstractCegarLoop]: Abstraction has 14522 states and 23065 transitions. [2025-02-06 02:39:48,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.75) internal successors, (155), 4 states have internal predecessors, (155), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:48,963 INFO L276 IsEmpty]: Start isEmpty. Operand 14522 states and 23065 transitions. [2025-02-06 02:39:48,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-02-06 02:39:48,976 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:48,976 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:48,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:39:48,978 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:48,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:48,978 INFO L85 PathProgramCache]: Analyzing trace with hash -1419970641, now seen corresponding path program 1 times [2025-02-06 02:39:48,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:48,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682540692] [2025-02-06 02:39:48,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:48,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:49,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-02-06 02:39:49,042 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-02-06 02:39:49,043 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:49,043 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:49,457 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:49,457 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:49,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682540692] [2025-02-06 02:39:49,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682540692] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:49,458 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:49,458 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:39:49,458 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [30667937] [2025-02-06 02:39:49,458 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:49,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:39:49,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:49,459 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:39:49,459 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:49,459 INFO L87 Difference]: Start difference. First operand 14522 states and 23065 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:50,275 INFO L93 Difference]: Finished difference Result 44067 states and 69712 transitions. [2025-02-06 02:39:50,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:39:50,275 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 633 [2025-02-06 02:39:50,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:50,370 INFO L225 Difference]: With dead ends: 44067 [2025-02-06 02:39:50,371 INFO L226 Difference]: Without dead ends: 29715 [2025-02-06 02:39:50,397 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:39:50,398 INFO L435 NwaCegarLoop]: 801 mSDtfsCounter, 983 mSDsluCounter, 811 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 983 SdHoareTripleChecker+Valid, 1612 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:50,398 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [983 Valid, 1612 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:39:50,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29715 states. [2025-02-06 02:39:51,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29715 to 27443. [2025-02-06 02:39:51,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27443 states, 23119 states have (on average 1.5117003330593883) internal successors, (34949), 23227 states have internal predecessors, (34949), 4200 states have call successors, (4200), 123 states have call predecessors, (4200), 123 states have return successors, (4200), 4092 states have call predecessors, (4200), 4200 states have call successors, (4200) [2025-02-06 02:39:51,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27443 states to 27443 states and 43349 transitions. [2025-02-06 02:39:51,417 INFO L78 Accepts]: Start accepts. Automaton has 27443 states and 43349 transitions. Word has length 633 [2025-02-06 02:39:51,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:51,418 INFO L471 AbstractCegarLoop]: Abstraction has 27443 states and 43349 transitions. [2025-02-06 02:39:51,418 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:51,418 INFO L276 IsEmpty]: Start isEmpty. Operand 27443 states and 43349 transitions. [2025-02-06 02:39:51,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-02-06 02:39:51,434 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:51,434 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:51,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-02-06 02:39:51,435 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:51,435 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:51,435 INFO L85 PathProgramCache]: Analyzing trace with hash -458365553, now seen corresponding path program 1 times [2025-02-06 02:39:51,435 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:51,435 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678025468] [2025-02-06 02:39:51,436 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:51,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:51,469 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-02-06 02:39:51,494 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-02-06 02:39:51,494 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:51,494 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:51,607 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:51,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:51,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678025468] [2025-02-06 02:39:51,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678025468] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:51,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:51,607 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:39:51,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099616931] [2025-02-06 02:39:51,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:51,608 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:39:51,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:51,608 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:39:51,608 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:39:51,609 INFO L87 Difference]: Start difference. First operand 27443 states and 43349 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:52,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:39:52,524 INFO L93 Difference]: Finished difference Result 65593 states and 103446 transitions. [2025-02-06 02:39:52,525 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:39:52,525 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 633 [2025-02-06 02:39:52,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:39:52,662 INFO L225 Difference]: With dead ends: 65593 [2025-02-06 02:39:52,662 INFO L226 Difference]: Without dead ends: 38069 [2025-02-06 02:39:52,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-06 02:39:52,712 INFO L435 NwaCegarLoop]: 695 mSDtfsCounter, 302 mSDsluCounter, 544 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1239 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:39:52,712 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1239 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:39:52,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38069 states. [2025-02-06 02:39:53,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38069 to 28323. [2025-02-06 02:39:53,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28323 states, 24498 states have (on average 1.5240427790023676) internal successors, (37336), 24586 states have internal predecessors, (37336), 3712 states have call successors, (3712), 112 states have call predecessors, (3712), 112 states have return successors, (3712), 3624 states have call predecessors, (3712), 3712 states have call successors, (3712) [2025-02-06 02:39:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28323 states to 28323 states and 44760 transitions. [2025-02-06 02:39:53,968 INFO L78 Accepts]: Start accepts. Automaton has 28323 states and 44760 transitions. Word has length 633 [2025-02-06 02:39:53,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:39:53,969 INFO L471 AbstractCegarLoop]: Abstraction has 28323 states and 44760 transitions. [2025-02-06 02:39:53,969 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:39:53,969 INFO L276 IsEmpty]: Start isEmpty. Operand 28323 states and 44760 transitions. [2025-02-06 02:39:54,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-02-06 02:39:54,069 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:39:54,069 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:39:54,070 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-02-06 02:39:54,070 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:39:54,070 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:39:54,070 INFO L85 PathProgramCache]: Analyzing trace with hash -867189778, now seen corresponding path program 1 times [2025-02-06 02:39:54,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:39:54,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240999965] [2025-02-06 02:39:54,071 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:39:54,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:39:54,098 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-02-06 02:39:54,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-02-06 02:39:54,273 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:39:54,273 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:39:56,569 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:39:56,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:39:56,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240999965] [2025-02-06 02:39:56,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240999965] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:39:56,571 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:39:56,571 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:39:56,571 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529086828] [2025-02-06 02:39:56,571 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:39:56,572 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:39:56,572 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:39:56,573 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:39:56,573 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:39:56,573 INFO L87 Difference]: Start difference. First operand 28323 states and 44760 transitions. Second operand has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-06 02:40:01,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:01,629 INFO L93 Difference]: Finished difference Result 131674 states and 206168 transitions. [2025-02-06 02:40:01,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:40:01,630 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) Word has length 633 [2025-02-06 02:40:01,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:01,878 INFO L225 Difference]: With dead ends: 131674 [2025-02-06 02:40:01,878 INFO L226 Difference]: Without dead ends: 103525 [2025-02-06 02:40:01,932 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=95, Invalid=247, Unknown=0, NotChecked=0, Total=342 [2025-02-06 02:40:01,933 INFO L435 NwaCegarLoop]: 608 mSDtfsCounter, 2939 mSDsluCounter, 2834 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2939 SdHoareTripleChecker+Valid, 3442 SdHoareTripleChecker+Invalid, 2482 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:01,933 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2939 Valid, 3442 Invalid, 2482 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2025-02-06 02:40:01,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103525 states. [2025-02-06 02:40:04,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103525 to 88097. [2025-02-06 02:40:04,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88097 states, 82092 states have (on average 1.551905179554646) internal successors, (127399), 82400 states have internal predecessors, (127399), 5592 states have call successors, (5592), 412 states have call predecessors, (5592), 412 states have return successors, (5592), 5284 states have call predecessors, (5592), 5592 states have call successors, (5592) [2025-02-06 02:40:04,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88097 states to 88097 states and 138583 transitions. [2025-02-06 02:40:04,766 INFO L78 Accepts]: Start accepts. Automaton has 88097 states and 138583 transitions. Word has length 633 [2025-02-06 02:40:04,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:04,767 INFO L471 AbstractCegarLoop]: Abstraction has 88097 states and 138583 transitions. [2025-02-06 02:40:04,767 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 15.6) internal successors, (156), 10 states have internal predecessors, (156), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-06 02:40:04,768 INFO L276 IsEmpty]: Start isEmpty. Operand 88097 states and 138583 transitions. [2025-02-06 02:40:04,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-02-06 02:40:04,821 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:04,822 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:04,822 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-02-06 02:40:04,822 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:04,822 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:04,823 INFO L85 PathProgramCache]: Analyzing trace with hash 596429421, now seen corresponding path program 1 times [2025-02-06 02:40:04,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:04,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925280826] [2025-02-06 02:40:04,823 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:04,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:04,850 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-02-06 02:40:05,329 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-02-06 02:40:05,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:05,329 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:06,239 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:40:06,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:06,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925280826] [2025-02-06 02:40:06,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925280826] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:06,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:06,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:40:06,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473438112] [2025-02-06 02:40:06,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:06,242 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:40:06,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:06,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:40:06,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:40:06,243 INFO L87 Difference]: Start difference. First operand 88097 states and 138583 transitions. Second operand has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:40:08,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:08,636 INFO L93 Difference]: Finished difference Result 180146 states and 283013 transitions. [2025-02-06 02:40:08,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:40:08,636 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) Word has length 633 [2025-02-06 02:40:08,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:08,851 INFO L225 Difference]: With dead ends: 180146 [2025-02-06 02:40:08,852 INFO L226 Difference]: Without dead ends: 92223 [2025-02-06 02:40:08,939 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-06 02:40:08,940 INFO L435 NwaCegarLoop]: 691 mSDtfsCounter, 341 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 341 SdHoareTripleChecker+Valid, 1921 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:08,940 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [341 Valid, 1921 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-06 02:40:09,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92223 states. [2025-02-06 02:40:12,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92223 to 87809. [2025-02-06 02:40:12,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87809 states, 81804 states have (on average 1.5468070021025866) internal successors, (126535), 82112 states have internal predecessors, (126535), 5592 states have call successors, (5592), 412 states have call predecessors, (5592), 412 states have return successors, (5592), 5284 states have call predecessors, (5592), 5592 states have call successors, (5592) [2025-02-06 02:40:12,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87809 states to 87809 states and 137719 transitions. [2025-02-06 02:40:12,453 INFO L78 Accepts]: Start accepts. Automaton has 87809 states and 137719 transitions. Word has length 633 [2025-02-06 02:40:12,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:12,454 INFO L471 AbstractCegarLoop]: Abstraction has 87809 states and 137719 transitions. [2025-02-06 02:40:12,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.0) internal successors, (156), 4 states have internal predecessors, (156), 1 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 1 states have call predecessors, (96), 1 states have call successors, (96) [2025-02-06 02:40:12,454 INFO L276 IsEmpty]: Start isEmpty. Operand 87809 states and 137719 transitions. [2025-02-06 02:40:12,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-02-06 02:40:12,501 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:12,502 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:12,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-02-06 02:40:12,502 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:12,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:12,503 INFO L85 PathProgramCache]: Analyzing trace with hash 35204904, now seen corresponding path program 1 times [2025-02-06 02:40:12,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:12,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484305471] [2025-02-06 02:40:12,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:12,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:12,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-02-06 02:40:13,938 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-02-06 02:40:13,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:13,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:40:19,200 INFO L134 CoverageAnalysis]: Checked inductivity of 18240 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 18240 trivial. 0 not checked. [2025-02-06 02:40:19,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:40:19,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484305471] [2025-02-06 02:40:19,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484305471] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:40:19,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:40:19,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2025-02-06 02:40:19,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143076597] [2025-02-06 02:40:19,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:40:19,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2025-02-06 02:40:19,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:40:19,203 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2025-02-06 02:40:19,204 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2025-02-06 02:40:19,204 INFO L87 Difference]: Start difference. First operand 87809 states and 137719 transitions. Second operand has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-06 02:40:30,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:40:30,149 INFO L93 Difference]: Finished difference Result 286633 states and 449355 transitions. [2025-02-06 02:40:30,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 02:40:30,150 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) Word has length 633 [2025-02-06 02:40:30,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:40:30,575 INFO L225 Difference]: With dead ends: 286633 [2025-02-06 02:40:30,576 INFO L226 Difference]: Without dead ends: 198998 [2025-02-06 02:40:30,671 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 8 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=127, Invalid=379, Unknown=0, NotChecked=0, Total=506 [2025-02-06 02:40:30,672 INFO L435 NwaCegarLoop]: 749 mSDtfsCounter, 3787 mSDsluCounter, 4832 mSDsCounter, 0 mSdLazyCounter, 3057 mSolverCounterSat, 308 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3787 SdHoareTripleChecker+Valid, 5581 SdHoareTripleChecker+Invalid, 3365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 308 IncrementalHoareTripleChecker+Valid, 3057 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:40:30,672 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3787 Valid, 5581 Invalid, 3365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [308 Valid, 3057 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2025-02-06 02:40:30,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198998 states. [2025-02-06 02:40:35,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198998 to 173682. [2025-02-06 02:40:35,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173682 states, 162813 states have (on average 1.544821359473752) internal successors, (251517), 163429 states have internal predecessors, (251517), 10128 states have call successors, (10128), 740 states have call predecessors, (10128), 740 states have return successors, (10128), 9512 states have call predecessors, (10128), 10128 states have call successors, (10128) [2025-02-06 02:40:35,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173682 states to 173682 states and 271773 transitions. [2025-02-06 02:40:35,804 INFO L78 Accepts]: Start accepts. Automaton has 173682 states and 271773 transitions. Word has length 633 [2025-02-06 02:40:35,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:40:35,805 INFO L471 AbstractCegarLoop]: Abstraction has 173682 states and 271773 transitions. [2025-02-06 02:40:35,805 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 11.142857142857142) internal successors, (156), 14 states have internal predecessors, (156), 2 states have call successors, (96), 1 states have call predecessors, (96), 1 states have return successors, (96), 2 states have call predecessors, (96), 2 states have call successors, (96) [2025-02-06 02:40:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 173682 states and 271773 transitions. [2025-02-06 02:40:35,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 634 [2025-02-06 02:40:35,877 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:40:35,877 INFO L218 NwaCegarLoop]: trace histogram [96, 96, 96, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-06 02:40:35,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-06 02:40:35,878 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:40:35,878 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:40:35,878 INFO L85 PathProgramCache]: Analyzing trace with hash -260218040, now seen corresponding path program 1 times [2025-02-06 02:40:35,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:40:35,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169470970] [2025-02-06 02:40:35,878 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:40:35,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:40:35,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 633 statements into 1 equivalence classes. [2025-02-06 02:40:35,933 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 633 of 633 statements. [2025-02-06 02:40:35,933 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:40:35,933 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat