./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-17.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 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-250_file-17.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 d7e06ec6fa537fe85bfdff5997d89760f89bf3ab66b37451471516c2ec0f2efb --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 00:02:45,446 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 00:02:45,499 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-17 00:02:45,503 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 00:02:45,504 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 00:02:45,517 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 00:02:45,518 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 00:02:45,518 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 00:02:45,518 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 00:02:45,519 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 00:02:45,519 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 00:02:45,519 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 00:02:45,519 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 00:02:45,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 00:02:45,519 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 00:02:45,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 00:02:45,519 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-17 00:02:45,519 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 00:02:45,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 00:02:45,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 00:02:45,520 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 00:02:45,520 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-17 00:02:45,520 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 00:02:45,520 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-17 00:02:45,520 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 00:02:45,520 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-17 00:02:45,520 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 00:02:45,520 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 00:02:45,521 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 00:02:45,521 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 00:02:45,521 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 00:02:45,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 00:02:45,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:02:45,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 00:02:45,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 00:02:45,521 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-17 00:02:45,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-17 00:02:45,521 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 00:02:45,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 00:02:45,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 00:02:45,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 00:02:45,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 00:02:45,522 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 00:02:45,522 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 -> d7e06ec6fa537fe85bfdff5997d89760f89bf3ab66b37451471516c2ec0f2efb [2025-03-17 00:02:45,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 00:02:45,766 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 00:02:45,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 00:02:45,769 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 00:02:45,769 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 00:02:45,771 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-250_file-17.i [2025-03-17 00:02:46,935 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4ba48213/895d7e958fd74b358dfc5f4498ce4a8d/FLAG967d53d6f [2025-03-17 00:02:47,186 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 00:02:47,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-250_file-17.i [2025-03-17 00:02:47,195 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4ba48213/895d7e958fd74b358dfc5f4498ce4a8d/FLAG967d53d6f [2025-03-17 00:02:47,514 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4ba48213/895d7e958fd74b358dfc5f4498ce4a8d [2025-03-17 00:02:47,516 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 00:02:47,517 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 00:02:47,518 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 00:02:47,518 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 00:02:47,521 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 00:02:47,522 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,522 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d84b7c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47, skipping insertion in model container [2025-03-17 00:02:47,522 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,553 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 00:02:47,646 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-250_file-17.i[916,929] [2025-03-17 00:02:47,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:02:47,739 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 00:02:47,746 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-250_file-17.i[916,929] [2025-03-17 00:02:47,799 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 00:02:47,814 INFO L204 MainTranslator]: Completed translation [2025-03-17 00:02:47,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47 WrapperNode [2025-03-17 00:02:47,815 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 00:02:47,816 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 00:02:47,816 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 00:02:47,816 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 00:02:47,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,835 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,876 INFO L138 Inliner]: procedures = 26, calls = 100, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 658 [2025-03-17 00:02:47,877 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 00:02:47,877 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 00:02:47,878 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 00:02:47,878 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 00:02:47,886 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,886 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,892 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,918 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-17 00:02:47,919 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,919 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,936 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,941 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,947 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,954 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,961 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 00:02:47,963 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 00:02:47,964 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 00:02:47,964 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 00:02:47,965 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (1/1) ... [2025-03-17 00:02:47,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 00:02:47,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:47,992 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-17 00:02:47,997 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-17 00:02:48,013 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 00:02:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-03-17 00:02:48,014 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-03-17 00:02:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 00:02:48,014 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 00:02:48,014 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 00:02:48,116 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 00:02:48,117 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 00:02:48,796 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L472: havoc property_#t~ite69#1;havoc property_#t~ite68#1;havoc property_#t~bitwise67#1;havoc property_#t~short70#1; [2025-03-17 00:02:48,917 INFO L? ?]: Removed 33 outVars from TransFormulas that were not future-live. [2025-03-17 00:02:48,918 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 00:02:48,956 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 00:02:48,958 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 00:02:48,958 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:02:48 BoogieIcfgContainer [2025-03-17 00:02:48,959 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 00:02:48,960 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 00:02:48,960 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 00:02:48,963 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 00:02:48,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:02:47" (1/3) ... [2025-03-17 00:02:48,964 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151a356c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:02:48, skipping insertion in model container [2025-03-17 00:02:48,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:02:47" (2/3) ... [2025-03-17 00:02:48,965 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@151a356c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:02:48, skipping insertion in model container [2025-03-17 00:02:48,965 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:02:48" (3/3) ... [2025-03-17 00:02:48,966 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-17.i [2025-03-17 00:02:48,977 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 00:02:48,979 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodesize_ps-cn-250_file-17.i that has 2 procedures, 273 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-03-17 00:02:49,042 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 00:02:49,052 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;@25756773, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 00:02:49,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-17 00:02:49,057 INFO L276 IsEmpty]: Start isEmpty. Operand has 273 states, 183 states have (on average 1.546448087431694) internal successors, (283), 184 states have internal predecessors, (283), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 00:02:49,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-17 00:02:49,089 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:49,090 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:02:49,091 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:49,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:49,096 INFO L85 PathProgramCache]: Analyzing trace with hash 1764552766, now seen corresponding path program 1 times [2025-03-17 00:02:49,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:49,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075739438] [2025-03-17 00:02:49,103 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:49,103 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:49,209 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-17 00:02:49,251 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-17 00:02:49,252 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:49,252 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:49,606 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2025-03-17 00:02:49,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:49,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075739438] [2025-03-17 00:02:49,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075739438] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:49,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755555165] [2025-03-17 00:02:49,610 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:49,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:49,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:49,613 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-17 00:02:49,614 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-17 00:02:49,770 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-17 00:02:49,898 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-17 00:02:49,899 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:49,899 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:49,904 INFO L256 TraceCheckSpWp]: Trace formula consists of 1184 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-03-17 00:02:49,925 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:49,971 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 172 proven. 0 refuted. 0 times theorem prover too weak. 14792 trivial. 0 not checked. [2025-03-17 00:02:49,972 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-17 00:02:49,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755555165] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:49,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:02:49,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-03-17 00:02:49,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758013319] [2025-03-17 00:02:49,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:49,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-17 00:02:49,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:49,996 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-17 00:02:49,996 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-17 00:02:49,999 INFO L87 Difference]: Start difference. First operand has 273 states, 183 states have (on average 1.546448087431694) internal successors, (283), 184 states have internal predecessors, (283), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) Second operand has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-17 00:02:50,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:50,079 INFO L93 Difference]: Finished difference Result 541 states and 995 transitions. [2025-03-17 00:02:50,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-17 00:02:50,082 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) Word has length 537 [2025-03-17 00:02:50,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:50,092 INFO L225 Difference]: With dead ends: 541 [2025-03-17 00:02:50,094 INFO L226 Difference]: Without dead ends: 269 [2025-03-17 00:02:50,101 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 538 GetRequests, 538 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-17 00:02:50,104 INFO L435 NwaCegarLoop]: 432 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:50,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 432 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:02:50,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2025-03-17 00:02:50,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 269. [2025-03-17 00:02:50,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 269 states, 180 states have (on average 1.5222222222222221) internal successors, (274), 180 states have internal predecessors, (274), 87 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 87 states have call predecessors, (87), 87 states have call successors, (87) [2025-03-17 00:02:50,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 269 states to 269 states and 448 transitions. [2025-03-17 00:02:50,167 INFO L78 Accepts]: Start accepts. Automaton has 269 states and 448 transitions. Word has length 537 [2025-03-17 00:02:50,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:50,168 INFO L471 AbstractCegarLoop]: Abstraction has 269 states and 448 transitions. [2025-03-17 00:02:50,168 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 53.5) internal successors, (107), 2 states have internal predecessors, (107), 2 states have call successors, (87), 2 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-17 00:02:50,168 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 448 transitions. [2025-03-17 00:02:50,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 538 [2025-03-17 00:02:50,178 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:50,178 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:02:50,186 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 00:02:50,378 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-17 00:02:50,379 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:50,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:50,380 INFO L85 PathProgramCache]: Analyzing trace with hash -944324449, now seen corresponding path program 1 times [2025-03-17 00:02:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698265871] [2025-03-17 00:02:50,380 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:50,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:50,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 537 statements into 1 equivalence classes. [2025-03-17 00:02:50,531 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 537 of 537 statements. [2025-03-17 00:02:50,531 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:50,531 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:51,277 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:02:51,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:51,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698265871] [2025-03-17 00:02:51,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698265871] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:51,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:51,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:02:51,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1851574672] [2025-03-17 00:02:51,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:51,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:02:51,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:51,280 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:02:51,281 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:51,281 INFO L87 Difference]: Start difference. First operand 269 states and 448 transitions. Second operand has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:02:51,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:51,422 INFO L93 Difference]: Finished difference Result 809 states and 1349 transitions. [2025-03-17 00:02:51,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:02:51,423 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 537 [2025-03-17 00:02:51,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:51,429 INFO L225 Difference]: With dead ends: 809 [2025-03-17 00:02:51,429 INFO L226 Difference]: Without dead ends: 541 [2025-03-17 00:02:51,430 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-17 00:02:51,433 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 304 mSDsluCounter, 846 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 1272 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:51,433 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 1272 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:02:51,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 541 states. [2025-03-17 00:02:51,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 541 to 536. [2025-03-17 00:02:51,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 536 states, 359 states have (on average 1.5208913649025069) internal successors, (546), 359 states have internal predecessors, (546), 174 states have call successors, (174), 2 states have call predecessors, (174), 2 states have return successors, (174), 174 states have call predecessors, (174), 174 states have call successors, (174) [2025-03-17 00:02:51,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 536 states to 536 states and 894 transitions. [2025-03-17 00:02:51,546 INFO L78 Accepts]: Start accepts. Automaton has 536 states and 894 transitions. Word has length 537 [2025-03-17 00:02:51,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:51,548 INFO L471 AbstractCegarLoop]: Abstraction has 536 states and 894 transitions. [2025-03-17 00:02:51,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.25) internal successors, (105), 4 states have internal predecessors, (105), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:02:51,548 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 894 transitions. [2025-03-17 00:02:51,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 539 [2025-03-17 00:02:51,556 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:51,557 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:02:51,557 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 00:02:51,557 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:51,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:51,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1737497870, now seen corresponding path program 1 times [2025-03-17 00:02:51,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:51,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338013619] [2025-03-17 00:02:51,558 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:51,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:51,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 538 statements into 1 equivalence classes. [2025-03-17 00:02:51,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 538 of 538 statements. [2025-03-17 00:02:51,660 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:51,660 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:02:52,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:52,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338013619] [2025-03-17 00:02:52,396 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338013619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:52,396 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:52,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 00:02:52,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148235600] [2025-03-17 00:02:52,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:52,397 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 00:02:52,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:52,398 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 00:02:52,398 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:02:52,398 INFO L87 Difference]: Start difference. First operand 536 states and 894 transitions. Second operand has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:02:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:52,973 INFO L93 Difference]: Finished difference Result 1428 states and 2384 transitions. [2025-03-17 00:02:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 00:02:52,973 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 538 [2025-03-17 00:02:52,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:52,981 INFO L225 Difference]: With dead ends: 1428 [2025-03-17 00:02:52,983 INFO L226 Difference]: Without dead ends: 893 [2025-03-17 00:02:52,984 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:02:52,987 INFO L435 NwaCegarLoop]: 426 mSDtfsCounter, 412 mSDsluCounter, 1094 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 263 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 412 SdHoareTripleChecker+Valid, 1520 SdHoareTripleChecker+Invalid, 533 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 263 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:52,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [412 Valid, 1520 Invalid, 533 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [263 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-03-17 00:02:52,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 893 states. [2025-03-17 00:02:53,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 893 to 831. [2025-03-17 00:02:53,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 831 states, 566 states have (on average 1.540636042402827) internal successors, (872), 566 states have internal predecessors, (872), 261 states have call successors, (261), 3 states have call predecessors, (261), 3 states have return successors, (261), 261 states have call predecessors, (261), 261 states have call successors, (261) [2025-03-17 00:02:53,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 831 states to 831 states and 1394 transitions. [2025-03-17 00:02:53,119 INFO L78 Accepts]: Start accepts. Automaton has 831 states and 1394 transitions. Word has length 538 [2025-03-17 00:02:53,120 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:53,120 INFO L471 AbstractCegarLoop]: Abstraction has 831 states and 1394 transitions. [2025-03-17 00:02:53,120 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 21.2) internal successors, (106), 5 states have internal predecessors, (106), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:02:53,120 INFO L276 IsEmpty]: Start isEmpty. Operand 831 states and 1394 transitions. [2025-03-17 00:02:53,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-17 00:02:53,129 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:53,129 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:02:53,129 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 00:02:53,129 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:53,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:53,130 INFO L85 PathProgramCache]: Analyzing trace with hash 778578211, now seen corresponding path program 1 times [2025-03-17 00:02:53,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:53,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943160946] [2025-03-17 00:02:53,130 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:53,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:53,158 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-17 00:02:53,258 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-17 00:02:53,258 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:53,258 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:54,384 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:02:54,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:54,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943160946] [2025-03-17 00:02:54,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943160946] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:54,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:54,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-03-17 00:02:54,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702568120] [2025-03-17 00:02:54,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:54,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:02:54,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:54,386 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:02:54,386 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:02:54,388 INFO L87 Difference]: Start difference. First operand 831 states and 1394 transitions. Second operand has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-17 00:02:55,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:55,987 INFO L93 Difference]: Finished difference Result 2626 states and 4356 transitions. [2025-03-17 00:02:55,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-17 00:02:55,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) Word has length 539 [2025-03-17 00:02:55,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:55,998 INFO L225 Difference]: With dead ends: 2626 [2025-03-17 00:02:55,999 INFO L226 Difference]: Without dead ends: 2081 [2025-03-17 00:02:56,001 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2025-03-17 00:02:56,001 INFO L435 NwaCegarLoop]: 855 mSDtfsCounter, 1656 mSDsluCounter, 1863 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1656 SdHoareTripleChecker+Valid, 2718 SdHoareTripleChecker+Invalid, 1675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:56,002 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1656 Valid, 2718 Invalid, 1675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2025-03-17 00:02:56,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2025-03-17 00:02:56,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 1853. [2025-03-17 00:02:56,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1853 states, 1319 states have (on average 1.5481425322213798) internal successors, (2042), 1323 states have internal predecessors, (2042), 524 states have call successors, (524), 9 states have call predecessors, (524), 9 states have return successors, (524), 520 states have call predecessors, (524), 524 states have call successors, (524) [2025-03-17 00:02:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1853 states to 1853 states and 3090 transitions. [2025-03-17 00:02:56,176 INFO L78 Accepts]: Start accepts. Automaton has 1853 states and 3090 transitions. Word has length 539 [2025-03-17 00:02:56,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:56,177 INFO L471 AbstractCegarLoop]: Abstraction has 1853 states and 3090 transitions. [2025-03-17 00:02:56,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 15.285714285714286) internal successors, (107), 7 states have internal predecessors, (107), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-17 00:02:56,177 INFO L276 IsEmpty]: Start isEmpty. Operand 1853 states and 3090 transitions. [2025-03-17 00:02:56,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-17 00:02:56,182 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:56,182 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:02:56,182 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 00:02:56,182 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:56,183 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:56,183 INFO L85 PathProgramCache]: Analyzing trace with hash 711571458, now seen corresponding path program 1 times [2025-03-17 00:02:56,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:56,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666902247] [2025-03-17 00:02:56,184 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:56,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:56,210 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-17 00:02:56,245 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-17 00:02:56,246 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:56,246 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:56,644 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:02:56,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:56,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666902247] [2025-03-17 00:02:56,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666902247] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:02:56,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:02:56,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:02:56,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330321162] [2025-03-17 00:02:56,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:02:56,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:02:56,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:56,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:02:56,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:56,648 INFO L87 Difference]: Start difference. First operand 1853 states and 3090 transitions. Second operand has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:02:57,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:57,135 INFO L93 Difference]: Finished difference Result 5250 states and 8710 transitions. [2025-03-17 00:02:57,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:02:57,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 539 [2025-03-17 00:02:57,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:57,157 INFO L225 Difference]: With dead ends: 5250 [2025-03-17 00:02:57,157 INFO L226 Difference]: Without dead ends: 3817 [2025-03-17 00:02:57,163 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:02:57,164 INFO L435 NwaCegarLoop]: 647 mSDtfsCounter, 490 mSDsluCounter, 725 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 490 SdHoareTripleChecker+Valid, 1372 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:57,164 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [490 Valid, 1372 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:02:57,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3817 states. [2025-03-17 00:02:57,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3817 to 3808. [2025-03-17 00:02:57,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3808 states, 2713 states have (on average 1.5377810541835606) internal successors, (4172), 2724 states have internal predecessors, (4172), 1075 states have call successors, (1075), 19 states have call predecessors, (1075), 19 states have return successors, (1075), 1064 states have call predecessors, (1075), 1075 states have call successors, (1075) [2025-03-17 00:02:57,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3808 states to 3808 states and 6322 transitions. [2025-03-17 00:02:57,490 INFO L78 Accepts]: Start accepts. Automaton has 3808 states and 6322 transitions. Word has length 539 [2025-03-17 00:02:57,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:02:57,490 INFO L471 AbstractCegarLoop]: Abstraction has 3808 states and 6322 transitions. [2025-03-17 00:02:57,490 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.75) internal successors, (107), 4 states have internal predecessors, (107), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:02:57,491 INFO L276 IsEmpty]: Start isEmpty. Operand 3808 states and 6322 transitions. [2025-03-17 00:02:57,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 540 [2025-03-17 00:02:57,495 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:02:57,495 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:02:57,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 00:02:57,498 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:02:57,499 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:02:57,499 INFO L85 PathProgramCache]: Analyzing trace with hash -922162268, now seen corresponding path program 1 times [2025-03-17 00:02:57,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:02:57,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236789399] [2025-03-17 00:02:57,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:57,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:02:57,523 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-17 00:02:57,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-17 00:02:57,701 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:57,701 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:58,055 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 129 proven. 129 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-17 00:02:58,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:02:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236789399] [2025-03-17 00:02:58,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236789399] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:02:58,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829110184] [2025-03-17 00:02:58,056 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:02:58,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:02:58,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:02:58,058 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:02:58,060 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 00:02:58,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 539 statements into 1 equivalence classes. [2025-03-17 00:02:58,289 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 539 of 539 statements. [2025-03-17 00:02:58,290 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:02:58,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:02:58,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 1186 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-17 00:02:58,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:02:58,790 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 7568 proven. 129 refuted. 0 times theorem prover too weak. 7267 trivial. 0 not checked. [2025-03-17 00:02:58,790 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:02:59,280 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 129 proven. 129 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-17 00:02:59,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829110184] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:02:59,281 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:02:59,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2025-03-17 00:02:59,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523468476] [2025-03-17 00:02:59,281 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:02:59,282 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-17 00:02:59,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:02:59,282 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-17 00:02:59,282 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:02:59,283 INFO L87 Difference]: Start difference. First operand 3808 states and 6322 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) [2025-03-17 00:02:59,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:02:59,842 INFO L93 Difference]: Finished difference Result 5973 states and 9868 transitions. [2025-03-17 00:02:59,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-17 00:02:59,842 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) Word has length 539 [2025-03-17 00:02:59,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:02:59,858 INFO L225 Difference]: With dead ends: 5973 [2025-03-17 00:02:59,858 INFO L226 Difference]: Without dead ends: 2342 [2025-03-17 00:02:59,870 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1085 GetRequests, 1075 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2025-03-17 00:02:59,870 INFO L435 NwaCegarLoop]: 321 mSDtfsCounter, 240 mSDsluCounter, 469 mSDsCounter, 0 mSdLazyCounter, 491 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 282 SdHoareTripleChecker+Valid, 790 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:02:59,870 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [282 Valid, 790 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 491 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:02:59,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2342 states. [2025-03-17 00:03:00,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2342 to 2306. [2025-03-17 00:03:00,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2306 states, 1649 states have (on average 1.5106124924196482) internal successors, (2491), 1656 states have internal predecessors, (2491), 638 states have call successors, (638), 18 states have call predecessors, (638), 18 states have return successors, (638), 631 states have call predecessors, (638), 638 states have call successors, (638) [2025-03-17 00:03:00,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2306 states to 2306 states and 3767 transitions. [2025-03-17 00:03:00,095 INFO L78 Accepts]: Start accepts. Automaton has 2306 states and 3767 transitions. Word has length 539 [2025-03-17 00:03:00,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:03:00,095 INFO L471 AbstractCegarLoop]: Abstraction has 2306 states and 3767 transitions. [2025-03-17 00:03:00,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 2 states have call successors, (130), 2 states have call predecessors, (130), 4 states have return successors, (131), 2 states have call predecessors, (131), 2 states have call successors, (131) [2025-03-17 00:03:00,096 INFO L276 IsEmpty]: Start isEmpty. Operand 2306 states and 3767 transitions. [2025-03-17 00:03:00,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-17 00:03:00,099 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:00,099 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:03:00,108 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 00:03:00,300 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-03-17 00:03:00,300 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:00,301 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:00,301 INFO L85 PathProgramCache]: Analyzing trace with hash -1324590508, now seen corresponding path program 1 times [2025-03-17 00:03:00,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:03:00,301 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371153463] [2025-03-17 00:03:00,301 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:00,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:03:00,320 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-17 00:03:00,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-17 00:03:00,461 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:00,461 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:04,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:03:04,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:03:04,189 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371153463] [2025-03-17 00:03:04,189 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371153463] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:03:04,189 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:03:04,189 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2025-03-17 00:03:04,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338042704] [2025-03-17 00:03:04,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:03:04,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-17 00:03:04,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:03:04,190 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-17 00:03:04,191 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-17 00:03:04,191 INFO L87 Difference]: Start difference. First operand 2306 states and 3767 transitions. Second operand has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 4 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 4 states have call predecessors, (87), 4 states have call successors, (87) [2025-03-17 00:03:11,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:03:11,054 INFO L93 Difference]: Finished difference Result 10288 states and 16766 transitions. [2025-03-17 00:03:11,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 00:03:11,058 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 4 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 4 states have call predecessors, (87), 4 states have call successors, (87) Word has length 540 [2025-03-17 00:03:11,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:03:11,097 INFO L225 Difference]: With dead ends: 10288 [2025-03-17 00:03:11,097 INFO L226 Difference]: Without dead ends: 9520 [2025-03-17 00:03:11,103 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=281, Invalid=589, Unknown=0, NotChecked=0, Total=870 [2025-03-17 00:03:11,103 INFO L435 NwaCegarLoop]: 964 mSDtfsCounter, 3762 mSDsluCounter, 3332 mSDsCounter, 0 mSdLazyCounter, 3719 mSolverCounterSat, 1026 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3762 SdHoareTripleChecker+Valid, 4296 SdHoareTripleChecker+Invalid, 4745 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1026 IncrementalHoareTripleChecker+Valid, 3719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2025-03-17 00:03:11,104 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3762 Valid, 4296 Invalid, 4745 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1026 Valid, 3719 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2025-03-17 00:03:11,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9520 states. [2025-03-17 00:03:11,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9520 to 7199. [2025-03-17 00:03:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7199 states, 5424 states have (on average 1.532079646017699) internal successors, (8310), 5460 states have internal predecessors, (8310), 1715 states have call successors, (1715), 59 states have call predecessors, (1715), 59 states have return successors, (1715), 1679 states have call predecessors, (1715), 1715 states have call successors, (1715) [2025-03-17 00:03:11,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7199 states to 7199 states and 11740 transitions. [2025-03-17 00:03:11,773 INFO L78 Accepts]: Start accepts. Automaton has 7199 states and 11740 transitions. Word has length 540 [2025-03-17 00:03:11,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:03:11,774 INFO L471 AbstractCegarLoop]: Abstraction has 7199 states and 11740 transitions. [2025-03-17 00:03:11,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 9.0) internal successors, (108), 12 states have internal predecessors, (108), 4 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 4 states have call predecessors, (87), 4 states have call successors, (87) [2025-03-17 00:03:11,776 INFO L276 IsEmpty]: Start isEmpty. Operand 7199 states and 11740 transitions. [2025-03-17 00:03:11,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-17 00:03:11,784 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:11,784 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:03:11,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 00:03:11,785 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:11,785 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:11,785 INFO L85 PathProgramCache]: Analyzing trace with hash 145646286, now seen corresponding path program 1 times [2025-03-17 00:03:11,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:03:11,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009083312] [2025-03-17 00:03:11,786 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:11,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:03:11,807 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-17 00:03:11,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-17 00:03:11,837 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:11,837 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:12,152 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:03:12,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:03:12,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009083312] [2025-03-17 00:03:12,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009083312] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:03:12,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:03:12,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:03:12,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569685095] [2025-03-17 00:03:12,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:03:12,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:03:12,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:03:12,154 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:03:12,154 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:03:12,154 INFO L87 Difference]: Start difference. First operand 7199 states and 11740 transitions. Second operand has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:03:13,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:03:13,166 INFO L93 Difference]: Finished difference Result 16375 states and 26658 transitions. [2025-03-17 00:03:13,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 00:03:13,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 540 [2025-03-17 00:03:13,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:03:13,208 INFO L225 Difference]: With dead ends: 16375 [2025-03-17 00:03:13,208 INFO L226 Difference]: Without dead ends: 10287 [2025-03-17 00:03:13,219 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:03:13,220 INFO L435 NwaCegarLoop]: 499 mSDtfsCounter, 202 mSDsluCounter, 1289 mSDsCounter, 0 mSdLazyCounter, 247 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 1788 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 247 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:03:13,220 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 1788 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 247 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:03:13,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10287 states. [2025-03-17 00:03:13,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10287 to 8243. [2025-03-17 00:03:13,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8243 states, 6467 states have (on average 1.5614659038193908) internal successors, (10098), 6503 states have internal predecessors, (10098), 1715 states have call successors, (1715), 60 states have call predecessors, (1715), 60 states have return successors, (1715), 1679 states have call predecessors, (1715), 1715 states have call successors, (1715) [2025-03-17 00:03:13,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8243 states to 8243 states and 13528 transitions. [2025-03-17 00:03:13,890 INFO L78 Accepts]: Start accepts. Automaton has 8243 states and 13528 transitions. Word has length 540 [2025-03-17 00:03:13,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:03:13,891 INFO L471 AbstractCegarLoop]: Abstraction has 8243 states and 13528 transitions. [2025-03-17 00:03:13,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.0) internal successors, (108), 6 states have internal predecessors, (108), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:03:13,892 INFO L276 IsEmpty]: Start isEmpty. Operand 8243 states and 13528 transitions. [2025-03-17 00:03:13,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2025-03-17 00:03:13,897 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:13,897 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:03:13,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 00:03:13,897 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:13,898 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:13,898 INFO L85 PathProgramCache]: Analyzing trace with hash 1165081297, now seen corresponding path program 1 times [2025-03-17 00:03:13,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:03:13,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527655503] [2025-03-17 00:03:13,898 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:13,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:03:13,914 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 540 statements into 1 equivalence classes. [2025-03-17 00:03:13,929 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 540 of 540 statements. [2025-03-17 00:03:13,929 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:13,929 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:14,154 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:03:14,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:03:14,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527655503] [2025-03-17 00:03:14,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527655503] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:03:14,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:03:14,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:03:14,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407308050] [2025-03-17 00:03:14,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:03:14,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:03:14,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:03:14,156 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:03:14,156 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:03:14,156 INFO L87 Difference]: Start difference. First operand 8243 states and 13528 transitions. Second operand has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:03:14,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:03:14,992 INFO L93 Difference]: Finished difference Result 15211 states and 24875 transitions. [2025-03-17 00:03:14,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:03:14,993 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 540 [2025-03-17 00:03:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:03:15,026 INFO L225 Difference]: With dead ends: 15211 [2025-03-17 00:03:15,027 INFO L226 Difference]: Without dead ends: 8519 [2025-03-17 00:03:15,042 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:03:15,043 INFO L435 NwaCegarLoop]: 407 mSDtfsCounter, 432 mSDsluCounter, 227 mSDsCounter, 0 mSdLazyCounter, 224 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 432 SdHoareTripleChecker+Valid, 634 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 224 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:03:15,043 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [432 Valid, 634 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 224 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:03:15,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8519 states. [2025-03-17 00:03:15,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8519 to 8263. [2025-03-17 00:03:15,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8263 states, 6487 states have (on average 1.5578850007707723) internal successors, (10106), 6523 states have internal predecessors, (10106), 1715 states have call successors, (1715), 60 states have call predecessors, (1715), 60 states have return successors, (1715), 1679 states have call predecessors, (1715), 1715 states have call successors, (1715) [2025-03-17 00:03:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8263 states to 8263 states and 13536 transitions. [2025-03-17 00:03:15,795 INFO L78 Accepts]: Start accepts. Automaton has 8263 states and 13536 transitions. Word has length 540 [2025-03-17 00:03:15,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:03:15,796 INFO L471 AbstractCegarLoop]: Abstraction has 8263 states and 13536 transitions. [2025-03-17 00:03:15,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.0) internal successors, (108), 4 states have internal predecessors, (108), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:03:15,796 INFO L276 IsEmpty]: Start isEmpty. Operand 8263 states and 13536 transitions. [2025-03-17 00:03:15,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-17 00:03:15,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:15,802 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:03:15,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-03-17 00:03:15,802 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:15,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:15,802 INFO L85 PathProgramCache]: Analyzing trace with hash 903685959, now seen corresponding path program 1 times [2025-03-17 00:03:15,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:03:15,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836960550] [2025-03-17 00:03:15,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:15,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:03:15,820 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-17 00:03:15,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-17 00:03:15,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:15,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:15,940 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:03:15,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:03:15,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836960550] [2025-03-17 00:03:15,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836960550] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:03:15,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:03:15,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:03:15,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615545447] [2025-03-17 00:03:15,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:03:15,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:03:15,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:03:15,941 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:03:15,942 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:03:15,942 INFO L87 Difference]: Start difference. First operand 8263 states and 13536 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:03:16,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:03:16,899 INFO L93 Difference]: Finished difference Result 22213 states and 36350 transitions. [2025-03-17 00:03:16,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:03:16,900 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 541 [2025-03-17 00:03:16,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:03:16,946 INFO L225 Difference]: With dead ends: 22213 [2025-03-17 00:03:16,946 INFO L226 Difference]: Without dead ends: 15510 [2025-03-17 00:03:16,964 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-17 00:03:16,965 INFO L435 NwaCegarLoop]: 402 mSDtfsCounter, 224 mSDsluCounter, 394 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 796 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 00:03:16,965 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 796 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 00:03:16,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15510 states. [2025-03-17 00:03:18,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15510 to 15480. [2025-03-17 00:03:18,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15480 states, 12407 states have (on average 1.5654066252921737) internal successors, (19422), 12483 states have internal predecessors, (19422), 2971 states have call successors, (2971), 101 states have call predecessors, (2971), 101 states have return successors, (2971), 2895 states have call predecessors, (2971), 2971 states have call successors, (2971) [2025-03-17 00:03:18,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15480 states to 15480 states and 25364 transitions. [2025-03-17 00:03:18,321 INFO L78 Accepts]: Start accepts. Automaton has 15480 states and 25364 transitions. Word has length 541 [2025-03-17 00:03:18,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:03:18,322 INFO L471 AbstractCegarLoop]: Abstraction has 15480 states and 25364 transitions. [2025-03-17 00:03:18,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:03:18,322 INFO L276 IsEmpty]: Start isEmpty. Operand 15480 states and 25364 transitions. [2025-03-17 00:03:18,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 542 [2025-03-17 00:03:18,330 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:18,330 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:03:18,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-17 00:03:18,330 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:18,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:18,331 INFO L85 PathProgramCache]: Analyzing trace with hash 1689807774, now seen corresponding path program 1 times [2025-03-17 00:03:18,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:03:18,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897888523] [2025-03-17 00:03:18,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:18,331 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:03:18,347 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 541 statements into 1 equivalence classes. [2025-03-17 00:03:18,359 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 541 of 541 statements. [2025-03-17 00:03:18,360 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:18,360 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:18,450 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:03:18,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:03:18,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897888523] [2025-03-17 00:03:18,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897888523] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:03:18,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:03:18,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:03:18,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249599088] [2025-03-17 00:03:18,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:03:18,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:03:18,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:03:18,452 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:03:18,452 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:03:18,452 INFO L87 Difference]: Start difference. First operand 15480 states and 25364 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:03:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:03:20,132 INFO L93 Difference]: Finished difference Result 31822 states and 51706 transitions. [2025-03-17 00:03:20,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:03:20,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 541 [2025-03-17 00:03:20,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:03:20,188 INFO L225 Difference]: With dead ends: 31822 [2025-03-17 00:03:20,188 INFO L226 Difference]: Without dead ends: 19310 [2025-03-17 00:03:20,206 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-17 00:03:20,207 INFO L435 NwaCegarLoop]: 570 mSDtfsCounter, 194 mSDsluCounter, 398 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 968 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 00:03:20,207 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [194 Valid, 968 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:03:20,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19310 states. [2025-03-17 00:03:21,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19310 to 15400. [2025-03-17 00:03:21,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15400 states, 12327 states have (on average 1.5625861929098726) internal successors, (19262), 12403 states have internal predecessors, (19262), 2971 states have call successors, (2971), 101 states have call predecessors, (2971), 101 states have return successors, (2971), 2895 states have call predecessors, (2971), 2971 states have call successors, (2971) [2025-03-17 00:03:21,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15400 states to 15400 states and 25204 transitions. [2025-03-17 00:03:21,860 INFO L78 Accepts]: Start accepts. Automaton has 15400 states and 25204 transitions. Word has length 541 [2025-03-17 00:03:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:03:21,861 INFO L471 AbstractCegarLoop]: Abstraction has 15400 states and 25204 transitions. [2025-03-17 00:03:21,861 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:03:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 15400 states and 25204 transitions. [2025-03-17 00:03:21,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-17 00:03:21,868 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:21,868 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:03:21,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 00:03:21,869 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:21,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:21,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1599505909, now seen corresponding path program 1 times [2025-03-17 00:03:21,869 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:03:21,869 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [787214] [2025-03-17 00:03:21,870 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:21,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:03:21,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-17 00:03:22,018 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-17 00:03:22,022 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:22,022 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:22,601 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 96 proven. 162 refuted. 0 times theorem prover too weak. 14706 trivial. 0 not checked. [2025-03-17 00:03:22,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:03:22,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [787214] [2025-03-17 00:03:22,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [787214] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:03:22,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1223252553] [2025-03-17 00:03:22,602 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:22,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:03:22,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:03:22,604 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:03:22,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 00:03:22,714 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-17 00:03:22,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-17 00:03:22,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:22,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:22,833 INFO L256 TraceCheckSpWp]: Trace formula consists of 1191 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-17 00:03:22,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:03:24,751 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 7902 proven. 318 refuted. 0 times theorem prover too weak. 6744 trivial. 0 not checked. [2025-03-17 00:03:24,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:03:25,911 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 192 proven. 321 refuted. 0 times theorem prover too weak. 14451 trivial. 0 not checked. [2025-03-17 00:03:25,912 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1223252553] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 00:03:25,912 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 00:03:25,912 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 11] total 27 [2025-03-17 00:03:25,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1310830458] [2025-03-17 00:03:25,913 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 00:03:25,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-03-17 00:03:25,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:03:25,914 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-03-17 00:03:25,915 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=508, Unknown=0, NotChecked=0, Total=702 [2025-03-17 00:03:25,915 INFO L87 Difference]: Start difference. First operand 15400 states and 25204 transitions. Second operand has 27 states, 26 states have (on average 11.76923076923077) internal successors, (306), 25 states have internal predecessors, (306), 10 states have call successors, (261), 5 states have call predecessors, (261), 9 states have return successors, (261), 10 states have call predecessors, (261), 10 states have call successors, (261) [2025-03-17 00:03:27,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:03:27,894 INFO L93 Difference]: Finished difference Result 27102 states and 43731 transitions. [2025-03-17 00:03:27,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-03-17 00:03:27,895 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 11.76923076923077) internal successors, (306), 25 states have internal predecessors, (306), 10 states have call successors, (261), 5 states have call predecessors, (261), 9 states have return successors, (261), 10 states have call predecessors, (261), 10 states have call successors, (261) Word has length 542 [2025-03-17 00:03:27,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:03:27,944 INFO L225 Difference]: With dead ends: 27102 [2025-03-17 00:03:27,945 INFO L226 Difference]: Without dead ends: 14556 [2025-03-17 00:03:27,968 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1106 GetRequests, 1068 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 339 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=447, Invalid=1035, Unknown=0, NotChecked=0, Total=1482 [2025-03-17 00:03:27,969 INFO L435 NwaCegarLoop]: 295 mSDtfsCounter, 833 mSDsluCounter, 1448 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 382 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 1743 SdHoareTripleChecker+Invalid, 2075 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 382 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-03-17 00:03:27,969 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 1743 Invalid, 2075 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [382 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-03-17 00:03:27,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14556 states. [2025-03-17 00:03:28,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14556 to 7603. [2025-03-17 00:03:28,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7603 states, 6261 states have (on average 1.5740297077144225) internal successors, (9855), 6284 states have internal predecessors, (9855), 1241 states have call successors, (1241), 100 states have call predecessors, (1241), 100 states have return successors, (1241), 1218 states have call predecessors, (1241), 1241 states have call successors, (1241) [2025-03-17 00:03:28,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7603 states to 7603 states and 12337 transitions. [2025-03-17 00:03:28,918 INFO L78 Accepts]: Start accepts. Automaton has 7603 states and 12337 transitions. Word has length 542 [2025-03-17 00:03:28,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:03:28,919 INFO L471 AbstractCegarLoop]: Abstraction has 7603 states and 12337 transitions. [2025-03-17 00:03:28,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 11.76923076923077) internal successors, (306), 25 states have internal predecessors, (306), 10 states have call successors, (261), 5 states have call predecessors, (261), 9 states have return successors, (261), 10 states have call predecessors, (261), 10 states have call successors, (261) [2025-03-17 00:03:28,920 INFO L276 IsEmpty]: Start isEmpty. Operand 7603 states and 12337 transitions. [2025-03-17 00:03:28,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-17 00:03:28,924 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:28,924 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:03:28,933 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 00:03:29,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:03:29,125 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:29,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:29,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1058253449, now seen corresponding path program 1 times [2025-03-17 00:03:29,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:03:29,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458948705] [2025-03-17 00:03:29,126 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:29,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:03:29,145 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-17 00:03:29,159 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-17 00:03:29,159 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:29,159 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:29,316 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:03:29,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:03:29,316 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458948705] [2025-03-17 00:03:29,316 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458948705] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:03:29,316 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:03:29,316 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 00:03:29,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549176581] [2025-03-17 00:03:29,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:03:29,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 00:03:29,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:03:29,318 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 00:03:29,318 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 00:03:29,319 INFO L87 Difference]: Start difference. First operand 7603 states and 12337 transitions. Second operand has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:03:30,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:03:30,390 INFO L93 Difference]: Finished difference Result 19408 states and 31253 transitions. [2025-03-17 00:03:30,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:03:30,391 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 542 [2025-03-17 00:03:30,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:03:30,428 INFO L225 Difference]: With dead ends: 19408 [2025-03-17 00:03:30,429 INFO L226 Difference]: Without dead ends: 13021 [2025-03-17 00:03:30,442 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 00:03:30,442 INFO L435 NwaCegarLoop]: 511 mSDtfsCounter, 302 mSDsluCounter, 747 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 1258 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 00:03:30,442 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 1258 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-17 00:03:30,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13021 states. [2025-03-17 00:03:31,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13021 to 9827. [2025-03-17 00:03:31,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9827 states, 8012 states have (on average 1.556415376934598) internal successors, (12470), 8047 states have internal predecessors, (12470), 1675 states have call successors, (1675), 139 states have call predecessors, (1675), 139 states have return successors, (1675), 1640 states have call predecessors, (1675), 1675 states have call successors, (1675) [2025-03-17 00:03:31,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 15820 transitions. [2025-03-17 00:03:31,285 INFO L78 Accepts]: Start accepts. Automaton has 9827 states and 15820 transitions. Word has length 542 [2025-03-17 00:03:31,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:03:31,286 INFO L471 AbstractCegarLoop]: Abstraction has 9827 states and 15820 transitions. [2025-03-17 00:03:31,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.5) internal successors, (110), 4 states have internal predecessors, (110), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:03:31,286 INFO L276 IsEmpty]: Start isEmpty. Operand 9827 states and 15820 transitions. [2025-03-17 00:03:31,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-17 00:03:31,292 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:31,292 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:03:31,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-17 00:03:31,292 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:31,292 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:31,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1853080306, now seen corresponding path program 1 times [2025-03-17 00:03:31,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:03:31,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583339108] [2025-03-17 00:03:31,293 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:31,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:03:31,309 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-17 00:03:31,325 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-17 00:03:31,325 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:31,325 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:31,480 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:03:31,480 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:03:31,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583339108] [2025-03-17 00:03:31,481 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583339108] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:03:31,481 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:03:31,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 00:03:31,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134292556] [2025-03-17 00:03:31,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:03:31,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 00:03:31,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:03:31,482 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 00:03:31,482 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 00:03:31,482 INFO L87 Difference]: Start difference. First operand 9827 states and 15820 transitions. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:03:32,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:03:32,187 INFO L93 Difference]: Finished difference Result 16745 states and 26919 transitions. [2025-03-17 00:03:32,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 00:03:32,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) Word has length 542 [2025-03-17 00:03:32,188 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:03:32,217 INFO L225 Difference]: With dead ends: 16745 [2025-03-17 00:03:32,217 INFO L226 Difference]: Without dead ends: 9829 [2025-03-17 00:03:32,229 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-17 00:03:32,230 INFO L435 NwaCegarLoop]: 531 mSDtfsCounter, 269 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 269 SdHoareTripleChecker+Valid, 938 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-17 00:03:32,230 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [269 Valid, 938 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 00:03:32,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9829 states. [2025-03-17 00:03:33,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9829 to 9827. [2025-03-17 00:03:33,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9827 states, 8012 states have (on average 1.5556665002496255) internal successors, (12464), 8047 states have internal predecessors, (12464), 1675 states have call successors, (1675), 139 states have call predecessors, (1675), 139 states have return successors, (1675), 1640 states have call predecessors, (1675), 1675 states have call successors, (1675) [2025-03-17 00:03:33,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9827 states to 9827 states and 15814 transitions. [2025-03-17 00:03:33,190 INFO L78 Accepts]: Start accepts. Automaton has 9827 states and 15814 transitions. Word has length 542 [2025-03-17 00:03:33,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:03:33,190 INFO L471 AbstractCegarLoop]: Abstraction has 9827 states and 15814 transitions. [2025-03-17 00:03:33,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 1 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 1 states have call predecessors, (87), 1 states have call successors, (87) [2025-03-17 00:03:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 9827 states and 15814 transitions. [2025-03-17 00:03:33,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 543 [2025-03-17 00:03:33,199 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:33,199 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:03:33,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-17 00:03:33,199 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:33,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:33,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1464546608, now seen corresponding path program 1 times [2025-03-17 00:03:33,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:03:33,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [441636096] [2025-03-17 00:03:33,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:33,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:03:33,227 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 542 statements into 1 equivalence classes. [2025-03-17 00:03:33,312 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 542 of 542 statements. [2025-03-17 00:03:33,312 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:33,312 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:33,897 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14964 trivial. 0 not checked. [2025-03-17 00:03:33,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:03:33,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [441636096] [2025-03-17 00:03:33,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [441636096] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 00:03:33,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 00:03:33,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-17 00:03:33,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1205286690] [2025-03-17 00:03:33,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 00:03:33,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 00:03:33,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:03:33,899 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 00:03:33,899 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2025-03-17 00:03:33,899 INFO L87 Difference]: Start difference. First operand 9827 states and 15814 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-17 00:03:34,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 00:03:34,942 INFO L93 Difference]: Finished difference Result 16353 states and 26160 transitions. [2025-03-17 00:03:34,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 00:03:34,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) Word has length 542 [2025-03-17 00:03:34,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 00:03:34,970 INFO L225 Difference]: With dead ends: 16353 [2025-03-17 00:03:34,970 INFO L226 Difference]: Without dead ends: 8947 [2025-03-17 00:03:34,986 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-03-17 00:03:34,987 INFO L435 NwaCegarLoop]: 394 mSDtfsCounter, 510 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 510 SdHoareTripleChecker+Valid, 610 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 00:03:34,987 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [510 Valid, 610 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 238 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-17 00:03:34,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8947 states. [2025-03-17 00:03:35,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8947 to 8131. [2025-03-17 00:03:35,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8131 states, 6636 states have (on average 1.5494273658830622) internal successors, (10282), 6661 states have internal predecessors, (10282), 1355 states have call successors, (1355), 139 states have call predecessors, (1355), 139 states have return successors, (1355), 1330 states have call predecessors, (1355), 1355 states have call successors, (1355) [2025-03-17 00:03:35,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8131 states to 8131 states and 12992 transitions. [2025-03-17 00:03:35,765 INFO L78 Accepts]: Start accepts. Automaton has 8131 states and 12992 transitions. Word has length 542 [2025-03-17 00:03:35,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 00:03:35,765 INFO L471 AbstractCegarLoop]: Abstraction has 8131 states and 12992 transitions. [2025-03-17 00:03:35,765 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 6 states have internal predecessors, (110), 2 states have call successors, (87), 1 states have call predecessors, (87), 1 states have return successors, (87), 2 states have call predecessors, (87), 2 states have call successors, (87) [2025-03-17 00:03:35,766 INFO L276 IsEmpty]: Start isEmpty. Operand 8131 states and 12992 transitions. [2025-03-17 00:03:35,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2025-03-17 00:03:35,771 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 00:03:35,771 INFO L218 NwaCegarLoop]: trace histogram [87, 87, 87, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-17 00:03:35,771 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-17 00:03:35,771 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-17 00:03:35,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 00:03:35,772 INFO L85 PathProgramCache]: Analyzing trace with hash 2146685094, now seen corresponding path program 1 times [2025-03-17 00:03:35,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 00:03:35,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241437724] [2025-03-17 00:03:35,772 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:35,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 00:03:35,794 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-17 00:03:35,973 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-17 00:03:35,973 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:35,973 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-03-17 00:03:35,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1046318685] [2025-03-17 00:03:35,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 00:03:35,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 00:03:35,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 00:03:35,981 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 00:03:35,983 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 00:03:36,110 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 543 statements into 1 equivalence classes. [2025-03-17 00:03:36,261 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 543 of 543 statements. [2025-03-17 00:03:36,261 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 00:03:36,261 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 00:03:36,265 INFO L256 TraceCheckSpWp]: Trace formula consists of 1189 conjuncts, 38 conjuncts are in the unsatisfiable core [2025-03-17 00:03:36,272 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 00:03:37,668 INFO L134 CoverageAnalysis]: Checked inductivity of 14964 backedges. 4790 proven. 180 refuted. 0 times theorem prover too weak. 9994 trivial. 0 not checked. [2025-03-17 00:03:37,668 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 00:03:58,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 00:03:58,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1241437724] [2025-03-17 00:03:58,510 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-03-17 00:03:58,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1046318685] [2025-03-17 00:03:58,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1046318685] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 00:03:58,510 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-03-17 00:03:58,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21] total 21 [2025-03-17 00:03:58,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135549765] [2025-03-17 00:03:58,510 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-03-17 00:03:58,511 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2025-03-17 00:03:58,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 00:03:58,511 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2025-03-17 00:03:58,512 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=172, Invalid=581, Unknown=3, NotChecked=0, Total=756 [2025-03-17 00:03:58,512 INFO L87 Difference]: Start difference. First operand 8131 states and 12992 transitions. Second operand has 22 states, 22 states have (on average 5.863636363636363) internal successors, (129), 19 states have internal predecessors, (129), 6 states have call successors, (87), 6 states have call predecessors, (87), 7 states have return successors, (87), 6 states have call predecessors, (87), 6 states have call successors, (87)