./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 22f39f2d47020c6c74bd46a8e88abd85ecc8d2cba04a8c3eaf7d602b79a3fb5b --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 15:43:26,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 15:43:26,751 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 15:43:26,759 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 15:43:26,759 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 15:43:26,778 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 15:43:26,779 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 15:43:26,779 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 15:43:26,780 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 15:43:26,780 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 15:43:26,781 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 15:43:26,781 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 15:43:26,781 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 15:43:26,781 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 15:43:26,781 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 15:43:26,781 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 15:43:26,781 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 15:43:26,781 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 15:43:26,781 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 15:43:26,781 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 15:43:26,781 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 15:43:26,781 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 15:43:26,782 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:43:26,782 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 15:43:26,782 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 15:43:26,782 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/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 -> 22f39f2d47020c6c74bd46a8e88abd85ecc8d2cba04a8c3eaf7d602b79a3fb5b [2025-03-08 15:43:27,001 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 15:43:27,006 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 15:43:27,008 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 15:43:27,009 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 15:43:27,009 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 15:43:27,010 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i [2025-03-08 15:43:28,162 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c2b6dd2/cf58636a82cb4ee281b0165ae9029e87/FLAGc1f411820 [2025-03-08 15:43:28,534 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 15:43:28,535 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i [2025-03-08 15:43:28,552 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c2b6dd2/cf58636a82cb4ee281b0165ae9029e87/FLAGc1f411820 [2025-03-08 15:43:28,565 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a0c2b6dd2/cf58636a82cb4ee281b0165ae9029e87 [2025-03-08 15:43:28,568 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 15:43:28,570 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 15:43:28,571 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 15:43:28,571 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 15:43:28,574 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 15:43:28,575 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,575 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ec176d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:28, skipping insertion in model container [2025-03-08 15:43:28,575 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 03:43:28" (1/1) ... [2025-03-08 15:43:28,608 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 15:43:28,715 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i[916,929] [2025-03-08 15:43:28,923 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:43:28,936 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 15:43:28,945 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount500_file-38.i[916,929] [2025-03-08 15:43:29,064 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 15:43:29,087 INFO L204 MainTranslator]: Completed translation [2025-03-08 15:43:29,087 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29 WrapperNode [2025-03-08 15:43:29,087 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 15:43:29,088 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 15:43:29,088 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 15:43:29,088 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 15:43:29,093 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (1/1) ... [2025-03-08 15:43:29,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (1/1) ... [2025-03-08 15:43:29,176 INFO L138 Inliner]: procedures = 26, calls = 84, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 664 [2025-03-08 15:43:29,177 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 15:43:29,178 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 15:43:29,179 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 15:43:29,179 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 15:43:29,186 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (1/1) ... [2025-03-08 15:43:29,186 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (1/1) ... [2025-03-08 15:43:29,206 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (1/1) ... [2025-03-08 15:43:29,285 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-03-08 15:43:29,286 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (1/1) ... [2025-03-08 15:43:29,286 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (1/1) ... [2025-03-08 15:43:29,315 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (1/1) ... [2025-03-08 15:43:29,321 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (1/1) ... [2025-03-08 15:43:29,330 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (1/1) ... [2025-03-08 15:43:29,335 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (1/1) ... [2025-03-08 15:43:29,346 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 15:43:29,347 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 15:43:29,347 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 15:43:29,347 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 15:43:29,348 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (1/1) ... [2025-03-08 15:43:29,352 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 15:43:29,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:43:29,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 15:43:29,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 15:43:29,396 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 15:43:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-08 15:43:29,397 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-08 15:43:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 15:43:29,397 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 15:43:29,397 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 15:43:29,499 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 15:43:29,501 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 15:43:30,404 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L627: havoc property_#t~ite53#1;havoc property_#t~bitwise52#1;havoc property_#t~short54#1;havoc property_#t~bitwise55#1;havoc property_#t~short56#1;havoc property_#t~bitwise57#1;havoc property_#t~short58#1; [2025-03-08 15:43:30,547 INFO L? ?]: Removed 67 outVars from TransFormulas that were not future-live. [2025-03-08 15:43:30,547 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 15:43:30,567 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 15:43:30,568 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 15:43:30,568 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:43:30 BoogieIcfgContainer [2025-03-08 15:43:30,568 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 15:43:30,570 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 15:43:30,570 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 15:43:30,573 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 15:43:30,573 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 03:43:28" (1/3) ... [2025-03-08 15:43:30,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a67e6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:43:30, skipping insertion in model container [2025-03-08 15:43:30,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 03:43:29" (2/3) ... [2025-03-08 15:43:30,574 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@a67e6fc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 03:43:30, skipping insertion in model container [2025-03-08 15:43:30,574 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 03:43:30" (3/3) ... [2025-03-08 15:43:30,575 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount500_file-38.i [2025-03-08 15:43:30,585 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 15:43:30,587 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_operatoramount_amount500_file-38.i that has 2 procedures, 271 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-08 15:43:30,654 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 15:43:30,666 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;@4fc02e60, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 15:43:30,668 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 15:43:30,673 INFO L276 IsEmpty]: Start isEmpty. Operand has 271 states, 197 states have (on average 1.5380710659898478) internal successors, (303), 198 states have internal predecessors, (303), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-08 15:43:30,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:43:30,697 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:30,697 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:30,698 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:30,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:30,704 INFO L85 PathProgramCache]: Analyzing trace with hash -338676512, now seen corresponding path program 1 times [2025-03-08 15:43:30,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:30,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939240556] [2025-03-08 15:43:30,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:30,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:30,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:43:30,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:43:30,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:30,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:31,258 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 140 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-03-08 15:43:31,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:31,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939240556] [2025-03-08 15:43:31,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1939240556] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:43:31,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [852645505] [2025-03-08 15:43:31,260 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:31,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:43:31,261 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:43:31,263 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:43:31,265 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 15:43:31,430 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:43:31,600 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:43:31,600 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:31,600 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:31,609 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-08 15:43:31,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:43:31,676 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 9800 trivial. 0 not checked. [2025-03-08 15:43:31,677 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-08 15:43:31,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [852645505] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:31,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-08 15:43:31,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-08 15:43:31,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710259002] [2025-03-08 15:43:31,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:31,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-08 15:43:31,684 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:31,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-08 15:43:31,708 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-08 15:43:31,712 INFO L87 Difference]: Start difference. First operand has 271 states, 197 states have (on average 1.5380710659898478) internal successors, (303), 198 states have internal predecessors, (303), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) Second operand has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-03-08 15:43:31,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:31,778 INFO L93 Difference]: Finished difference Result 536 states and 956 transitions. [2025-03-08 15:43:31,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-08 15:43:31,780 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) Word has length 483 [2025-03-08 15:43:31,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:31,788 INFO L225 Difference]: With dead ends: 536 [2025-03-08 15:43:31,790 INFO L226 Difference]: Without dead ends: 268 [2025-03-08 15:43:31,796 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 484 GetRequests, 484 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-03-08 15:43:31,798 INFO L435 NwaCegarLoop]: 432 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, 432 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-03-08 15:43:31,800 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 432 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:43:31,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 268 states. [2025-03-08 15:43:31,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 268 to 268. [2025-03-08 15:43:31,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 195 states have (on average 1.5179487179487179) internal successors, (296), 195 states have internal predecessors, (296), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-08 15:43:31,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 438 transitions. [2025-03-08 15:43:31,872 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 438 transitions. Word has length 483 [2025-03-08 15:43:31,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:31,874 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 438 transitions. [2025-03-08 15:43:31,875 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 66.5) internal successors, (133), 2 states have internal predecessors, (133), 2 states have call successors, (71), 2 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 2 states have call successors, (71) [2025-03-08 15:43:31,875 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 438 transitions. [2025-03-08 15:43:31,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:43:31,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:31,886 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:31,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-03-08 15:43:32,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-03-08 15:43:32,092 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:32,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:32,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1736119287, now seen corresponding path program 1 times [2025-03-08 15:43:32,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:32,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276871552] [2025-03-08 15:43:32,093 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:32,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:32,147 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:43:32,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:43:32,255 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:32,255 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:32,664 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-08 15:43:32,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:32,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276871552] [2025-03-08 15:43:32,665 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276871552] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:32,665 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:32,665 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:32,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028770825] [2025-03-08 15:43:32,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:32,668 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:32,668 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:32,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:32,669 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:32,669 INFO L87 Difference]: Start difference. First operand 268 states and 438 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:32,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:32,842 INFO L93 Difference]: Finished difference Result 788 states and 1289 transitions. [2025-03-08 15:43:32,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:32,842 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-03-08 15:43:32,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:32,850 INFO L225 Difference]: With dead ends: 788 [2025-03-08 15:43:32,850 INFO L226 Difference]: Without dead ends: 523 [2025-03-08 15:43:32,851 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-03-08 15:43:32,852 INFO L435 NwaCegarLoop]: 674 mSDtfsCounter, 405 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 405 SdHoareTripleChecker+Valid, 1060 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:32,852 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [405 Valid, 1060 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:32,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2025-03-08 15:43:32,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 322. [2025-03-08 15:43:32,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 249 states have (on average 1.5301204819277108) internal successors, (381), 249 states have internal predecessors, (381), 71 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 71 states have call predecessors, (71), 71 states have call successors, (71) [2025-03-08 15:43:32,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 523 transitions. [2025-03-08 15:43:32,897 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 523 transitions. Word has length 483 [2025-03-08 15:43:32,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:32,900 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 523 transitions. [2025-03-08 15:43:32,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:32,901 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 523 transitions. [2025-03-08 15:43:32,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:43:32,905 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:32,906 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:32,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-08 15:43:32,906 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:32,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:32,907 INFO L85 PathProgramCache]: Analyzing trace with hash 995249867, now seen corresponding path program 1 times [2025-03-08 15:43:32,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:32,907 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325273359] [2025-03-08 15:43:32,907 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:32,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:32,961 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:43:33,032 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:43:33,033 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:33,033 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:33,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-08 15:43:33,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:33,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325273359] [2025-03-08 15:43:33,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325273359] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:33,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:33,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:33,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343422794] [2025-03-08 15:43:33,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:33,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:33,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:33,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:33,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:33,387 INFO L87 Difference]: Start difference. First operand 322 states and 523 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:33,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:33,509 INFO L93 Difference]: Finished difference Result 880 states and 1431 transitions. [2025-03-08 15:43:33,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:33,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-03-08 15:43:33,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:33,514 INFO L225 Difference]: With dead ends: 880 [2025-03-08 15:43:33,514 INFO L226 Difference]: Without dead ends: 561 [2025-03-08 15:43:33,515 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-03-08 15:43:33,515 INFO L435 NwaCegarLoop]: 420 mSDtfsCounter, 306 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 825 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:33,516 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 825 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:33,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2025-03-08 15:43:33,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 558. [2025-03-08 15:43:33,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 446 states have (on average 1.5336322869955157) internal successors, (684), 447 states have internal predecessors, (684), 109 states have call successors, (109), 2 states have call predecessors, (109), 2 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-08 15:43:33,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 902 transitions. [2025-03-08 15:43:33,549 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 902 transitions. Word has length 483 [2025-03-08 15:43:33,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:33,550 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 902 transitions. [2025-03-08 15:43:33,551 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:33,551 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 902 transitions. [2025-03-08 15:43:33,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:43:33,555 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:33,556 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:33,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-08 15:43:33,556 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:33,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:33,557 INFO L85 PathProgramCache]: Analyzing trace with hash 124963499, now seen corresponding path program 1 times [2025-03-08 15:43:33,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:33,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734238877] [2025-03-08 15:43:33,557 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:33,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:33,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:43:33,643 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:43:33,643 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:33,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:33,855 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-08 15:43:33,855 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:33,855 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734238877] [2025-03-08 15:43:33,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734238877] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:33,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:33,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:33,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455781137] [2025-03-08 15:43:33,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:33,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:33,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:33,858 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:33,858 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:33,858 INFO L87 Difference]: Start difference. First operand 558 states and 902 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:34,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:34,000 INFO L93 Difference]: Finished difference Result 1450 states and 2338 transitions. [2025-03-08 15:43:34,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:34,001 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-03-08 15:43:34,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:34,009 INFO L225 Difference]: With dead ends: 1450 [2025-03-08 15:43:34,009 INFO L226 Difference]: Without dead ends: 895 [2025-03-08 15:43:34,011 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-03-08 15:43:34,013 INFO L435 NwaCegarLoop]: 411 mSDtfsCounter, 374 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 374 SdHoareTripleChecker+Valid, 805 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:34,013 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [374 Valid, 805 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:34,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2025-03-08 15:43:34,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 558. [2025-03-08 15:43:34,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 558 states, 446 states have (on average 1.493273542600897) internal successors, (666), 447 states have internal predecessors, (666), 109 states have call successors, (109), 2 states have call predecessors, (109), 2 states have return successors, (109), 108 states have call predecessors, (109), 109 states have call successors, (109) [2025-03-08 15:43:34,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 558 states to 558 states and 884 transitions. [2025-03-08 15:43:34,080 INFO L78 Accepts]: Start accepts. Automaton has 558 states and 884 transitions. Word has length 483 [2025-03-08 15:43:34,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:34,081 INFO L471 AbstractCegarLoop]: Abstraction has 558 states and 884 transitions. [2025-03-08 15:43:34,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:34,081 INFO L276 IsEmpty]: Start isEmpty. Operand 558 states and 884 transitions. [2025-03-08 15:43:34,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:43:34,088 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:34,088 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:34,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-08 15:43:34,088 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:34,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:34,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1757767498, now seen corresponding path program 1 times [2025-03-08 15:43:34,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:34,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917287749] [2025-03-08 15:43:34,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:34,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:34,126 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:43:34,173 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:43:34,173 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:34,173 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:34,335 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-08 15:43:34,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:34,335 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917287749] [2025-03-08 15:43:34,335 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917287749] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:34,335 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:34,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:34,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867240302] [2025-03-08 15:43:34,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:34,336 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:34,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:34,337 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:34,337 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:34,337 INFO L87 Difference]: Start difference. First operand 558 states and 884 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:34,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:34,476 INFO L93 Difference]: Finished difference Result 1665 states and 2641 transitions. [2025-03-08 15:43:34,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:34,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-03-08 15:43:34,477 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:34,483 INFO L225 Difference]: With dead ends: 1665 [2025-03-08 15:43:34,483 INFO L226 Difference]: Without dead ends: 1110 [2025-03-08 15:43:34,484 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-03-08 15:43:34,485 INFO L435 NwaCegarLoop]: 468 mSDtfsCounter, 406 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 406 SdHoareTripleChecker+Valid, 864 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:34,485 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [406 Valid, 864 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:34,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1110 states. [2025-03-08 15:43:34,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1110 to 1108. [2025-03-08 15:43:34,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1108 states, 885 states have (on average 1.4734463276836158) internal successors, (1304), 887 states have internal predecessors, (1304), 218 states have call successors, (218), 4 states have call predecessors, (218), 4 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-03-08 15:43:34,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1108 states to 1108 states and 1740 transitions. [2025-03-08 15:43:34,574 INFO L78 Accepts]: Start accepts. Automaton has 1108 states and 1740 transitions. Word has length 483 [2025-03-08 15:43:34,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:34,575 INFO L471 AbstractCegarLoop]: Abstraction has 1108 states and 1740 transitions. [2025-03-08 15:43:34,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:34,576 INFO L276 IsEmpty]: Start isEmpty. Operand 1108 states and 1740 transitions. [2025-03-08 15:43:34,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:43:34,581 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:34,582 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:34,582 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-08 15:43:34,582 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:34,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:34,583 INFO L85 PathProgramCache]: Analyzing trace with hash -177892789, now seen corresponding path program 1 times [2025-03-08 15:43:34,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:34,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562266376] [2025-03-08 15:43:34,583 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:34,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:34,644 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:43:34,735 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:43:34,735 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:34,735 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:35,078 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-08 15:43:35,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:35,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562266376] [2025-03-08 15:43:35,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562266376] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:35,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:35,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:35,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040628582] [2025-03-08 15:43:35,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:35,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:35,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:35,080 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:35,080 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:35,080 INFO L87 Difference]: Start difference. First operand 1108 states and 1740 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:35,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:35,132 INFO L93 Difference]: Finished difference Result 2221 states and 3493 transitions. [2025-03-08 15:43:35,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:35,133 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-03-08 15:43:35,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:35,139 INFO L225 Difference]: With dead ends: 2221 [2025-03-08 15:43:35,140 INFO L226 Difference]: Without dead ends: 1116 [2025-03-08 15:43:35,143 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-03-08 15:43:35,143 INFO L435 NwaCegarLoop]: 429 mSDtfsCounter, 0 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 853 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:35,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 853 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 15:43:35,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1116 states. [2025-03-08 15:43:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1116 to 1116. [2025-03-08 15:43:35,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1116 states, 893 states have (on average 1.469204927211646) internal successors, (1312), 895 states have internal predecessors, (1312), 218 states have call successors, (218), 4 states have call predecessors, (218), 4 states have return successors, (218), 216 states have call predecessors, (218), 218 states have call successors, (218) [2025-03-08 15:43:35,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1116 states to 1116 states and 1748 transitions. [2025-03-08 15:43:35,225 INFO L78 Accepts]: Start accepts. Automaton has 1116 states and 1748 transitions. Word has length 483 [2025-03-08 15:43:35,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:35,225 INFO L471 AbstractCegarLoop]: Abstraction has 1116 states and 1748 transitions. [2025-03-08 15:43:35,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:35,226 INFO L276 IsEmpty]: Start isEmpty. Operand 1116 states and 1748 transitions. [2025-03-08 15:43:35,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:43:35,232 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:35,233 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:35,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-08 15:43:35,233 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:35,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:35,234 INFO L85 PathProgramCache]: Analyzing trace with hash -76980822, now seen corresponding path program 1 times [2025-03-08 15:43:35,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:35,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40228707] [2025-03-08 15:43:35,234 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:35,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:35,283 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:43:35,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:43:35,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:35,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-08 15:43:36,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:36,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40228707] [2025-03-08 15:43:36,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40228707] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:36,048 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:36,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:43:36,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305084543] [2025-03-08 15:43:36,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:36,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:43:36,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:36,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:43:36,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:43:36,050 INFO L87 Difference]: Start difference. First operand 1116 states and 1748 transitions. Second operand has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:36,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:36,469 INFO L93 Difference]: Finished difference Result 3120 states and 4880 transitions. [2025-03-08 15:43:36,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:43:36,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-03-08 15:43:36,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:36,482 INFO L225 Difference]: With dead ends: 3120 [2025-03-08 15:43:36,482 INFO L226 Difference]: Without dead ends: 2007 [2025-03-08 15:43:36,485 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:36,486 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 521 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 293 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:36,487 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 1348 Invalid, 293 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:43:36,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2007 states. [2025-03-08 15:43:36,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2007 to 1672. [2025-03-08 15:43:36,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1672 states, 1338 states have (on average 1.4618834080717489) internal successors, (1956), 1341 states have internal predecessors, (1956), 327 states have call successors, (327), 6 states have call predecessors, (327), 6 states have return successors, (327), 324 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-08 15:43:36,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1672 states to 1672 states and 2610 transitions. [2025-03-08 15:43:36,579 INFO L78 Accepts]: Start accepts. Automaton has 1672 states and 2610 transitions. Word has length 483 [2025-03-08 15:43:36,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:36,580 INFO L471 AbstractCegarLoop]: Abstraction has 1672 states and 2610 transitions. [2025-03-08 15:43:36,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 32.75) internal successors, (131), 4 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:36,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1672 states and 2610 transitions. [2025-03-08 15:43:36,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 484 [2025-03-08 15:43:36,586 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:36,586 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:36,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-08 15:43:36,586 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:36,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:36,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1031834377, now seen corresponding path program 1 times [2025-03-08 15:43:36,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:36,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901922059] [2025-03-08 15:43:36,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:36,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:36,623 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 483 statements into 1 equivalence classes. [2025-03-08 15:43:36,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 483 of 483 statements. [2025-03-08 15:43:36,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:36,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:37,579 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-08 15:43:37,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:37,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901922059] [2025-03-08 15:43:37,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901922059] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:37,580 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:37,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:43:37,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [547830262] [2025-03-08 15:43:37,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:37,581 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:43:37,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:37,582 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:43:37,582 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:37,582 INFO L87 Difference]: Start difference. First operand 1672 states and 2610 transitions. Second operand has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:38,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:38,221 INFO L93 Difference]: Finished difference Result 2945 states and 4605 transitions. [2025-03-08 15:43:38,221 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-08 15:43:38,221 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 483 [2025-03-08 15:43:38,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:38,230 INFO L225 Difference]: With dead ends: 2945 [2025-03-08 15:43:38,230 INFO L226 Difference]: Without dead ends: 1832 [2025-03-08 15:43:38,233 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-08 15:43:38,234 INFO L435 NwaCegarLoop]: 548 mSDtfsCounter, 503 mSDsluCounter, 774 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 503 SdHoareTripleChecker+Valid, 1322 SdHoareTripleChecker+Invalid, 439 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:38,234 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [503 Valid, 1322 Invalid, 439 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-08 15:43:38,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2025-03-08 15:43:38,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1731. [2025-03-08 15:43:38,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1731 states, 1397 states have (on average 1.4652827487473157) internal successors, (2047), 1400 states have internal predecessors, (2047), 327 states have call successors, (327), 6 states have call predecessors, (327), 6 states have return successors, (327), 324 states have call predecessors, (327), 327 states have call successors, (327) [2025-03-08 15:43:38,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2701 transitions. [2025-03-08 15:43:38,337 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2701 transitions. Word has length 483 [2025-03-08 15:43:38,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:38,338 INFO L471 AbstractCegarLoop]: Abstraction has 1731 states and 2701 transitions. [2025-03-08 15:43:38,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.2) internal successors, (131), 5 states have internal predecessors, (131), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:38,338 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2701 transitions. [2025-03-08 15:43:38,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-08 15:43:38,341 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:38,341 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:38,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-08 15:43:38,341 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:38,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:38,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1430421509, now seen corresponding path program 1 times [2025-03-08 15:43:38,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:38,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665400009] [2025-03-08 15:43:38,342 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:38,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:38,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 15:43:38,414 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 15:43:38,414 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:38,414 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:38,720 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-08 15:43:38,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:38,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665400009] [2025-03-08 15:43:38,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665400009] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:38,721 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:38,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-08 15:43:38,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859237600] [2025-03-08 15:43:38,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:38,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-08 15:43:38,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:38,723 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-08 15:43:38,723 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-08 15:43:38,724 INFO L87 Difference]: Start difference. First operand 1731 states and 2701 transitions. Second operand has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:39,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:39,747 INFO L93 Difference]: Finished difference Result 6819 states and 10633 transitions. [2025-03-08 15:43:39,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-08 15:43:39,747 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 484 [2025-03-08 15:43:39,748 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:39,769 INFO L225 Difference]: With dead ends: 6819 [2025-03-08 15:43:39,769 INFO L226 Difference]: Without dead ends: 5091 [2025-03-08 15:43:39,775 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-08 15:43:39,776 INFO L435 NwaCegarLoop]: 456 mSDtfsCounter, 1196 mSDsluCounter, 1724 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 571 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1196 SdHoareTripleChecker+Valid, 2180 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 571 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:39,776 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1196 Valid, 2180 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [571 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 15:43:39,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5091 states. [2025-03-08 15:43:39,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5091 to 4062. [2025-03-08 15:43:39,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4062 states, 3395 states have (on average 1.4857142857142858) internal successors, (5044), 3401 states have internal predecessors, (5044), 654 states have call successors, (654), 12 states have call predecessors, (654), 12 states have return successors, (654), 648 states have call predecessors, (654), 654 states have call successors, (654) [2025-03-08 15:43:39,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4062 states to 4062 states and 6352 transitions. [2025-03-08 15:43:39,973 INFO L78 Accepts]: Start accepts. Automaton has 4062 states and 6352 transitions. Word has length 484 [2025-03-08 15:43:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:39,973 INFO L471 AbstractCegarLoop]: Abstraction has 4062 states and 6352 transitions. [2025-03-08 15:43:39,973 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 22.0) internal successors, (132), 6 states have internal predecessors, (132), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:39,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4062 states and 6352 transitions. [2025-03-08 15:43:39,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-08 15:43:39,977 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:39,978 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:39,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-08 15:43:39,978 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:39,978 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:39,979 INFO L85 PathProgramCache]: Analyzing trace with hash -1935980134, now seen corresponding path program 1 times [2025-03-08 15:43:39,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:39,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180369596] [2025-03-08 15:43:39,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:39,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:40,010 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 15:43:42,546 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 15:43:42,547 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:42,547 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 24 proven. 186 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-08 15:43:43,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:43,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180369596] [2025-03-08 15:43:43,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180369596] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:43:43,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348667178] [2025-03-08 15:43:43,209 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:43,209 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:43:43,209 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:43:43,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:43:43,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 15:43:43,383 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 15:43:43,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 15:43:43,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:43,496 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:43,501 INFO L256 TraceCheckSpWp]: Trace formula consists of 1170 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-08 15:43:43,510 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:43:44,266 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 1618 proven. 192 refuted. 0 times theorem prover too weak. 8130 trivial. 0 not checked. [2025-03-08 15:43:44,267 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:43:44,759 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 18 proven. 192 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-08 15:43:44,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348667178] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:43:44,760 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:43:44,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 7] total 13 [2025-03-08 15:43:44,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962825461] [2025-03-08 15:43:44,760 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:43:44,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-03-08 15:43:44,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:44,762 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-03-08 15:43:44,762 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2025-03-08 15:43:44,763 INFO L87 Difference]: Start difference. First operand 4062 states and 6352 transitions. Second operand has 13 states, 13 states have (on average 22.846153846153847) internal successors, (297), 13 states have internal predecessors, (297), 4 states have call successors, (199), 2 states have call predecessors, (199), 4 states have return successors, (201), 4 states have call predecessors, (201), 4 states have call successors, (201) [2025-03-08 15:43:46,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:46,460 INFO L93 Difference]: Finished difference Result 15147 states and 23369 transitions. [2025-03-08 15:43:46,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2025-03-08 15:43:46,461 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 22.846153846153847) internal successors, (297), 13 states have internal predecessors, (297), 4 states have call successors, (199), 2 states have call predecessors, (199), 4 states have return successors, (201), 4 states have call predecessors, (201), 4 states have call successors, (201) Word has length 484 [2025-03-08 15:43:46,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:46,506 INFO L225 Difference]: With dead ends: 15147 [2025-03-08 15:43:46,508 INFO L226 Difference]: Without dead ends: 11088 [2025-03-08 15:43:46,520 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1016 GetRequests, 966 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 763 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=519, Invalid=2133, Unknown=0, NotChecked=0, Total=2652 [2025-03-08 15:43:46,520 INFO L435 NwaCegarLoop]: 333 mSDtfsCounter, 2274 mSDsluCounter, 1577 mSDsCounter, 0 mSdLazyCounter, 1312 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2275 SdHoareTripleChecker+Valid, 1910 SdHoareTripleChecker+Invalid, 1547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:46,521 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2275 Valid, 1910 Invalid, 1547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1312 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 15:43:46,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11088 states. [2025-03-08 15:43:46,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11088 to 9723. [2025-03-08 15:43:46,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9723 states, 8828 states have (on average 1.4926370638876303) internal successors, (13177), 8846 states have internal predecessors, (13177), 822 states have call successors, (822), 72 states have call predecessors, (822), 72 states have return successors, (822), 804 states have call predecessors, (822), 822 states have call successors, (822) [2025-03-08 15:43:46,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9723 states to 9723 states and 14821 transitions. [2025-03-08 15:43:46,860 INFO L78 Accepts]: Start accepts. Automaton has 9723 states and 14821 transitions. Word has length 484 [2025-03-08 15:43:46,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:46,861 INFO L471 AbstractCegarLoop]: Abstraction has 9723 states and 14821 transitions. [2025-03-08 15:43:46,862 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 22.846153846153847) internal successors, (297), 13 states have internal predecessors, (297), 4 states have call successors, (199), 2 states have call predecessors, (199), 4 states have return successors, (201), 4 states have call predecessors, (201), 4 states have call successors, (201) [2025-03-08 15:43:46,862 INFO L276 IsEmpty]: Start isEmpty. Operand 9723 states and 14821 transitions. [2025-03-08 15:43:46,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 485 [2025-03-08 15:43:46,870 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:46,871 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:46,880 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 15:43:47,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-08 15:43:47,075 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:47,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:47,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1424493018, now seen corresponding path program 1 times [2025-03-08 15:43:47,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:47,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887610039] [2025-03-08 15:43:47,076 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:47,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:47,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 15:43:48,673 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 15:43:48,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:48,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:49,087 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 48 proven. 162 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-08 15:43:49,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:49,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887610039] [2025-03-08 15:43:49,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887610039] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:43:49,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1029281936] [2025-03-08 15:43:49,087 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:49,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:43:49,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:43:49,090 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:43:49,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 15:43:49,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 484 statements into 1 equivalence classes. [2025-03-08 15:43:49,366 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 484 of 484 statements. [2025-03-08 15:43:49,366 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:49,366 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:49,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-08 15:43:49,379 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:43:49,786 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 4110 proven. 150 refuted. 0 times theorem prover too weak. 5680 trivial. 0 not checked. [2025-03-08 15:43:49,786 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:43:50,160 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 60 proven. 150 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-08 15:43:50,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1029281936] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:43:50,160 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:43:50,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2025-03-08 15:43:50,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [224390902] [2025-03-08 15:43:50,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:43:50,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-08 15:43:50,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:50,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-08 15:43:50,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-08 15:43:50,167 INFO L87 Difference]: Start difference. First operand 9723 states and 14821 transitions. Second operand has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 4 states have call successors, (175), 2 states have call predecessors, (175), 4 states have return successors, (177), 4 states have call predecessors, (177), 4 states have call successors, (177) [2025-03-08 15:43:50,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:50,832 INFO L93 Difference]: Finished difference Result 18825 states and 28694 transitions. [2025-03-08 15:43:50,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-08 15:43:50,833 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 4 states have call successors, (175), 2 states have call predecessors, (175), 4 states have return successors, (177), 4 states have call predecessors, (177), 4 states have call successors, (177) Word has length 484 [2025-03-08 15:43:50,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:50,863 INFO L225 Difference]: With dead ends: 18825 [2025-03-08 15:43:50,863 INFO L226 Difference]: Without dead ends: 9093 [2025-03-08 15:43:50,876 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 980 GetRequests, 965 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=94, Invalid=178, Unknown=0, NotChecked=0, Total=272 [2025-03-08 15:43:50,877 INFO L435 NwaCegarLoop]: 316 mSDtfsCounter, 469 mSDsluCounter, 491 mSDsCounter, 0 mSdLazyCounter, 486 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 470 SdHoareTripleChecker+Valid, 807 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 486 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:50,878 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [470 Valid, 807 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 486 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 15:43:50,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9093 states. [2025-03-08 15:43:51,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9093 to 9069. [2025-03-08 15:43:51,144 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9069 states, 8150 states have (on average 1.4802453987730062) internal successors, (12064), 8168 states have internal predecessors, (12064), 822 states have call successors, (822), 96 states have call predecessors, (822), 96 states have return successors, (822), 804 states have call predecessors, (822), 822 states have call successors, (822) [2025-03-08 15:43:51,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9069 states to 9069 states and 13708 transitions. [2025-03-08 15:43:51,166 INFO L78 Accepts]: Start accepts. Automaton has 9069 states and 13708 transitions. Word has length 484 [2025-03-08 15:43:51,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:51,169 INFO L471 AbstractCegarLoop]: Abstraction has 9069 states and 13708 transitions. [2025-03-08 15:43:51,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 27.333333333333332) internal successors, (246), 9 states have internal predecessors, (246), 4 states have call successors, (175), 2 states have call predecessors, (175), 4 states have return successors, (177), 4 states have call predecessors, (177), 4 states have call successors, (177) [2025-03-08 15:43:51,169 INFO L276 IsEmpty]: Start isEmpty. Operand 9069 states and 13708 transitions. [2025-03-08 15:43:51,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 487 [2025-03-08 15:43:51,177 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:51,177 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:51,186 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-08 15:43:51,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:43:51,378 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:51,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:51,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1481508167, now seen corresponding path program 1 times [2025-03-08 15:43:51,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:51,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290069010] [2025-03-08 15:43:51,379 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:51,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:51,409 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 486 statements into 1 equivalence classes. [2025-03-08 15:43:51,432 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 486 of 486 statements. [2025-03-08 15:43:51,432 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:51,432 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:51,526 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-08 15:43:51,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:51,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290069010] [2025-03-08 15:43:51,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290069010] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:51,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:51,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:51,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234348444] [2025-03-08 15:43:51,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:51,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:51,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:51,528 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:51,528 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:51,529 INFO L87 Difference]: Start difference. First operand 9069 states and 13708 transitions. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:51,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:51,853 INFO L93 Difference]: Finished difference Result 18167 states and 27438 transitions. [2025-03-08 15:43:51,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:51,854 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 486 [2025-03-08 15:43:51,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:51,879 INFO L225 Difference]: With dead ends: 18167 [2025-03-08 15:43:51,880 INFO L226 Difference]: Without dead ends: 9101 [2025-03-08 15:43:51,892 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-03-08 15:43:51,892 INFO L435 NwaCegarLoop]: 565 mSDtfsCounter, 267 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:51,893 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 960 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:51,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9101 states. [2025-03-08 15:43:52,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9101 to 7881. [2025-03-08 15:43:52,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7881 states, 7316 states have (on average 1.494805904866047) internal successors, (10936), 7322 states have internal predecessors, (10936), 510 states have call successors, (510), 54 states have call predecessors, (510), 54 states have return successors, (510), 504 states have call predecessors, (510), 510 states have call successors, (510) [2025-03-08 15:43:52,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7881 states to 7881 states and 11956 transitions. [2025-03-08 15:43:52,214 INFO L78 Accepts]: Start accepts. Automaton has 7881 states and 11956 transitions. Word has length 486 [2025-03-08 15:43:52,214 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:52,214 INFO L471 AbstractCegarLoop]: Abstraction has 7881 states and 11956 transitions. [2025-03-08 15:43:52,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:52,215 INFO L276 IsEmpty]: Start isEmpty. Operand 7881 states and 11956 transitions. [2025-03-08 15:43:52,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2025-03-08 15:43:52,222 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:52,222 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:52,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-08 15:43:52,223 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:52,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:52,223 INFO L85 PathProgramCache]: Analyzing trace with hash -880994532, now seen corresponding path program 1 times [2025-03-08 15:43:52,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:52,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356332643] [2025-03-08 15:43:52,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:52,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:52,253 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 487 statements into 1 equivalence classes. [2025-03-08 15:43:52,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 487 of 487 statements. [2025-03-08 15:43:52,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:52,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:52,524 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-08 15:43:52,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:52,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356332643] [2025-03-08 15:43:52,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356332643] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:52,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:52,524 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 15:43:52,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767845039] [2025-03-08 15:43:52,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:52,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 15:43:52,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:52,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 15:43:52,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:52,527 INFO L87 Difference]: Start difference. First operand 7881 states and 11956 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:52,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:52,999 INFO L93 Difference]: Finished difference Result 23637 states and 35862 transitions. [2025-03-08 15:43:53,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 15:43:53,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 487 [2025-03-08 15:43:53,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:53,033 INFO L225 Difference]: With dead ends: 23637 [2025-03-08 15:43:53,033 INFO L226 Difference]: Without dead ends: 15759 [2025-03-08 15:43:53,045 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 15:43:53,046 INFO L435 NwaCegarLoop]: 563 mSDtfsCounter, 278 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 960 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:53,046 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [278 Valid, 960 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-08 15:43:53,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15759 states. [2025-03-08 15:43:53,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15759 to 15757. [2025-03-08 15:43:53,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15757 states, 14628 states have (on average 1.4887886245556468) internal successors, (21778), 14640 states have internal predecessors, (21778), 1020 states have call successors, (1020), 108 states have call predecessors, (1020), 108 states have return successors, (1020), 1008 states have call predecessors, (1020), 1020 states have call successors, (1020) [2025-03-08 15:43:53,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15757 states to 15757 states and 23818 transitions. [2025-03-08 15:43:53,486 INFO L78 Accepts]: Start accepts. Automaton has 15757 states and 23818 transitions. Word has length 487 [2025-03-08 15:43:53,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:53,487 INFO L471 AbstractCegarLoop]: Abstraction has 15757 states and 23818 transitions. [2025-03-08 15:43:53,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 3 states have internal predecessors, (135), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:53,487 INFO L276 IsEmpty]: Start isEmpty. Operand 15757 states and 23818 transitions. [2025-03-08 15:43:53,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-08 15:43:53,501 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:53,501 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:53,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-08 15:43:53,501 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:53,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:53,502 INFO L85 PathProgramCache]: Analyzing trace with hash -1695446663, now seen corresponding path program 1 times [2025-03-08 15:43:53,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:53,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506433262] [2025-03-08 15:43:53,502 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:53,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:53,528 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-08 15:43:53,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-08 15:43:53,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:53,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:53,803 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-08 15:43:53,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:53,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506433262] [2025-03-08 15:43:53,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506433262] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:53,803 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:53,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-08 15:43:53,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790736682] [2025-03-08 15:43:53,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:53,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-08 15:43:53,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:53,805 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-08 15:43:53,805 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-08 15:43:53,805 INFO L87 Difference]: Start difference. First operand 15757 states and 23818 transitions. Second operand has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:54,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:54,541 INFO L93 Difference]: Finished difference Result 46199 states and 69811 transitions. [2025-03-08 15:43:54,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-08 15:43:54,542 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 488 [2025-03-08 15:43:54,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:54,614 INFO L225 Difference]: With dead ends: 46199 [2025-03-08 15:43:54,614 INFO L226 Difference]: Without dead ends: 30445 [2025-03-08 15:43:54,641 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-03-08 15:43:54,641 INFO L435 NwaCegarLoop]: 416 mSDtfsCounter, 729 mSDsluCounter, 1241 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 214 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 729 SdHoareTripleChecker+Valid, 1657 SdHoareTripleChecker+Invalid, 263 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 214 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:54,642 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [729 Valid, 1657 Invalid, 263 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [214 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-08 15:43:54,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30445 states. [2025-03-08 15:43:55,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30445 to 23651. [2025-03-08 15:43:55,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23651 states, 21958 states have (on average 1.4860187630931778) internal successors, (32630), 21976 states have internal predecessors, (32630), 1530 states have call successors, (1530), 162 states have call predecessors, (1530), 162 states have return successors, (1530), 1512 states have call predecessors, (1530), 1530 states have call successors, (1530) [2025-03-08 15:43:55,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23651 states to 23651 states and 35690 transitions. [2025-03-08 15:43:55,614 INFO L78 Accepts]: Start accepts. Automaton has 23651 states and 35690 transitions. Word has length 488 [2025-03-08 15:43:55,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:55,615 INFO L471 AbstractCegarLoop]: Abstraction has 23651 states and 35690 transitions. [2025-03-08 15:43:55,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.2) internal successors, (136), 5 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:55,615 INFO L276 IsEmpty]: Start isEmpty. Operand 23651 states and 35690 transitions. [2025-03-08 15:43:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-08 15:43:55,627 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:55,627 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:55,627 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-08 15:43:55,627 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:55,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:55,628 INFO L85 PathProgramCache]: Analyzing trace with hash -193540138, now seen corresponding path program 1 times [2025-03-08 15:43:55,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:55,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1235252272] [2025-03-08 15:43:55,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:55,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:55,654 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-08 15:43:55,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-08 15:43:55,835 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:55,835 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:43:56,267 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9940 trivial. 0 not checked. [2025-03-08 15:43:56,267 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:43:56,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1235252272] [2025-03-08 15:43:56,267 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1235252272] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 15:43:56,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 15:43:56,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-08 15:43:56,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142970176] [2025-03-08 15:43:56,268 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 15:43:56,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-08 15:43:56,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:43:56,268 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-08 15:43:56,269 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-08 15:43:56,269 INFO L87 Difference]: Start difference. First operand 23651 states and 35690 transitions. Second operand has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:57,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:43:57,513 INFO L93 Difference]: Finished difference Result 64815 states and 97550 transitions. [2025-03-08 15:43:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-08 15:43:57,513 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) Word has length 488 [2025-03-08 15:43:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:43:57,595 INFO L225 Difference]: With dead ends: 64815 [2025-03-08 15:43:57,596 INFO L226 Difference]: Without dead ends: 41167 [2025-03-08 15:43:57,626 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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-03-08 15:43:57,626 INFO L435 NwaCegarLoop]: 387 mSDtfsCounter, 607 mSDsluCounter, 676 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1063 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-08 15:43:57,627 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1063 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-08 15:43:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41167 states. [2025-03-08 15:43:58,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41167 to 23271. [2025-03-08 15:43:58,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23271 states, 21578 states have (on average 1.4829455927333395) internal successors, (31999), 21596 states have internal predecessors, (31999), 1530 states have call successors, (1530), 162 states have call predecessors, (1530), 162 states have return successors, (1530), 1512 states have call predecessors, (1530), 1530 states have call successors, (1530) [2025-03-08 15:43:58,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23271 states to 23271 states and 35059 transitions. [2025-03-08 15:43:58,895 INFO L78 Accepts]: Start accepts. Automaton has 23271 states and 35059 transitions. Word has length 488 [2025-03-08 15:43:58,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:43:58,896 INFO L471 AbstractCegarLoop]: Abstraction has 23271 states and 35059 transitions. [2025-03-08 15:43:58,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.0) internal successors, (136), 4 states have internal predecessors, (136), 1 states have call successors, (71), 1 states have call predecessors, (71), 1 states have return successors, (71), 1 states have call predecessors, (71), 1 states have call successors, (71) [2025-03-08 15:43:58,896 INFO L276 IsEmpty]: Start isEmpty. Operand 23271 states and 35059 transitions. [2025-03-08 15:43:58,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 489 [2025-03-08 15:43:58,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:43:58,909 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:43:58,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-08 15:43:58,909 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:43:58,911 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:43:58,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1822836726, now seen corresponding path program 1 times [2025-03-08 15:43:58,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:43:58,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149818403] [2025-03-08 15:43:58,911 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:43:58,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:43:58,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-08 15:43:59,853 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-08 15:43:59,853 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:43:59,853 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:00,373 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 48 proven. 162 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-08 15:44:00,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:00,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149818403] [2025-03-08 15:44:00,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149818403] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:44:00,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424194767] [2025-03-08 15:44:00,374 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:00,374 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:44:00,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:44:00,377 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:44:00,378 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 15:44:00,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 488 statements into 1 equivalence classes. [2025-03-08 15:44:00,708 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 488 of 488 statements. [2025-03-08 15:44:00,708 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:00,708 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:00,713 INFO L256 TraceCheckSpWp]: Trace formula consists of 1169 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-03-08 15:44:00,723 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:44:02,143 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 3614 proven. 318 refuted. 0 times theorem prover too weak. 6008 trivial. 0 not checked. [2025-03-08 15:44:02,143 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:44:02,757 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 96 proven. 321 refuted. 0 times theorem prover too weak. 9523 trivial. 0 not checked. [2025-03-08 15:44:02,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424194767] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:44:02,758 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:44:02,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 9] total 20 [2025-03-08 15:44:02,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436459712] [2025-03-08 15:44:02,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:44:02,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-08 15:44:02,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:02,761 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-08 15:44:02,761 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=127, Invalid=253, Unknown=0, NotChecked=0, Total=380 [2025-03-08 15:44:02,761 INFO L87 Difference]: Start difference. First operand 23271 states and 35059 transitions. Second operand has 20 states, 19 states have (on average 16.473684210526315) internal successors, (313), 18 states have internal predecessors, (313), 8 states have call successors, (213), 4 states have call predecessors, (213), 8 states have return successors, (213), 8 states have call predecessors, (213), 8 states have call successors, (213) [2025-03-08 15:44:07,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 15:44:07,200 INFO L93 Difference]: Finished difference Result 105831 states and 160702 transitions. [2025-03-08 15:44:07,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-03-08 15:44:07,201 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 16.473684210526315) internal successors, (313), 18 states have internal predecessors, (313), 8 states have call successors, (213), 4 states have call predecessors, (213), 8 states have return successors, (213), 8 states have call predecessors, (213), 8 states have call successors, (213) Word has length 488 [2025-03-08 15:44:07,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 15:44:07,364 INFO L225 Difference]: With dead ends: 105831 [2025-03-08 15:44:07,364 INFO L226 Difference]: Without dead ends: 82563 [2025-03-08 15:44:07,407 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1010 GetRequests, 971 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=469, Invalid=1171, Unknown=0, NotChecked=0, Total=1640 [2025-03-08 15:44:07,408 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 4158 mSDsluCounter, 5417 mSDsCounter, 0 mSdLazyCounter, 4020 mSolverCounterSat, 960 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4263 SdHoareTripleChecker+Valid, 6090 SdHoareTripleChecker+Invalid, 4980 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 960 IncrementalHoareTripleChecker+Valid, 4020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2025-03-08 15:44:07,408 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4263 Valid, 6090 Invalid, 4980 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [960 Valid, 4020 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2025-03-08 15:44:07,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82563 states. [2025-03-08 15:44:09,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82563 to 43027. [2025-03-08 15:44:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43027 states, 40320 states have (on average 1.4856150793650793) internal successors, (59900), 40368 states have internal predecessors, (59900), 2400 states have call successors, (2400), 306 states have call predecessors, (2400), 306 states have return successors, (2400), 2352 states have call predecessors, (2400), 2400 states have call successors, (2400) [2025-03-08 15:44:09,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43027 states to 43027 states and 64700 transitions. [2025-03-08 15:44:09,287 INFO L78 Accepts]: Start accepts. Automaton has 43027 states and 64700 transitions. Word has length 488 [2025-03-08 15:44:09,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 15:44:09,289 INFO L471 AbstractCegarLoop]: Abstraction has 43027 states and 64700 transitions. [2025-03-08 15:44:09,289 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 16.473684210526315) internal successors, (313), 18 states have internal predecessors, (313), 8 states have call successors, (213), 4 states have call predecessors, (213), 8 states have return successors, (213), 8 states have call predecessors, (213), 8 states have call successors, (213) [2025-03-08 15:44:09,289 INFO L276 IsEmpty]: Start isEmpty. Operand 43027 states and 64700 transitions. [2025-03-08 15:44:09,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 490 [2025-03-08 15:44:09,302 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 15:44:09,302 INFO L218 NwaCegarLoop]: trace histogram [71, 71, 71, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03-08 15:44:09,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-08 15:44:09,502 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-03-08 15:44:09,503 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 15:44:09,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 15:44:09,503 INFO L85 PathProgramCache]: Analyzing trace with hash -854281981, now seen corresponding path program 1 times [2025-03-08 15:44:09,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 15:44:09,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59116487] [2025-03-08 15:44:09,503 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:09,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 15:44:09,535 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-08 15:44:13,429 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-08 15:44:13,430 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:13,430 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 168 proven. 42 refuted. 0 times theorem prover too weak. 9730 trivial. 0 not checked. [2025-03-08 15:44:14,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 15:44:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59116487] [2025-03-08 15:44:14,825 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59116487] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 15:44:14,825 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1834683330] [2025-03-08 15:44:14,825 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 15:44:14,825 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 15:44:14,826 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 15:44:14,827 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 15:44:14,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 15:44:15,028 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 489 statements into 1 equivalence classes. [2025-03-08 15:44:15,202 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 489 of 489 statements. [2025-03-08 15:44:15,203 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 15:44:15,203 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 15:44:15,208 INFO L256 TraceCheckSpWp]: Trace formula consists of 1171 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-03-08 15:44:15,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 15:44:18,826 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 4520 proven. 753 refuted. 0 times theorem prover too weak. 4667 trivial. 0 not checked. [2025-03-08 15:44:18,826 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 15:44:20,148 INFO L134 CoverageAnalysis]: Checked inductivity of 9940 backedges. 231 proven. 591 refuted. 0 times theorem prover too weak. 9118 trivial. 0 not checked. [2025-03-08 15:44:20,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1834683330] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 15:44:20,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 15:44:20,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 22, 19] total 44 [2025-03-08 15:44:20,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823986766] [2025-03-08 15:44:20,149 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 15:44:20,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2025-03-08 15:44:20,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 15:44:20,151 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2025-03-08 15:44:20,152 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=301, Invalid=1591, Unknown=0, NotChecked=0, Total=1892 [2025-03-08 15:44:20,152 INFO L87 Difference]: Start difference. First operand 43027 states and 64700 transitions. Second operand has 44 states, 43 states have (on average 8.744186046511627) internal successors, (376), 42 states have internal predecessors, (376), 12 states have call successors, (206), 6 states have call predecessors, (206), 13 states have return successors, (207), 12 states have call predecessors, (207), 12 states have call successors, (207)