./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-28.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_amount250_file-28.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 3fb6d49eff13d62236c26c76112d3edbdbe5247c358b6cacd9ecacff32cf6529 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-06 02:15:40,041 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-06 02:15:40,100 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:15:40,105 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-06 02:15:40,105 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-06 02:15:40,123 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-06 02:15:40,124 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-06 02:15:40,124 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-06 02:15:40,124 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-06 02:15:40,124 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-06 02:15:40,124 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-06 02:15:40,125 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-06 02:15:40,125 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-06 02:15:40,126 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-06 02:15:40,127 INFO L153 SettingsManager]: * Use SBE=true [2025-02-06 02:15:40,127 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-06 02:15:40,127 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-06 02:15:40,127 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-06 02:15:40,127 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-06 02:15:40,127 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-06 02:15:40,127 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-06 02:15:40,127 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-06 02:15:40,128 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-06 02:15:40,128 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-06 02:15:40,128 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-06 02:15:40,128 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-06 02:15:40,128 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-06 02:15:40,128 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-06 02:15:40,129 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-06 02:15:40,129 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-06 02:15:40,129 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-06 02:15:40,129 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-06 02:15:40,129 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:15:40,129 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-06 02:15:40,130 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-06 02:15:40,130 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-06 02:15:40,130 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-06 02:15:40,130 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-06 02:15:40,130 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-06 02:15:40,130 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-06 02:15:40,130 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-06 02:15:40,130 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-06 02:15:40,131 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-06 02:15:40,131 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 -> 3fb6d49eff13d62236c26c76112d3edbdbe5247c358b6cacd9ecacff32cf6529 [2025-02-06 02:15:40,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-06 02:15:40,403 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-06 02:15:40,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-06 02:15:40,406 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-06 02:15:40,406 INFO L274 PluginConnector]: CDTParser initialized [2025-02-06 02:15:40,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-28.i [2025-02-06 02:15:41,695 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d6052160/468d4bd146b64b2283a684f996469ed4/FLAG1cae07d61 [2025-02-06 02:15:42,117 INFO L384 CDTParser]: Found 1 translation units. [2025-02-06 02:15:42,118 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount250_file-28.i [2025-02-06 02:15:42,132 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d6052160/468d4bd146b64b2283a684f996469ed4/FLAG1cae07d61 [2025-02-06 02:15:42,150 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/6d6052160/468d4bd146b64b2283a684f996469ed4 [2025-02-06 02:15:42,152 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-06 02:15:42,154 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-06 02:15:42,156 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-06 02:15:42,156 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-06 02:15:42,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-06 02:15:42,161 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:15:42" (1/1) ... [2025-02-06 02:15:42,163 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@960103e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42, skipping insertion in model container [2025-02-06 02:15:42,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.02 02:15:42" (1/1) ... [2025-02-06 02:15:42,200 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-06 02:15:42,337 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_amount250_file-28.i[916,929] [2025-02-06 02:15:42,512 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:15:42,532 INFO L200 MainTranslator]: Completed pre-run [2025-02-06 02:15:42,542 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_amount250_file-28.i[916,929] [2025-02-06 02:15:42,622 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-06 02:15:42,644 INFO L204 MainTranslator]: Completed translation [2025-02-06 02:15:42,645 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42 WrapperNode [2025-02-06 02:15:42,646 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-06 02:15:42,647 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-06 02:15:42,647 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-06 02:15:42,647 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-06 02:15:42,653 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:15:42" (1/1) ... [2025-02-06 02:15:42,677 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:15:42" (1/1) ... [2025-02-06 02:15:42,764 INFO L138 Inliner]: procedures = 26, calls = 56, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 408 [2025-02-06 02:15:42,764 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-06 02:15:42,765 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-06 02:15:42,765 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-06 02:15:42,766 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-06 02:15:42,774 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42" (1/1) ... [2025-02-06 02:15:42,775 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42" (1/1) ... [2025-02-06 02:15:42,794 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42" (1/1) ... [2025-02-06 02:15:42,855 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:15:42,856 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42" (1/1) ... [2025-02-06 02:15:42,856 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42" (1/1) ... [2025-02-06 02:15:42,885 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42" (1/1) ... [2025-02-06 02:15:42,889 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42" (1/1) ... [2025-02-06 02:15:42,900 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42" (1/1) ... [2025-02-06 02:15:42,907 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42" (1/1) ... [2025-02-06 02:15:42,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-06 02:15:42,924 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-06 02:15:42,925 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-06 02:15:42,925 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-06 02:15:42,926 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42" (1/1) ... [2025-02-06 02:15:42,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-06 02:15:42,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:15:42,963 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:15:43,010 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:15:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-06 02:15:43,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-02-06 02:15:43,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-02-06 02:15:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-06 02:15:43,032 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-06 02:15:43,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-06 02:15:43,150 INFO L257 CfgBuilder]: Building ICFG [2025-02-06 02:15:43,151 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-06 02:15:44,012 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L364: havoc property_#t~ite32#1;havoc property_#t~ite31#1;havoc property_#t~bitwise30#1;havoc property_#t~bitwise33#1;havoc property_#t~short34#1;havoc property_#t~bitwise35#1;havoc property_#t~short36#1; [2025-02-06 02:15:44,166 INFO L? ?]: Removed 52 outVars from TransFormulas that were not future-live. [2025-02-06 02:15:44,166 INFO L308 CfgBuilder]: Performing block encoding [2025-02-06 02:15:44,193 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-06 02:15:44,194 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-06 02:15:44,194 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:15:44 BoogieIcfgContainer [2025-02-06 02:15:44,194 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-06 02:15:44,197 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-06 02:15:44,197 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-06 02:15:44,201 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-06 02:15:44,201 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.02 02:15:42" (1/3) ... [2025-02-06 02:15:44,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4268c7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:15:44, skipping insertion in model container [2025-02-06 02:15:44,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.02 02:15:42" (2/3) ... [2025-02-06 02:15:44,202 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4268c7fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.02 02:15:44, skipping insertion in model container [2025-02-06 02:15:44,202 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 06.02 02:15:44" (3/3) ... [2025-02-06 02:15:44,203 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount250_file-28.i [2025-02-06 02:15:44,217 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-06 02:15:44,221 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount250_file-28.i that has 2 procedures, 171 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-02-06 02:15:44,286 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-06 02:15:44,298 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;@78b06a20, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-06 02:15:44,300 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-06 02:15:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand has 171 states, 125 states have (on average 1.512) internal successors, (189), 126 states have internal predecessors, (189), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-06 02:15:44,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 02:15:44,325 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:44,326 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:44,326 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:44,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:44,333 INFO L85 PathProgramCache]: Analyzing trace with hash 203321212, now seen corresponding path program 1 times [2025-02-06 02:15:44,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:44,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884288393] [2025-02-06 02:15:44,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:44,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:44,452 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 02:15:44,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 02:15:44,500 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:44,500 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:44,881 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 84 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-02-06 02:15:44,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:44,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884288393] [2025-02-06 02:15:44,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884288393] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:15:44,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1965526807] [2025-02-06 02:15:44,883 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:44,884 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:15:44,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:15:44,886 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:15:44,888 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:15:45,045 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 02:15:45,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 02:15:45,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:45,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:45,196 INFO L256 TraceCheckSpWp]: Trace formula consists of 723 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-02-06 02:15:45,211 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:15:45,255 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 3528 trivial. 0 not checked. [2025-02-06 02:15:45,256 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-06 02:15:45,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1965526807] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:45,256 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-06 02:15:45,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-02-06 02:15:45,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1953126647] [2025-02-06 02:15:45,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:45,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-02-06 02:15:45,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:45,283 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-02-06 02:15:45,283 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-02-06 02:15:45,285 INFO L87 Difference]: Start difference. First operand has 171 states, 125 states have (on average 1.512) internal successors, (189), 126 states have internal predecessors, (189), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) Second operand has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-02-06 02:15:45,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:45,338 INFO L93 Difference]: Finished difference Result 336 states and 588 transitions. [2025-02-06 02:15:45,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-02-06 02:15:45,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) Word has length 297 [2025-02-06 02:15:45,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:45,352 INFO L225 Difference]: With dead ends: 336 [2025-02-06 02:15:45,352 INFO L226 Difference]: Without dead ends: 168 [2025-02-06 02:15:45,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 298 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:15:45,361 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:45,362 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 264 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:15:45,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2025-02-06 02:15:45,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 168. [2025-02-06 02:15:45,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 123 states have (on average 1.4959349593495934) internal successors, (184), 123 states have internal predecessors, (184), 43 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 43 states have call predecessors, (43), 43 states have call successors, (43) [2025-02-06 02:15:45,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 270 transitions. [2025-02-06 02:15:45,428 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 270 transitions. Word has length 297 [2025-02-06 02:15:45,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:45,430 INFO L471 AbstractCegarLoop]: Abstraction has 168 states and 270 transitions. [2025-02-06 02:15:45,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 43.5) internal successors, (87), 2 states have internal predecessors, (87), 2 states have call successors, (43), 2 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 2 states have call successors, (43) [2025-02-06 02:15:45,430 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 270 transitions. [2025-02-06 02:15:45,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 02:15:45,435 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:45,436 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:45,446 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-06 02:15:45,636 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:15:45,637 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:45,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:45,638 INFO L85 PathProgramCache]: Analyzing trace with hash 342424793, now seen corresponding path program 1 times [2025-02-06 02:15:45,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:45,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713868607] [2025-02-06 02:15:45,638 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:45,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:45,683 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 02:15:45,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 02:15:45,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:45,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:46,101 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:15:46,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:46,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713868607] [2025-02-06 02:15:46,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713868607] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:46,103 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:46,103 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:15:46,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920277379] [2025-02-06 02:15:46,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:46,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:15:46,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:46,109 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:15:46,109 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:15:46,109 INFO L87 Difference]: Start difference. First operand 168 states and 270 transitions. Second operand has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:15:46,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:46,231 INFO L93 Difference]: Finished difference Result 462 states and 742 transitions. [2025-02-06 02:15:46,231 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:15:46,232 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 297 [2025-02-06 02:15:46,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:46,237 INFO L225 Difference]: With dead ends: 462 [2025-02-06 02:15:46,237 INFO L226 Difference]: Without dead ends: 297 [2025-02-06 02:15:46,238 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:15:46,242 INFO L435 NwaCegarLoop]: 366 mSDtfsCounter, 197 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 197 SdHoareTripleChecker+Valid, 607 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:46,242 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [197 Valid, 607 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:15:46,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2025-02-06 02:15:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 294. [2025-02-06 02:15:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 225 states have (on average 1.5066666666666666) internal successors, (339), 226 states have internal predecessors, (339), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 02:15:46,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 471 transitions. [2025-02-06 02:15:46,291 INFO L78 Accepts]: Start accepts. Automaton has 294 states and 471 transitions. Word has length 297 [2025-02-06 02:15:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:46,293 INFO L471 AbstractCegarLoop]: Abstraction has 294 states and 471 transitions. [2025-02-06 02:15:46,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.333333333333332) internal successors, (85), 3 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:15:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 471 transitions. [2025-02-06 02:15:46,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 02:15:46,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:46,302 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:46,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-06 02:15:46,303 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:46,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -106271846, now seen corresponding path program 1 times [2025-02-06 02:15:46,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:46,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476633486] [2025-02-06 02:15:46,304 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:46,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:46,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 02:15:46,970 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 02:15:46,970 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:46,970 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:47,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:15:47,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:47,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476633486] [2025-02-06 02:15:47,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476633486] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:47,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:47,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:15:47,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856629535] [2025-02-06 02:15:47,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:47,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:15:47,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:47,456 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:15:47,456 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:15:47,457 INFO L87 Difference]: Start difference. First operand 294 states and 471 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:15:47,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:47,952 INFO L93 Difference]: Finished difference Result 776 states and 1239 transitions. [2025-02-06 02:15:47,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:15:47,957 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 297 [2025-02-06 02:15:47,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:47,966 INFO L225 Difference]: With dead ends: 776 [2025-02-06 02:15:47,966 INFO L226 Difference]: Without dead ends: 485 [2025-02-06 02:15:47,970 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:15:47,971 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 179 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:47,971 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 667 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-06 02:15:47,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 485 states. [2025-02-06 02:15:48,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 485 to 332. [2025-02-06 02:15:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 263 states have (on average 1.5247148288973384) internal successors, (401), 264 states have internal predecessors, (401), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 02:15:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 533 transitions. [2025-02-06 02:15:48,031 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 533 transitions. Word has length 297 [2025-02-06 02:15:48,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:48,032 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 533 transitions. [2025-02-06 02:15:48,033 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:15:48,033 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 533 transitions. [2025-02-06 02:15:48,036 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 02:15:48,036 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:48,036 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:48,037 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-06 02:15:48,037 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:48,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:48,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1086380791, now seen corresponding path program 1 times [2025-02-06 02:15:48,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:48,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138728564] [2025-02-06 02:15:48,038 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:48,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:48,076 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 02:15:48,326 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 02:15:48,329 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:48,330 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:48,819 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:15:48,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:48,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138728564] [2025-02-06 02:15:48,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138728564] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:15:48,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:15:48,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:15:48,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425966122] [2025-02-06 02:15:48,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:15:48,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:15:48,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:48,821 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:15:48,821 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:15:48,823 INFO L87 Difference]: Start difference. First operand 332 states and 533 transitions. Second operand has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:15:48,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:48,924 INFO L93 Difference]: Finished difference Result 661 states and 1063 transitions. [2025-02-06 02:15:48,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:15:48,926 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 297 [2025-02-06 02:15:48,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:48,932 INFO L225 Difference]: With dead ends: 661 [2025-02-06 02:15:48,932 INFO L226 Difference]: Without dead ends: 332 [2025-02-06 02:15:48,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:15:48,934 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 0 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 763 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:48,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 763 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:15:48,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 332 states. [2025-02-06 02:15:48,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 332 to 332. [2025-02-06 02:15:48,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 332 states, 263 states have (on average 1.5171102661596958) internal successors, (399), 264 states have internal predecessors, (399), 66 states have call successors, (66), 2 states have call predecessors, (66), 2 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 02:15:48,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 332 states to 332 states and 531 transitions. [2025-02-06 02:15:48,975 INFO L78 Accepts]: Start accepts. Automaton has 332 states and 531 transitions. Word has length 297 [2025-02-06 02:15:48,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:48,976 INFO L471 AbstractCegarLoop]: Abstraction has 332 states and 531 transitions. [2025-02-06 02:15:48,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.25) internal successors, (85), 4 states have internal predecessors, (85), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:15:48,977 INFO L276 IsEmpty]: Start isEmpty. Operand 332 states and 531 transitions. [2025-02-06 02:15:48,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2025-02-06 02:15:48,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:48,982 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:48,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-06 02:15:48,983 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:48,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:48,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1297731704, now seen corresponding path program 1 times [2025-02-06 02:15:48,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:48,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909309488] [2025-02-06 02:15:48,984 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:48,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:49,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 02:15:50,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 02:15:50,376 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:50,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:50,895 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 30 proven. 96 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:15:50,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:15:50,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909309488] [2025-02-06 02:15:50,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909309488] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-06 02:15:50,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1379966505] [2025-02-06 02:15:50,896 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:50,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:15:50,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-06 02:15:50,899 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-06 02:15:50,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-06 02:15:51,022 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 297 statements into 1 equivalence classes. [2025-02-06 02:15:51,140 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 297 of 297 statements. [2025-02-06 02:15:51,141 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:51,141 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:15:51,146 INFO L256 TraceCheckSpWp]: Trace formula consists of 720 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-02-06 02:15:51,154 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-06 02:15:51,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 588 proven. 9 refuted. 0 times theorem prover too weak. 3015 trivial. 0 not checked. [2025-02-06 02:15:51,372 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-06 02:15:51,769 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 117 proven. 9 refuted. 0 times theorem prover too weak. 3486 trivial. 0 not checked. [2025-02-06 02:15:51,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1379966505] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-06 02:15:51,771 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-06 02:15:51,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 11 [2025-02-06 02:15:51,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699388573] [2025-02-06 02:15:51,771 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-06 02:15:51,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:15:51,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:15:51,775 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:15:51,775 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:15:51,776 INFO L87 Difference]: Start difference. First operand 332 states and 531 transitions. Second operand has 11 states, 11 states have (on average 17.272727272727273) internal successors, (190), 11 states have internal predecessors, (190), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2025-02-06 02:15:52,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:15:52,411 INFO L93 Difference]: Finished difference Result 681 states and 1076 transitions. [2025-02-06 02:15:52,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-06 02:15:52,412 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 17.272727272727273) internal successors, (190), 11 states have internal predecessors, (190), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) Word has length 297 [2025-02-06 02:15:52,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:15:52,416 INFO L225 Difference]: With dead ends: 681 [2025-02-06 02:15:52,416 INFO L226 Difference]: Without dead ends: 352 [2025-02-06 02:15:52,417 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 608 GetRequests, 589 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=300, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:15:52,418 INFO L435 NwaCegarLoop]: 199 mSDtfsCounter, 428 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 361 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 706 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 361 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-06 02:15:52,419 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [430 Valid, 706 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 361 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-06 02:15:52,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 352 states. [2025-02-06 02:15:52,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 352 to 344. [2025-02-06 02:15:52,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 272 states have (on average 1.4705882352941178) internal successors, (400), 273 states have internal predecessors, (400), 66 states have call successors, (66), 5 states have call predecessors, (66), 5 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2025-02-06 02:15:52,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 532 transitions. [2025-02-06 02:15:52,454 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 532 transitions. Word has length 297 [2025-02-06 02:15:52,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:15:52,456 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 532 transitions. [2025-02-06 02:15:52,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 17.272727272727273) internal successors, (190), 11 states have internal predecessors, (190), 4 states have call successors, (78), 2 states have call predecessors, (78), 4 states have return successors, (80), 4 states have call predecessors, (80), 4 states have call successors, (80) [2025-02-06 02:15:52,457 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 532 transitions. [2025-02-06 02:15:52,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:15:52,461 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:15:52,461 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:52,473 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-06 02:15:52,662 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-06 02:15:52,662 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:15:52,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:15:52,664 INFO L85 PathProgramCache]: Analyzing trace with hash -2143529413, now seen corresponding path program 1 times [2025-02-06 02:15:52,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:15:52,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675204362] [2025-02-06 02:15:52,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:15:52,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:15:52,695 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:15:52,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:15:52,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:15:52,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:10,198 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:16:10,199 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:10,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675204362] [2025-02-06 02:16:10,199 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675204362] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:10,199 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:10,199 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:16:10,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049808126] [2025-02-06 02:16:10,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:10,200 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:16:10,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:10,202 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:16:10,202 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:16:10,203 INFO L87 Difference]: Start difference. First operand 344 states and 532 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-02-06 02:16:13,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:13,594 INFO L93 Difference]: Finished difference Result 1473 states and 2257 transitions. [2025-02-06 02:16:13,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:16:13,595 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 299 [2025-02-06 02:16:13,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:13,605 INFO L225 Difference]: With dead ends: 1473 [2025-02-06 02:16:13,605 INFO L226 Difference]: Without dead ends: 1102 [2025-02-06 02:16:13,608 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=84, Invalid=258, Unknown=0, NotChecked=0, Total=342 [2025-02-06 02:16:13,609 INFO L435 NwaCegarLoop]: 269 mSDtfsCounter, 878 mSDsluCounter, 1869 mSDsCounter, 0 mSdLazyCounter, 1147 mSolverCounterSat, 153 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 878 SdHoareTripleChecker+Valid, 2138 SdHoareTripleChecker+Invalid, 1300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 153 IncrementalHoareTripleChecker+Valid, 1147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:13,610 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [878 Valid, 2138 Invalid, 1300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [153 Valid, 1147 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2025-02-06 02:16:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1102 states. [2025-02-06 02:16:13,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1102 to 662. [2025-02-06 02:16:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 535 states have (on average 1.4710280373831777) internal successors, (787), 538 states have internal predecessors, (787), 115 states have call successors, (115), 11 states have call predecessors, (115), 11 states have return successors, (115), 112 states have call predecessors, (115), 115 states have call successors, (115) [2025-02-06 02:16:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1017 transitions. [2025-02-06 02:16:13,678 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1017 transitions. Word has length 299 [2025-02-06 02:16:13,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:13,679 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1017 transitions. [2025-02-06 02:16:13,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-02-06 02:16:13,679 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1017 transitions. [2025-02-06 02:16:13,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:16:13,683 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:13,683 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:13,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-06 02:16:13,684 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:13,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:13,685 INFO L85 PathProgramCache]: Analyzing trace with hash -1118037414, now seen corresponding path program 1 times [2025-02-06 02:16:13,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:13,685 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1420218139] [2025-02-06 02:16:13,685 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:13,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:13,710 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:16:13,939 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:16:13,939 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:13,939 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:14,483 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:16:14,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:14,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1420218139] [2025-02-06 02:16:14,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1420218139] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:14,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:14,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-06 02:16:14,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977649125] [2025-02-06 02:16:14,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:14,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-06 02:16:14,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:14,486 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-06 02:16:14,486 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-06 02:16:14,486 INFO L87 Difference]: Start difference. First operand 662 states and 1017 transitions. Second operand has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:16:14,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:14,620 INFO L93 Difference]: Finished difference Result 1551 states and 2390 transitions. [2025-02-06 02:16:14,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-06 02:16:14,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-02-06 02:16:14,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:14,627 INFO L225 Difference]: With dead ends: 1551 [2025-02-06 02:16:14,628 INFO L226 Difference]: Without dead ends: 964 [2025-02-06 02:16:14,630 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:16:14,630 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 328 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 328 SdHoareTripleChecker+Valid, 472 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:14,630 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [328 Valid, 472 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-06 02:16:14,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2025-02-06 02:16:14,685 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 778. [2025-02-06 02:16:14,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 778 states, 651 states have (on average 1.4700460829493087) internal successors, (957), 654 states have internal predecessors, (957), 115 states have call successors, (115), 11 states have call predecessors, (115), 11 states have return successors, (115), 112 states have call predecessors, (115), 115 states have call successors, (115) [2025-02-06 02:16:14,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 778 states to 778 states and 1187 transitions. [2025-02-06 02:16:14,692 INFO L78 Accepts]: Start accepts. Automaton has 778 states and 1187 transitions. Word has length 299 [2025-02-06 02:16:14,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:14,692 INFO L471 AbstractCegarLoop]: Abstraction has 778 states and 1187 transitions. [2025-02-06 02:16:14,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 21.75) internal successors, (87), 4 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:16:14,693 INFO L276 IsEmpty]: Start isEmpty. Operand 778 states and 1187 transitions. [2025-02-06 02:16:14,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:16:14,697 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:14,697 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:14,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-02-06 02:16:14,698 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:14,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:14,698 INFO L85 PathProgramCache]: Analyzing trace with hash -1358577543, now seen corresponding path program 1 times [2025-02-06 02:16:14,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:14,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914392858] [2025-02-06 02:16:14,698 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:14,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:14,718 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:16:14,740 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:16:14,741 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:14,741 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:14,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:16:14,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:14,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914392858] [2025-02-06 02:16:14,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914392858] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:14,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:14,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-06 02:16:14,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605917142] [2025-02-06 02:16:14,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:14,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-06 02:16:14,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:14,836 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-06 02:16:14,836 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-06 02:16:14,836 INFO L87 Difference]: Start difference. First operand 778 states and 1187 transitions. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:16:14,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:14,917 INFO L93 Difference]: Finished difference Result 1237 states and 1886 transitions. [2025-02-06 02:16:14,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-06 02:16:14,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-02-06 02:16:14,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:14,922 INFO L225 Difference]: With dead ends: 1237 [2025-02-06 02:16:14,923 INFO L226 Difference]: Without dead ends: 664 [2025-02-06 02:16:14,924 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:16:14,924 INFO L435 NwaCegarLoop]: 377 mSDtfsCounter, 236 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:14,925 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 509 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-06 02:16:14,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 664 states. [2025-02-06 02:16:14,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 664 to 654. [2025-02-06 02:16:14,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 527 states have (on average 1.4402277039848197) internal successors, (759), 530 states have internal predecessors, (759), 115 states have call successors, (115), 11 states have call predecessors, (115), 11 states have return successors, (115), 112 states have call predecessors, (115), 115 states have call successors, (115) [2025-02-06 02:16:14,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 989 transitions. [2025-02-06 02:16:14,973 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 989 transitions. Word has length 299 [2025-02-06 02:16:14,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:14,974 INFO L471 AbstractCegarLoop]: Abstraction has 654 states and 989 transitions. [2025-02-06 02:16:14,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:16:14,974 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 989 transitions. [2025-02-06 02:16:14,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:16:14,978 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:14,979 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:14,979 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-02-06 02:16:14,979 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:14,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:14,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1007777606, now seen corresponding path program 1 times [2025-02-06 02:16:14,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:14,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126480194] [2025-02-06 02:16:14,980 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:14,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:15,000 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:16:15,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:16:15,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:15,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:16:38,980 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:38,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126480194] [2025-02-06 02:16:38,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126480194] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:38,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:38,980 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-02-06 02:16:38,980 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [449261492] [2025-02-06 02:16:38,980 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:38,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-06 02:16:38,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:38,981 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-06 02:16:38,981 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2025-02-06 02:16:38,982 INFO L87 Difference]: Start difference. First operand 654 states and 989 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-02-06 02:16:41,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:41,452 INFO L93 Difference]: Finished difference Result 1693 states and 2566 transitions. [2025-02-06 02:16:41,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-06 02:16:41,453 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 299 [2025-02-06 02:16:41,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:41,462 INFO L225 Difference]: With dead ends: 1693 [2025-02-06 02:16:41,462 INFO L226 Difference]: Without dead ends: 1344 [2025-02-06 02:16:41,464 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=122, Invalid=298, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:16:41,466 INFO L435 NwaCegarLoop]: 264 mSDtfsCounter, 1026 mSDsluCounter, 1428 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1692 SdHoareTripleChecker+Invalid, 1164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:41,467 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1692 Invalid, 1164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2025-02-06 02:16:41,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1344 states. [2025-02-06 02:16:41,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1344 to 728. [2025-02-06 02:16:41,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 728 states, 601 states have (on average 1.4492512479201332) internal successors, (871), 604 states have internal predecessors, (871), 115 states have call successors, (115), 11 states have call predecessors, (115), 11 states have return successors, (115), 112 states have call predecessors, (115), 115 states have call successors, (115) [2025-02-06 02:16:41,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 728 states to 728 states and 1101 transitions. [2025-02-06 02:16:41,528 INFO L78 Accepts]: Start accepts. Automaton has 728 states and 1101 transitions. Word has length 299 [2025-02-06 02:16:41,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:41,530 INFO L471 AbstractCegarLoop]: Abstraction has 728 states and 1101 transitions. [2025-02-06 02:16:41,531 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 12 states have internal predecessors, (87), 2 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2025-02-06 02:16:41,531 INFO L276 IsEmpty]: Start isEmpty. Operand 728 states and 1101 transitions. [2025-02-06 02:16:41,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:16:41,535 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:41,536 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:41,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-06 02:16:41,536 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:41,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:41,537 INFO L85 PathProgramCache]: Analyzing trace with hash 1361656379, now seen corresponding path program 1 times [2025-02-06 02:16:41,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:41,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1457891332] [2025-02-06 02:16:41,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:41,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:41,559 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:16:41,681 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:16:41,682 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:41,682 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:16:43,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:43,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1457891332] [2025-02-06 02:16:43,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1457891332] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:43,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:43,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2025-02-06 02:16:43,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109992884] [2025-02-06 02:16:43,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:43,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-02-06 02:16:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:43,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-02-06 02:16:43,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2025-02-06 02:16:43,075 INFO L87 Difference]: Start difference. First operand 728 states and 1101 transitions. Second operand has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:16:46,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:46,188 INFO L93 Difference]: Finished difference Result 1982 states and 2969 transitions. [2025-02-06 02:16:46,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-06 02:16:46,189 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) Word has length 299 [2025-02-06 02:16:46,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:46,200 INFO L225 Difference]: With dead ends: 1982 [2025-02-06 02:16:46,201 INFO L226 Difference]: Without dead ends: 1633 [2025-02-06 02:16:46,203 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=106, Invalid=314, Unknown=0, NotChecked=0, Total=420 [2025-02-06 02:16:46,203 INFO L435 NwaCegarLoop]: 507 mSDtfsCounter, 1062 mSDsluCounter, 1940 mSDsCounter, 0 mSdLazyCounter, 2044 mSolverCounterSat, 213 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1062 SdHoareTripleChecker+Valid, 2447 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 213 IncrementalHoareTripleChecker+Valid, 2044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:46,204 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1062 Valid, 2447 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [213 Valid, 2044 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2025-02-06 02:16:46,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1633 states. [2025-02-06 02:16:46,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1633 to 1415. [2025-02-06 02:16:46,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1415 states, 1146 states have (on average 1.4240837696335078) internal successors, (1632), 1155 states have internal predecessors, (1632), 239 states have call successors, (239), 29 states have call predecessors, (239), 29 states have return successors, (239), 230 states have call predecessors, (239), 239 states have call successors, (239) [2025-02-06 02:16:46,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1415 states to 1415 states and 2110 transitions. [2025-02-06 02:16:46,345 INFO L78 Accepts]: Start accepts. Automaton has 1415 states and 2110 transitions. Word has length 299 [2025-02-06 02:16:46,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:46,345 INFO L471 AbstractCegarLoop]: Abstraction has 1415 states and 2110 transitions. [2025-02-06 02:16:46,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.7) internal successors, (87), 10 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43) [2025-02-06 02:16:46,346 INFO L276 IsEmpty]: Start isEmpty. Operand 1415 states and 2110 transitions. [2025-02-06 02:16:46,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:16:46,350 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:46,351 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:46,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-02-06 02:16:46,351 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:46,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:46,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2054758076, now seen corresponding path program 1 times [2025-02-06 02:16:46,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:46,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593954098] [2025-02-06 02:16:46,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:46,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:46,373 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:16:46,519 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:16:46,520 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:46,520 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:48,290 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:16:48,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:48,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593954098] [2025-02-06 02:16:48,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593954098] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:48,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:48,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2025-02-06 02:16:48,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921763858] [2025-02-06 02:16:48,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:48,293 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-02-06 02:16:48,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:48,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-02-06 02:16:48,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2025-02-06 02:16:48,294 INFO L87 Difference]: Start difference. First operand 1415 states and 2110 transitions. Second operand has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-02-06 02:16:50,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-06 02:16:50,210 INFO L93 Difference]: Finished difference Result 3689 states and 5439 transitions. [2025-02-06 02:16:50,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-06 02:16:50,211 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 299 [2025-02-06 02:16:50,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-06 02:16:50,227 INFO L225 Difference]: With dead ends: 3689 [2025-02-06 02:16:50,227 INFO L226 Difference]: Without dead ends: 2913 [2025-02-06 02:16:50,231 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=139, Invalid=367, Unknown=0, NotChecked=0, Total=506 [2025-02-06 02:16:50,232 INFO L435 NwaCegarLoop]: 360 mSDtfsCounter, 1343 mSDsluCounter, 1953 mSDsCounter, 0 mSdLazyCounter, 1113 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1343 SdHoareTripleChecker+Valid, 2313 SdHoareTripleChecker+Invalid, 1381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 1113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2025-02-06 02:16:50,233 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1343 Valid, 2313 Invalid, 1381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 1113 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2025-02-06 02:16:50,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2913 states. [2025-02-06 02:16:50,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2913 to 2263. [2025-02-06 02:16:50,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2263 states, 1876 states have (on average 1.415778251599147) internal successors, (2656), 1897 states have internal predecessors, (2656), 335 states have call successors, (335), 51 states have call predecessors, (335), 51 states have return successors, (335), 314 states have call predecessors, (335), 335 states have call successors, (335) [2025-02-06 02:16:50,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2263 states to 2263 states and 3326 transitions. [2025-02-06 02:16:50,567 INFO L78 Accepts]: Start accepts. Automaton has 2263 states and 3326 transitions. Word has length 299 [2025-02-06 02:16:50,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-06 02:16:50,568 INFO L471 AbstractCegarLoop]: Abstraction has 2263 states and 3326 transitions. [2025-02-06 02:16:50,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 7.909090909090909) internal successors, (87), 11 states have internal predecessors, (87), 3 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2025-02-06 02:16:50,568 INFO L276 IsEmpty]: Start isEmpty. Operand 2263 states and 3326 transitions. [2025-02-06 02:16:50,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2025-02-06 02:16:50,573 INFO L210 NwaCegarLoop]: Found error trace [2025-02-06 02:16:50,574 INFO L218 NwaCegarLoop]: trace histogram [43, 43, 43, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:50,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-02-06 02:16:50,574 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-06 02:16:50,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-06 02:16:50,575 INFO L85 PathProgramCache]: Analyzing trace with hash 2046998717, now seen corresponding path program 1 times [2025-02-06 02:16:50,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-06 02:16:50,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805934663] [2025-02-06 02:16:50,575 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-06 02:16:50,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-06 02:16:50,594 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 299 statements into 1 equivalence classes. [2025-02-06 02:16:50,716 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 299 of 299 statements. [2025-02-06 02:16:50,716 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-06 02:16:50,716 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-06 02:16:52,024 INFO L134 CoverageAnalysis]: Checked inductivity of 3612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3612 trivial. 0 not checked. [2025-02-06 02:16:52,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-06 02:16:52,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805934663] [2025-02-06 02:16:52,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805934663] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-06 02:16:52,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-06 02:16:52,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-02-06 02:16:52,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026746673] [2025-02-06 02:16:52,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-06 02:16:52,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-06 02:16:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-06 02:16:52,025 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-06 02:16:52,025 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2025-02-06 02:16:52,026 INFO L87 Difference]: Start difference. First operand 2263 states and 3326 transitions. Second operand has 9 states, 9 states have (on average 9.666666666666666) internal successors, (87), 9 states have internal predecessors, (87), 1 states have call successors, (43), 1 states have call predecessors, (43), 1 states have return successors, (43), 1 states have call predecessors, (43), 1 states have call successors, (43)