./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-68.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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_fillercode_fillercodesize_ps-cn-500_file-68.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 6356f25af9bb924bb9550dc7ee13ccad0d46305c0140f2958a98a1290334276d --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 20:10:18,724 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 20:10:18,770 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 20:10:18,774 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 20:10:18,774 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 20:10:18,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 20:10:18,789 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 20:10:18,789 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 20:10:18,790 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 20:10:18,790 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 20:10:18,790 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 20:10:18,790 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 20:10:18,790 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 20:10:18,790 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 20:10:18,790 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 20:10:18,791 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 20:10:18,791 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 20:10:18,791 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 20:10:18,791 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 20:10:18,791 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 20:10:18,791 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 20:10:18,791 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 20:10:18,791 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 20:10:18,791 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 20:10:18,791 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 20:10:18,791 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 20:10:18,792 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 20:10:18,792 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 20:10:18,792 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 20:10:18,792 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 20:10:18,795 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 20:10:18,796 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 20:10:18,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:18,796 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 20:10:18,796 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 20:10:18,796 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 20:10:18,796 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 20:10:18,796 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 20:10:18,796 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 20:10:18,796 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 20:10:18,796 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 20:10:18,796 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 20:10:18,796 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 20:10:18,796 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 -> 6356f25af9bb924bb9550dc7ee13ccad0d46305c0140f2958a98a1290334276d [2025-03-03 20:10:19,057 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 20:10:19,066 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 20:10:19,068 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 20:10:19,069 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 20:10:19,069 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 20:10:19,070 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-68.i [2025-03-03 20:10:20,199 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ece87ac/0af4b2f54d8d47bdb0ebc970e6e7e2bc/FLAG6f1411ce0 [2025-03-03 20:10:20,481 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 20:10:20,482 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-500_file-68.i [2025-03-03 20:10:20,495 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ece87ac/0af4b2f54d8d47bdb0ebc970e6e7e2bc/FLAG6f1411ce0 [2025-03-03 20:10:20,777 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38ece87ac/0af4b2f54d8d47bdb0ebc970e6e7e2bc [2025-03-03 20:10:20,779 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 20:10:20,780 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 20:10:20,781 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:20,781 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 20:10:20,784 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 20:10:20,786 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:20" (1/1) ... [2025-03-03 20:10:20,788 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fce6171 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:20, skipping insertion in model container [2025-03-03 20:10:20,788 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 08:10:20" (1/1) ... [2025-03-03 20:10:20,819 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 20:10:20,912 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_fillercode_fillercodesize_ps-cn-500_file-68.i[916,929] [2025-03-03 20:10:21,033 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:21,044 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 20:10:21,052 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_fillercode_fillercodesize_ps-cn-500_file-68.i[916,929] [2025-03-03 20:10:21,120 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 20:10:21,138 INFO L204 MainTranslator]: Completed translation [2025-03-03 20:10:21,138 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21 WrapperNode [2025-03-03 20:10:21,139 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 20:10:21,140 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:21,140 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 20:10:21,140 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 20:10:21,144 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,229 INFO L138 Inliner]: procedures = 26, calls = 112, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 816 [2025-03-03 20:10:21,229 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 20:10:21,230 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 20:10:21,230 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 20:10:21,231 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 20:10:21,236 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,250 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,287 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-03 20:10:21,287 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,288 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,318 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,326 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,337 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,343 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,359 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 20:10:21,361 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 20:10:21,361 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 20:10:21,361 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 20:10:21,362 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (1/1) ... [2025-03-03 20:10:21,366 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 20:10:21,375 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:21,387 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-03 20:10:21,390 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-03 20:10:21,410 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 20:10:21,410 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-03 20:10:21,410 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-03 20:10:21,410 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 20:10:21,410 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 20:10:21,410 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 20:10:21,520 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 20:10:21,521 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 20:10:22,325 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L709: havoc property_#t~bitwise72#1; [2025-03-03 20:10:22,538 INFO L? ?]: Removed 35 outVars from TransFormulas that were not future-live. [2025-03-03 20:10:22,539 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 20:10:22,565 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 20:10:22,565 INFO L336 CfgBuilder]: Removed 1 assume(true) statements. [2025-03-03 20:10:22,565 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:22 BoogieIcfgContainer [2025-03-03 20:10:22,566 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 20:10:22,567 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 20:10:22,567 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 20:10:22,570 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 20:10:22,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 08:10:20" (1/3) ... [2025-03-03 20:10:22,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ab45e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:22, skipping insertion in model container [2025-03-03 20:10:22,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 08:10:21" (2/3) ... [2025-03-03 20:10:22,571 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@28ab45e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 08:10:22, skipping insertion in model container [2025-03-03 20:10:22,571 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 08:10:22" (3/3) ... [2025-03-03 20:10:22,572 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-68.i [2025-03-03 20:10:22,585 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 20:10:22,589 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-500_file-68.i that has 2 procedures, 333 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-03 20:10:22,644 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 20:10:22,655 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;@51b65654, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 20:10:22,657 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 20:10:22,662 INFO L276 IsEmpty]: Start isEmpty. Operand has 333 states, 231 states have (on average 1.5887445887445888) internal successors, (367), 232 states have internal predecessors, (367), 99 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 20:10:22,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-03 20:10:22,691 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:22,692 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:22,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:22,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:22,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1806104358, now seen corresponding path program 1 times [2025-03-03 20:10:22,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:22,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2115088534] [2025-03-03 20:10:22,704 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:22,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:22,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-03 20:10:22,862 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-03 20:10:22,863 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:22,864 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:23,253 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 196 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2025-03-03 20:10:23,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:23,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2115088534] [2025-03-03 20:10:23,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2115088534] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 20:10:23,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [228858074] [2025-03-03 20:10:23,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:23,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 20:10:23,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 20:10:23,258 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-03 20:10:23,260 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-03 20:10:23,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-03 20:10:23,586 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-03 20:10:23,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:23,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:23,593 INFO L256 TraceCheckSpWp]: Trace formula consists of 1504 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-03 20:10:23,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 20:10:23,669 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 196 proven. 0 refuted. 0 times theorem prover too weak. 19208 trivial. 0 not checked. [2025-03-03 20:10:23,669 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-03 20:10:23,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [228858074] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:23,669 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-03 20:10:23,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-03 20:10:23,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326907602] [2025-03-03 20:10:23,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:23,676 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-03 20:10:23,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:23,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-03 20:10:23,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-03 20:10:23,698 INFO L87 Difference]: Start difference. First operand has 333 states, 231 states have (on average 1.5887445887445888) internal successors, (367), 232 states have internal predecessors, (367), 99 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) Second operand has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 20:10:23,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:23,787 INFO L93 Difference]: Finished difference Result 658 states and 1222 transitions. [2025-03-03 20:10:23,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-03 20:10:23,793 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 2 states have call successors, (99) Word has length 642 [2025-03-03 20:10:23,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:23,804 INFO L225 Difference]: With dead ends: 658 [2025-03-03 20:10:23,805 INFO L226 Difference]: Without dead ends: 328 [2025-03-03 20:10:23,812 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 643 GetRequests, 643 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-03 20:10:23,815 INFO L435 NwaCegarLoop]: 540 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 540 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:23,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 540 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:23,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2025-03-03 20:10:23,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 328. [2025-03-03 20:10:23,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 227 states have (on average 1.5682819383259912) internal successors, (356), 227 states have internal predecessors, (356), 99 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 99 states have call predecessors, (99), 99 states have call successors, (99) [2025-03-03 20:10:23,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 554 transitions. [2025-03-03 20:10:23,900 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 554 transitions. Word has length 642 [2025-03-03 20:10:23,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:23,900 INFO L471 AbstractCegarLoop]: Abstraction has 328 states and 554 transitions. [2025-03-03 20:10:23,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 76.0) internal successors, (152), 2 states have internal predecessors, (152), 2 states have call successors, (99), 2 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 2 states have call successors, (99) [2025-03-03 20:10:23,902 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 554 transitions. [2025-03-03 20:10:23,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-03 20:10:23,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:23,911 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:23,922 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-03 20:10:24,113 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-03 20:10:24,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:24,114 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:24,114 INFO L85 PathProgramCache]: Analyzing trace with hash -900906091, now seen corresponding path program 1 times [2025-03-03 20:10:24,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:24,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799030249] [2025-03-03 20:10:24,114 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:24,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:24,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-03 20:10:24,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-03 20:10:24,245 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:24,245 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:24,772 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:10:24,773 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:24,773 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799030249] [2025-03-03 20:10:24,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799030249] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:24,773 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:24,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:24,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201887332] [2025-03-03 20:10:24,774 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:24,777 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:24,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:24,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:24,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:24,779 INFO L87 Difference]: Start difference. First operand 328 states and 554 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:24,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:24,879 INFO L93 Difference]: Finished difference Result 817 states and 1374 transitions. [2025-03-03 20:10:24,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:24,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 642 [2025-03-03 20:10:24,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:24,886 INFO L225 Difference]: With dead ends: 817 [2025-03-03 20:10:24,886 INFO L226 Difference]: Without dead ends: 492 [2025-03-03 20:10:24,888 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-03 20:10:24,888 INFO L435 NwaCegarLoop]: 537 mSDtfsCounter, 237 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1062 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-03 20:10:24,889 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 1062 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 20:10:24,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 492 states. [2025-03-03 20:10:24,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 492 to 489. [2025-03-03 20:10:24,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 347 states have (on average 1.5619596541786744) internal successors, (542), 348 states have internal predecessors, (542), 139 states have call successors, (139), 2 states have call predecessors, (139), 2 states have return successors, (139), 138 states have call predecessors, (139), 139 states have call successors, (139) [2025-03-03 20:10:24,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 820 transitions. [2025-03-03 20:10:24,947 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 820 transitions. Word has length 642 [2025-03-03 20:10:24,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:24,949 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 820 transitions. [2025-03-03 20:10:24,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:24,949 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 820 transitions. [2025-03-03 20:10:24,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-03 20:10:24,956 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:24,956 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:24,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-03 20:10:24,956 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:24,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:24,957 INFO L85 PathProgramCache]: Analyzing trace with hash 60707926, now seen corresponding path program 1 times [2025-03-03 20:10:24,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:24,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [871017306] [2025-03-03 20:10:24,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:24,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:24,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-03 20:10:25,046 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-03 20:10:25,049 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:25,049 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:25,264 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:10:25,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:25,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [871017306] [2025-03-03 20:10:25,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [871017306] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:25,265 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:25,265 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:25,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827566687] [2025-03-03 20:10:25,265 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:25,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:25,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:25,266 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:25,266 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:25,267 INFO L87 Difference]: Start difference. First operand 489 states and 820 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:25,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:25,378 INFO L93 Difference]: Finished difference Result 1434 states and 2406 transitions. [2025-03-03 20:10:25,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:25,379 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 642 [2025-03-03 20:10:25,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:25,391 INFO L225 Difference]: With dead ends: 1434 [2025-03-03 20:10:25,391 INFO L226 Difference]: Without dead ends: 948 [2025-03-03 20:10:25,394 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-03 20:10:25,396 INFO L435 NwaCegarLoop]: 863 mSDtfsCounter, 461 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 461 SdHoareTripleChecker+Valid, 1395 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:25,396 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [461 Valid, 1395 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:25,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2025-03-03 20:10:25,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 626. [2025-03-03 20:10:25,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 626 states, 484 states have (on average 1.621900826446281) internal successors, (785), 485 states have internal predecessors, (785), 139 states have call successors, (139), 2 states have call predecessors, (139), 2 states have return successors, (139), 138 states have call predecessors, (139), 139 states have call successors, (139) [2025-03-03 20:10:25,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 626 states to 626 states and 1063 transitions. [2025-03-03 20:10:25,449 INFO L78 Accepts]: Start accepts. Automaton has 626 states and 1063 transitions. Word has length 642 [2025-03-03 20:10:25,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:25,452 INFO L471 AbstractCegarLoop]: Abstraction has 626 states and 1063 transitions. [2025-03-03 20:10:25,452 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:25,453 INFO L276 IsEmpty]: Start isEmpty. Operand 626 states and 1063 transitions. [2025-03-03 20:10:25,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-03 20:10:25,463 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:25,463 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:25,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-03 20:10:25,464 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:25,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:25,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1977348363, now seen corresponding path program 1 times [2025-03-03 20:10:25,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:25,465 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035055130] [2025-03-03 20:10:25,465 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:25,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:25,495 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-03 20:10:25,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-03 20:10:25,563 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:25,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:25,838 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:10:25,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:25,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035055130] [2025-03-03 20:10:25,838 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035055130] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:25,838 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:25,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:10:25,839 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668350938] [2025-03-03 20:10:25,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:25,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:10:25,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:25,840 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:10:25,840 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:25,840 INFO L87 Difference]: Start difference. First operand 626 states and 1063 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:26,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:26,305 INFO L93 Difference]: Finished difference Result 1880 states and 3199 transitions. [2025-03-03 20:10:26,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 20:10:26,306 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 642 [2025-03-03 20:10:26,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:26,314 INFO L225 Difference]: With dead ends: 1880 [2025-03-03 20:10:26,314 INFO L226 Difference]: Without dead ends: 1257 [2025-03-03 20:10:26,316 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:10:26,317 INFO L435 NwaCegarLoop]: 986 mSDtfsCounter, 546 mSDsluCounter, 1303 mSDsCounter, 0 mSdLazyCounter, 314 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 2289 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:26,317 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 2289 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 314 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-03 20:10:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1257 states. [2025-03-03 20:10:26,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1257 to 1251. [2025-03-03 20:10:26,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 968 states have (on average 1.6177685950413223) internal successors, (1566), 970 states have internal predecessors, (1566), 278 states have call successors, (278), 4 states have call predecessors, (278), 4 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-03 20:10:26,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 2122 transitions. [2025-03-03 20:10:26,397 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 2122 transitions. Word has length 642 [2025-03-03 20:10:26,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:26,398 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 2122 transitions. [2025-03-03 20:10:26,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:26,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 2122 transitions. [2025-03-03 20:10:26,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 643 [2025-03-03 20:10:26,402 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:26,403 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:26,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-03 20:10:26,403 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:26,403 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:26,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1647582602, now seen corresponding path program 1 times [2025-03-03 20:10:26,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:26,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [617619395] [2025-03-03 20:10:26,404 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:26,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:26,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 642 statements into 1 equivalence classes. [2025-03-03 20:10:26,507 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 642 of 642 statements. [2025-03-03 20:10:26,508 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:26,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:26,820 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:10:26,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:26,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [617619395] [2025-03-03 20:10:26,821 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [617619395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:26,821 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:26,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-03 20:10:26,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830903641] [2025-03-03 20:10:26,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:26,822 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-03 20:10:26,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:26,823 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-03 20:10:26,823 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-03 20:10:26,823 INFO L87 Difference]: Start difference. First operand 1251 states and 2122 transitions. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:27,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:27,138 INFO L93 Difference]: Finished difference Result 2499 states and 4241 transitions. [2025-03-03 20:10:27,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-03 20:10:27,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 642 [2025-03-03 20:10:27,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:27,149 INFO L225 Difference]: With dead ends: 2499 [2025-03-03 20:10:27,149 INFO L226 Difference]: Without dead ends: 1251 [2025-03-03 20:10:27,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-03 20:10:27,153 INFO L435 NwaCegarLoop]: 529 mSDtfsCounter, 546 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 546 SdHoareTripleChecker+Valid, 856 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:27,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [546 Valid, 856 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:10:27,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1251 states. [2025-03-03 20:10:27,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1251 to 1251. [2025-03-03 20:10:27,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1251 states, 968 states have (on average 1.6136363636363635) internal successors, (1562), 970 states have internal predecessors, (1562), 278 states have call successors, (278), 4 states have call predecessors, (278), 4 states have return successors, (278), 276 states have call predecessors, (278), 278 states have call successors, (278) [2025-03-03 20:10:27,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 2118 transitions. [2025-03-03 20:10:27,227 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 2118 transitions. Word has length 642 [2025-03-03 20:10:27,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:27,228 INFO L471 AbstractCegarLoop]: Abstraction has 1251 states and 2118 transitions. [2025-03-03 20:10:27,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 states have internal predecessors, (150), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:27,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 2118 transitions. [2025-03-03 20:10:27,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-03 20:10:27,253 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:27,254 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:27,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-03 20:10:27,254 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:27,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:27,257 INFO L85 PathProgramCache]: Analyzing trace with hash -339416732, now seen corresponding path program 1 times [2025-03-03 20:10:27,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:27,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049179395] [2025-03-03 20:10:27,257 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:27,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:27,284 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-03 20:10:27,336 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-03 20:10:27,339 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:27,339 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:27,768 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:10:27,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:27,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049179395] [2025-03-03 20:10:27,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049179395] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:27,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:27,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:27,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654971983] [2025-03-03 20:10:27,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:27,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:27,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:27,770 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:27,770 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:27,770 INFO L87 Difference]: Start difference. First operand 1251 states and 2118 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:27,894 INFO L93 Difference]: Finished difference Result 3747 states and 6348 transitions. [2025-03-03 20:10:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:27,895 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-03-03 20:10:27,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:27,908 INFO L225 Difference]: With dead ends: 3747 [2025-03-03 20:10:27,909 INFO L226 Difference]: Without dead ends: 2499 [2025-03-03 20:10:27,913 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-03 20:10:27,913 INFO L435 NwaCegarLoop]: 772 mSDtfsCounter, 381 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 1300 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:27,914 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 1300 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:27,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2025-03-03 20:10:28,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2497. [2025-03-03 20:10:28,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2497 states, 1932 states have (on average 1.613871635610766) internal successors, (3118), 1936 states have internal predecessors, (3118), 556 states have call successors, (556), 8 states have call predecessors, (556), 8 states have return successors, (556), 552 states have call predecessors, (556), 556 states have call successors, (556) [2025-03-03 20:10:28,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2497 states to 2497 states and 4230 transitions. [2025-03-03 20:10:28,066 INFO L78 Accepts]: Start accepts. Automaton has 2497 states and 4230 transitions. Word has length 643 [2025-03-03 20:10:28,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:28,067 INFO L471 AbstractCegarLoop]: Abstraction has 2497 states and 4230 transitions. [2025-03-03 20:10:28,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2497 states and 4230 transitions. [2025-03-03 20:10:28,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 644 [2025-03-03 20:10:28,072 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:28,073 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:28,073 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-03 20:10:28,073 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:28,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:28,073 INFO L85 PathProgramCache]: Analyzing trace with hash 45950051, now seen corresponding path program 1 times [2025-03-03 20:10:28,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:28,073 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139469342] [2025-03-03 20:10:28,073 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:28,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:28,101 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 643 statements into 1 equivalence classes. [2025-03-03 20:10:28,132 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 643 of 643 statements. [2025-03-03 20:10:28,132 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:28,132 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:28,407 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:10:28,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:28,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139469342] [2025-03-03 20:10:28,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139469342] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:28,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:28,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:28,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077126450] [2025-03-03 20:10:28,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:28,408 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:28,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:28,409 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:28,409 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:28,409 INFO L87 Difference]: Start difference. First operand 2497 states and 4230 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:28,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:28,581 INFO L93 Difference]: Finished difference Result 7485 states and 12684 transitions. [2025-03-03 20:10:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:28,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 643 [2025-03-03 20:10:28,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:28,605 INFO L225 Difference]: With dead ends: 7485 [2025-03-03 20:10:28,606 INFO L226 Difference]: Without dead ends: 4991 [2025-03-03 20:10:28,613 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-03 20:10:28,614 INFO L435 NwaCegarLoop]: 673 mSDtfsCounter, 359 mSDsluCounter, 528 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 1201 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:28,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [359 Valid, 1201 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:28,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4991 states. [2025-03-03 20:10:28,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4991 to 4973. [2025-03-03 20:10:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4973 states, 3844 states have (on average 1.6087408949011446) internal successors, (6184), 3852 states have internal predecessors, (6184), 1112 states have call successors, (1112), 16 states have call predecessors, (1112), 16 states have return successors, (1112), 1104 states have call predecessors, (1112), 1112 states have call successors, (1112) [2025-03-03 20:10:29,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4973 states to 4973 states and 8408 transitions. [2025-03-03 20:10:29,019 INFO L78 Accepts]: Start accepts. Automaton has 4973 states and 8408 transitions. Word has length 643 [2025-03-03 20:10:29,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:29,020 INFO L471 AbstractCegarLoop]: Abstraction has 4973 states and 8408 transitions. [2025-03-03 20:10:29,020 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:29,020 INFO L276 IsEmpty]: Start isEmpty. Operand 4973 states and 8408 transitions. [2025-03-03 20:10:29,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-03 20:10:29,030 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:29,030 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:29,030 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-03 20:10:29,030 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:29,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:29,031 INFO L85 PathProgramCache]: Analyzing trace with hash -843904359, now seen corresponding path program 1 times [2025-03-03 20:10:29,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:29,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126052108] [2025-03-03 20:10:29,031 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:29,031 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:29,067 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-03-03 20:10:29,111 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-03-03 20:10:29,111 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:29,111 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:10:29,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:29,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126052108] [2025-03-03 20:10:29,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [126052108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:29,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:29,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:29,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729606785] [2025-03-03 20:10:29,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:29,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:29,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:29,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:29,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:29,557 INFO L87 Difference]: Start difference. First operand 4973 states and 8408 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:29,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:29,864 INFO L93 Difference]: Finished difference Result 14913 states and 25218 transitions. [2025-03-03 20:10:29,865 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:29,866 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 644 [2025-03-03 20:10:29,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:29,914 INFO L225 Difference]: With dead ends: 14913 [2025-03-03 20:10:29,914 INFO L226 Difference]: Without dead ends: 9943 [2025-03-03 20:10:29,931 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-03 20:10:29,932 INFO L435 NwaCegarLoop]: 539 mSDtfsCounter, 333 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 1071 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:29,932 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [333 Valid, 1071 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:29,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9943 states. [2025-03-03 20:10:30,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9943 to 9941. [2025-03-03 20:10:30,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9941 states, 7684 states have (on average 1.6048932847475272) internal successors, (12332), 7700 states have internal predecessors, (12332), 2224 states have call successors, (2224), 32 states have call predecessors, (2224), 32 states have return successors, (2224), 2208 states have call predecessors, (2224), 2224 states have call successors, (2224) [2025-03-03 20:10:30,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9941 states to 9941 states and 16780 transitions. [2025-03-03 20:10:30,554 INFO L78 Accepts]: Start accepts. Automaton has 9941 states and 16780 transitions. Word has length 644 [2025-03-03 20:10:30,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:30,555 INFO L471 AbstractCegarLoop]: Abstraction has 9941 states and 16780 transitions. [2025-03-03 20:10:30,555 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:30,555 INFO L276 IsEmpty]: Start isEmpty. Operand 9941 states and 16780 transitions. [2025-03-03 20:10:30,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-03 20:10:30,563 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:30,564 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:30,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-03 20:10:30,564 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:30,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:30,564 INFO L85 PathProgramCache]: Analyzing trace with hash -493104422, now seen corresponding path program 1 times [2025-03-03 20:10:30,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:30,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105995178] [2025-03-03 20:10:30,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:30,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:30,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-03-03 20:10:30,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-03-03 20:10:30,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:30,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:31,037 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:10:31,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:31,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105995178] [2025-03-03 20:10:31,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1105995178] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:31,038 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:31,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-03 20:10:31,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870014328] [2025-03-03 20:10:31,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:31,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-03 20:10:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:31,040 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-03 20:10:31,040 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-03 20:10:31,041 INFO L87 Difference]: Start difference. First operand 9941 states and 16780 transitions. Second operand has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:31,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:31,802 INFO L93 Difference]: Finished difference Result 29817 states and 50334 transitions. [2025-03-03 20:10:31,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-03 20:10:31,803 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 644 [2025-03-03 20:10:31,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:31,884 INFO L225 Difference]: With dead ends: 29817 [2025-03-03 20:10:31,885 INFO L226 Difference]: Without dead ends: 19879 [2025-03-03 20:10:31,915 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-03 20:10:31,916 INFO L435 NwaCegarLoop]: 538 mSDtfsCounter, 326 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 1070 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:31,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 1070 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 20:10:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19879 states. [2025-03-03 20:10:32,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19879 to 19861. [2025-03-03 20:10:32,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19861 states, 15348 states have (on average 1.6004691164972635) internal successors, (24564), 15380 states have internal predecessors, (24564), 4448 states have call successors, (4448), 64 states have call predecessors, (4448), 64 states have return successors, (4448), 4416 states have call predecessors, (4448), 4448 states have call successors, (4448) [2025-03-03 20:10:32,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19861 states to 19861 states and 33460 transitions. [2025-03-03 20:10:32,986 INFO L78 Accepts]: Start accepts. Automaton has 19861 states and 33460 transitions. Word has length 644 [2025-03-03 20:10:32,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:32,987 INFO L471 AbstractCegarLoop]: Abstraction has 19861 states and 33460 transitions. [2025-03-03 20:10:32,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:32,987 INFO L276 IsEmpty]: Start isEmpty. Operand 19861 states and 33460 transitions. [2025-03-03 20:10:32,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-03 20:10:32,999 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:33,000 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:33,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-03 20:10:33,000 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:33,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:33,001 INFO L85 PathProgramCache]: Analyzing trace with hash -560111175, now seen corresponding path program 1 times [2025-03-03 20:10:33,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:33,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890490831] [2025-03-03 20:10:33,001 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:33,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:33,024 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-03-03 20:10:33,223 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-03-03 20:10:33,223 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:33,223 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:33,651 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:10:33,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:33,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890490831] [2025-03-03 20:10:33,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890490831] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:33,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:33,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 20:10:33,651 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383803702] [2025-03-03 20:10:33,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:33,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 20:10:33,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:33,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 20:10:33,653 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-03 20:10:33,653 INFO L87 Difference]: Start difference. First operand 19861 states and 33460 transitions. Second operand has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:35,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:35,036 INFO L93 Difference]: Finished difference Result 39959 states and 66281 transitions. [2025-03-03 20:10:35,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 20:10:35,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 644 [2025-03-03 20:10:35,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:35,161 INFO L225 Difference]: With dead ends: 39959 [2025-03-03 20:10:35,161 INFO L226 Difference]: Without dead ends: 30029 [2025-03-03 20:10:35,217 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-03 20:10:35,217 INFO L435 NwaCegarLoop]: 820 mSDtfsCounter, 1047 mSDsluCounter, 2096 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1047 SdHoareTripleChecker+Valid, 2916 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:35,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1047 Valid, 2916 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-03 20:10:35,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30029 states. [2025-03-03 20:10:36,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30029 to 27973. [2025-03-03 20:10:36,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27973 states, 22500 states have (on average 1.5884444444444445) internal successors, (35740), 22596 states have internal predecessors, (35740), 5344 states have call successors, (5344), 128 states have call predecessors, (5344), 128 states have return successors, (5344), 5248 states have call predecessors, (5344), 5344 states have call successors, (5344) [2025-03-03 20:10:36,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27973 states to 27973 states and 46428 transitions. [2025-03-03 20:10:36,822 INFO L78 Accepts]: Start accepts. Automaton has 27973 states and 46428 transitions. Word has length 644 [2025-03-03 20:10:36,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:36,823 INFO L471 AbstractCegarLoop]: Abstraction has 27973 states and 46428 transitions. [2025-03-03 20:10:36,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.4) internal successors, (152), 5 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:36,824 INFO L276 IsEmpty]: Start isEmpty. Operand 27973 states and 46428 transitions. [2025-03-03 20:10:36,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2025-03-03 20:10:36,844 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:36,844 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:36,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-03 20:10:36,844 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:36,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:36,845 INFO L85 PathProgramCache]: Analyzing trace with hash -529091368, now seen corresponding path program 1 times [2025-03-03 20:10:36,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:36,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [855883973] [2025-03-03 20:10:36,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:36,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:36,869 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 644 statements into 1 equivalence classes. [2025-03-03 20:10:37,190 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 644 of 644 statements. [2025-03-03 20:10:37,191 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:37,191 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:10:38,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:38,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [855883973] [2025-03-03 20:10:38,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [855883973] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:38,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:38,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:10:38,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386335663] [2025-03-03 20:10:38,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:38,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:10:38,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:38,098 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:10:38,098 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:38,100 INFO L87 Difference]: Start difference. First operand 27973 states and 46428 transitions. Second operand has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:41,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:41,430 INFO L93 Difference]: Finished difference Result 97753 states and 161116 transitions. [2025-03-03 20:10:41,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:10:41,430 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 644 [2025-03-03 20:10:41,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:41,695 INFO L225 Difference]: With dead ends: 97753 [2025-03-03 20:10:41,696 INFO L226 Difference]: Without dead ends: 69783 [2025-03-03 20:10:41,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2025-03-03 20:10:41,788 INFO L435 NwaCegarLoop]: 1038 mSDtfsCounter, 1156 mSDsluCounter, 3422 mSDsCounter, 0 mSdLazyCounter, 1494 mSolverCounterSat, 304 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1156 SdHoareTripleChecker+Valid, 4460 SdHoareTripleChecker+Invalid, 1798 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 304 IncrementalHoareTripleChecker+Valid, 1494 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:41,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1156 Valid, 4460 Invalid, 1798 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [304 Valid, 1494 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2025-03-03 20:10:41,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69783 states. [2025-03-03 20:10:44,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69783 to 38225. [2025-03-03 20:10:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38225 states, 32650 states have (on average 1.588790199081164) internal successors, (51874), 32746 states have internal predecessors, (51874), 5443 states have call successors, (5443), 131 states have call predecessors, (5443), 131 states have return successors, (5443), 5347 states have call predecessors, (5443), 5443 states have call successors, (5443) [2025-03-03 20:10:44,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38225 states to 38225 states and 62760 transitions. [2025-03-03 20:10:44,770 INFO L78 Accepts]: Start accepts. Automaton has 38225 states and 62760 transitions. Word has length 644 [2025-03-03 20:10:44,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:44,771 INFO L471 AbstractCegarLoop]: Abstraction has 38225 states and 62760 transitions. [2025-03-03 20:10:44,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.714285714285715) internal successors, (152), 7 states have internal predecessors, (152), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:44,772 INFO L276 IsEmpty]: Start isEmpty. Operand 38225 states and 62760 transitions. [2025-03-03 20:10:44,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-03-03 20:10:44,792 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:44,792 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:44,792 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-03 20:10:44,793 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:44,794 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:44,794 INFO L85 PathProgramCache]: Analyzing trace with hash 327241055, now seen corresponding path program 1 times [2025-03-03 20:10:44,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:44,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473175217] [2025-03-03 20:10:44,794 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:44,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:44,817 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-03-03 20:10:45,007 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-03-03 20:10:45,007 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:45,007 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:10:45,550 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:10:45,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:10:45,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473175217] [2025-03-03 20:10:45,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473175217] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:10:45,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:10:45,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-03 20:10:45,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332034464] [2025-03-03 20:10:45,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:10:45,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-03 20:10:45,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:10:45,552 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-03 20:10:45,552 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-03-03 20:10:45,553 INFO L87 Difference]: Start difference. First operand 38225 states and 62760 transitions. Second operand has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:47,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 20:10:47,270 INFO L93 Difference]: Finished difference Result 74781 states and 121607 transitions. [2025-03-03 20:10:47,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 20:10:47,271 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) Word has length 645 [2025-03-03 20:10:47,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 20:10:47,404 INFO L225 Difference]: With dead ends: 74781 [2025-03-03 20:10:47,404 INFO L226 Difference]: Without dead ends: 46811 [2025-03-03 20:10:47,462 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2025-03-03 20:10:47,463 INFO L435 NwaCegarLoop]: 547 mSDtfsCounter, 685 mSDsluCounter, 2061 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 685 SdHoareTripleChecker+Valid, 2608 SdHoareTripleChecker+Invalid, 1137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-03 20:10:47,463 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [685 Valid, 2608 Invalid, 1137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 815 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-03 20:10:47,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46811 states. [2025-03-03 20:10:49,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46811 to 38357. [2025-03-03 20:10:49,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38357 states, 32781 states have (on average 1.5903419663829657) internal successors, (52133), 32877 states have internal predecessors, (52133), 5443 states have call successors, (5443), 132 states have call predecessors, (5443), 132 states have return successors, (5443), 5347 states have call predecessors, (5443), 5443 states have call successors, (5443) [2025-03-03 20:10:49,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38357 states to 38357 states and 63019 transitions. [2025-03-03 20:10:49,648 INFO L78 Accepts]: Start accepts. Automaton has 38357 states and 63019 transitions. Word has length 645 [2025-03-03 20:10:49,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 20:10:49,650 INFO L471 AbstractCegarLoop]: Abstraction has 38357 states and 63019 transitions. [2025-03-03 20:10:49,650 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 21.857142857142858) internal successors, (153), 7 states have internal predecessors, (153), 1 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 1 states have call predecessors, (99), 1 states have call successors, (99) [2025-03-03 20:10:49,650 INFO L276 IsEmpty]: Start isEmpty. Operand 38357 states and 63019 transitions. [2025-03-03 20:10:49,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 646 [2025-03-03 20:10:49,674 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 20:10:49,675 INFO L218 NwaCegarLoop]: trace histogram [99, 99, 99, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-03 20:10:49,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-03 20:10:49,675 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 20:10:49,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 20:10:49,676 INFO L85 PathProgramCache]: Analyzing trace with hash 1680550752, now seen corresponding path program 1 times [2025-03-03 20:10:49,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 20:10:49,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913078042] [2025-03-03 20:10:49,678 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 20:10:49,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 20:10:49,707 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 645 statements into 1 equivalence classes. [2025-03-03 20:10:50,084 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 645 of 645 statements. [2025-03-03 20:10:50,085 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 20:10:50,085 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 20:11:10,228 INFO L134 CoverageAnalysis]: Checked inductivity of 19404 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19404 trivial. 0 not checked. [2025-03-03 20:11:10,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 20:11:10,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913078042] [2025-03-03 20:11:10,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913078042] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 20:11:10,229 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 20:11:10,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [31] imperfect sequences [] total 31 [2025-03-03 20:11:10,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598402548] [2025-03-03 20:11:10,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 20:11:10,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 20:11:10,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 20:11:10,231 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 20:11:10,231 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=833, Unknown=0, NotChecked=0, Total=930 [2025-03-03 20:11:10,231 INFO L87 Difference]: Start difference. First operand 38357 states and 63019 transitions. Second operand has 31 states, 31 states have (on average 4.935483870967742) internal successors, (153), 31 states have internal predecessors, (153), 4 states have call successors, (99), 1 states have call predecessors, (99), 1 states have return successors, (99), 4 states have call predecessors, (99), 4 states have call successors, (99)