./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-70.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.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_variablewrapping_wrapper-s_file-70.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 fbc3d8d1a69e8bd3d6fe2e349933b2e0aa836a7f9d0aca281c4af875723b1f72 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:05:55,848 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:05:55,916 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:05:55,922 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:05:55,925 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:05:55,948 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:05:55,948 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:05:55,949 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:05:55,949 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:05:55,950 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:05:55,950 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:05:55,950 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:05:55,952 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:05:55,952 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:05:55,954 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:05:55,954 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:05:55,955 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:05:55,955 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:05:55,955 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:05:55,955 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:05:55,956 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:05:55,959 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:05:55,959 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:05:55,960 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:05:55,960 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:05:55,960 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:05:55,960 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:05:55,960 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:05:55,961 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:05:55,961 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:05:55,961 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:05:55,961 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:05:55,962 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:05:55,962 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:05:55,963 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:05:55,964 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:05:55,964 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:05:55,964 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:05:55,965 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:05:55,965 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:05:55,965 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:05:55,966 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:05:55,966 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 -> fbc3d8d1a69e8bd3d6fe2e349933b2e0aa836a7f9d0aca281c4af875723b1f72 [2024-11-09 02:05:56,236 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:05:56,264 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:05:56,267 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:05:56,268 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:05:56,268 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:05:56,270 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-70.i [2024-11-09 02:05:57,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:05:58,001 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:05:58,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-70.i [2024-11-09 02:05:58,009 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e8990f5/8e023b28dec349458f2aa9c1a752287e/FLAG120ad56dc [2024-11-09 02:05:58,359 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93e8990f5/8e023b28dec349458f2aa9c1a752287e [2024-11-09 02:05:58,361 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:05:58,363 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:05:58,364 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:05:58,364 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:05:58,371 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:05:58,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,374 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@434b1ebf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58, skipping insertion in model container [2024-11-09 02:05:58,376 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,407 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:05:58,619 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_variablewrapping_wrapper-s_file-70.i[916,929] [2024-11-09 02:05:58,681 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:05:58,693 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:05:58,704 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_variablewrapping_wrapper-s_file-70.i[916,929] [2024-11-09 02:05:58,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:05:58,771 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:05:58,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58 WrapperNode [2024-11-09 02:05:58,772 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:05:58,773 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:05:58,773 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:05:58,773 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:05:58,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,849 INFO L138 Inliner]: procedures = 30, calls = 156, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 516 [2024-11-09 02:05:58,849 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:05:58,850 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:05:58,850 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:05:58,850 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:05:58,861 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,876 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:05:58,877 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,877 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,905 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,910 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,913 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,916 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,926 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:05:58,927 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:05:58,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:05:58,929 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:05:58,930 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (1/1) ... [2024-11-09 02:05:58,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:05:58,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:05:58,972 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) [2024-11-09 02:05:58,978 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 [2024-11-09 02:05:59,027 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:05:59,028 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:05:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:05:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:05:59,029 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:05:59,030 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:05:59,030 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:05:59,031 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:05:59,031 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:05:59,031 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:05:59,031 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:05:59,032 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:05:59,160 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:05:59,162 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:05:59,741 INFO L? ?]: Removed 145 outVars from TransFormulas that were not future-live. [2024-11-09 02:05:59,741 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:05:59,758 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:05:59,760 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:05:59,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:05:59 BoogieIcfgContainer [2024-11-09 02:05:59,761 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:05:59,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:05:59,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:05:59,767 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:05:59,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:05:58" (1/3) ... [2024-11-09 02:05:59,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7a7972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:05:59, skipping insertion in model container [2024-11-09 02:05:59,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:05:58" (2/3) ... [2024-11-09 02:05:59,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f7a7972 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:05:59, skipping insertion in model container [2024-11-09 02:05:59,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:05:59" (3/3) ... [2024-11-09 02:05:59,771 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-70.i [2024-11-09 02:05:59,784 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:05:59,784 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:05:59,867 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:05:59,900 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;@2761ade0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:05:59,901 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:05:59,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:05:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-09 02:05:59,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:05:59,923 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:05:59,924 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:05:59,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:05:59,930 INFO L85 PathProgramCache]: Analyzing trace with hash 321983463, now seen corresponding path program 1 times [2024-11-09 02:05:59,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:05:59,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821483317] [2024-11-09 02:05:59,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:05:59,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:00,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:00,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:00,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:00,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:00,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:00,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:00,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,846 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:00,856 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:00,857 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:00,857 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821483317] [2024-11-09 02:06:00,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821483317] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:00,858 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:00,858 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:06:00,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323469402] [2024-11-09 02:06:00,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:00,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:06:00,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:00,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:06:00,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:06:00,897 INFO L87 Difference]: Start difference. First operand has 111 states, 96 states have (on average 1.4375) internal successors, (138), 97 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:00,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:00,971 INFO L93 Difference]: Finished difference Result 217 states and 333 transitions. [2024-11-09 02:06:00,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:06:00,975 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 116 [2024-11-09 02:06:00,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:00,988 INFO L225 Difference]: With dead ends: 217 [2024-11-09 02:06:00,989 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 02:06:00,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:06:00,999 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 0 mSDsluCounter, 295 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 448 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 [2024-11-09 02:06:01,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:06:01,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 02:06:01,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-09 02:06:01,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 95 states have (on average 1.4) internal successors, (133), 95 states have internal predecessors, (133), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:06:01,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 157 transitions. [2024-11-09 02:06:01,058 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 157 transitions. Word has length 116 [2024-11-09 02:06:01,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:01,061 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 157 transitions. [2024-11-09 02:06:01,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.75) internal successors, (59), 4 states have internal predecessors, (59), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:01,061 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 157 transitions. [2024-11-09 02:06:01,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 02:06:01,066 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:01,066 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:01,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:06:01,067 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:01,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:01,068 INFO L85 PathProgramCache]: Analyzing trace with hash -1438106206, now seen corresponding path program 1 times [2024-11-09 02:06:01,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:01,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1728144129] [2024-11-09 02:06:01,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:01,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:01,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:01,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:01,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:01,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:01,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:01,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,401 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:01,403 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:01,403 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1728144129] [2024-11-09 02:06:01,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1728144129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:01,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:01,404 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:06:01,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919904662] [2024-11-09 02:06:01,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:01,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:06:01,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:01,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:06:01,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:06:01,410 INFO L87 Difference]: Start difference. First operand 109 states and 157 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:01,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:01,464 INFO L93 Difference]: Finished difference Result 218 states and 315 transitions. [2024-11-09 02:06:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:06:01,465 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-09 02:06:01,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:01,468 INFO L225 Difference]: With dead ends: 218 [2024-11-09 02:06:01,470 INFO L226 Difference]: Without dead ends: 112 [2024-11-09 02:06:01,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:06:01,471 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 445 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:01,472 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 445 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:06:01,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-09 02:06:01,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 111. [2024-11-09 02:06:01,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 97 states have internal predecessors, (135), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:06:01,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 159 transitions. [2024-11-09 02:06:01,485 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 159 transitions. Word has length 118 [2024-11-09 02:06:01,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:01,486 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 159 transitions. [2024-11-09 02:06:01,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:01,486 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 159 transitions. [2024-11-09 02:06:01,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 02:06:01,490 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:01,490 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:01,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:06:01,491 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:01,491 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:01,491 INFO L85 PathProgramCache]: Analyzing trace with hash 336901156, now seen corresponding path program 1 times [2024-11-09 02:06:01,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:01,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241299638] [2024-11-09 02:06:01,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:01,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:01,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:01,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:01,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:01,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:01,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:01,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:01,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:01,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:01,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:01,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:01,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:01,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:01,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241299638] [2024-11-09 02:06:01,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241299638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:01,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:01,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:06:01,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868605815] [2024-11-09 02:06:01,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:01,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:06:01,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:01,752 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:06:01,752 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:06:01,753 INFO L87 Difference]: Start difference. First operand 111 states and 159 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:01,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:01,786 INFO L93 Difference]: Finished difference Result 222 states and 319 transitions. [2024-11-09 02:06:01,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:06:01,787 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-09 02:06:01,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:01,788 INFO L225 Difference]: With dead ends: 222 [2024-11-09 02:06:01,788 INFO L226 Difference]: Without dead ends: 114 [2024-11-09 02:06:01,789 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:06:01,790 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 1 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:01,791 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 448 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:06:01,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-09 02:06:01,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-09 02:06:01,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.3838383838383839) internal successors, (137), 99 states have internal predecessors, (137), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:06:01,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 161 transitions. [2024-11-09 02:06:01,803 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 161 transitions. Word has length 118 [2024-11-09 02:06:01,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:01,804 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 161 transitions. [2024-11-09 02:06:01,804 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 161 transitions. [2024-11-09 02:06:01,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 02:06:01,806 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:01,806 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:01,806 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 02:06:01,806 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:01,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:01,807 INFO L85 PathProgramCache]: Analyzing trace with hash 338748198, now seen corresponding path program 1 times [2024-11-09 02:06:01,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:01,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505606127] [2024-11-09 02:06:01,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:01,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:01,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:02,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:02,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:02,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:02,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:02,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:02,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:02,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:02,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:02,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:02,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:02,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,239 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:02,242 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:02,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505606127] [2024-11-09 02:06:02,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505606127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:02,243 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:02,243 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:06:02,243 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056444459] [2024-11-09 02:06:02,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:02,243 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:06:02,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:02,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:06:02,244 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:06:02,244 INFO L87 Difference]: Start difference. First operand 113 states and 161 transitions. Second operand has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:02,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:02,573 INFO L93 Difference]: Finished difference Result 282 states and 402 transitions. [2024-11-09 02:06:02,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:06:02,573 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-09 02:06:02,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:02,575 INFO L225 Difference]: With dead ends: 282 [2024-11-09 02:06:02,575 INFO L226 Difference]: Without dead ends: 172 [2024-11-09 02:06:02,576 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:06:02,577 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 71 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 415 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:02,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 415 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:06:02,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2024-11-09 02:06:02,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 116. [2024-11-09 02:06:02,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3725490196078431) internal successors, (140), 102 states have internal predecessors, (140), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:06:02,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 164 transitions. [2024-11-09 02:06:02,586 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 164 transitions. Word has length 118 [2024-11-09 02:06:02,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:02,587 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 164 transitions. [2024-11-09 02:06:02,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.2) internal successors, (61), 5 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:02,587 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 164 transitions. [2024-11-09 02:06:02,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-11-09 02:06:02,588 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:02,588 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:02,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 02:06:02,589 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:02,589 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:02,589 INFO L85 PathProgramCache]: Analyzing trace with hash 541336422, now seen corresponding path program 1 times [2024-11-09 02:06:02,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:02,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [706258341] [2024-11-09 02:06:02,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:02,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:02,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:02,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:02,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:02,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:02,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:02,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:02,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:02,836 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:02,836 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:02,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [706258341] [2024-11-09 02:06:02,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [706258341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:02,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:02,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:06:02,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797960726] [2024-11-09 02:06:02,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:02,839 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:06:02,839 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:02,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:06:02,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:06:02,841 INFO L87 Difference]: Start difference. First operand 116 states and 164 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:02,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:02,868 INFO L93 Difference]: Finished difference Result 229 states and 325 transitions. [2024-11-09 02:06:02,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:06:02,869 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 118 [2024-11-09 02:06:02,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:02,870 INFO L225 Difference]: With dead ends: 229 [2024-11-09 02:06:02,871 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 02:06:02,872 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:06:02,876 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 1 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:02,876 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 440 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:06:02,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 02:06:02,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 02:06:02,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3627450980392157) internal successors, (139), 102 states have internal predecessors, (139), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:06:02,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 163 transitions. [2024-11-09 02:06:02,891 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 163 transitions. Word has length 118 [2024-11-09 02:06:02,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:02,891 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 163 transitions. [2024-11-09 02:06:02,891 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:02,891 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 163 transitions. [2024-11-09 02:06:02,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 02:06:02,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:02,892 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:02,892 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 02:06:02,893 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:02,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:02,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1190083871, now seen corresponding path program 1 times [2024-11-09 02:06:02,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:02,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460802228] [2024-11-09 02:06:02,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:02,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:03,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:03,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:03,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:03,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:03,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:03,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:03,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:03,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:03,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:03,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:03,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:03,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:03,211 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:03,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:03,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460802228] [2024-11-09 02:06:03,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1460802228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:03,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:03,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 02:06:03,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864691791] [2024-11-09 02:06:03,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:03,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 02:06:03,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:03,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 02:06:03,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:06:03,220 INFO L87 Difference]: Start difference. First operand 116 states and 163 transitions. Second operand has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:03,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:03,232 INFO L93 Difference]: Finished difference Result 229 states and 323 transitions. [2024-11-09 02:06:03,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 02:06:03,233 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 120 [2024-11-09 02:06:03,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:03,234 INFO L225 Difference]: With dead ends: 229 [2024-11-09 02:06:03,234 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 02:06:03,235 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 02:06:03,235 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 0 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 301 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:03,236 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 301 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:06:03,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 02:06:03,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-11-09 02:06:03,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 102 states have (on average 1.3529411764705883) internal successors, (138), 102 states have internal predecessors, (138), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:06:03,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 162 transitions. [2024-11-09 02:06:03,253 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 162 transitions. Word has length 120 [2024-11-09 02:06:03,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:03,254 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 162 transitions. [2024-11-09 02:06:03,254 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 21.0) internal successors, (63), 3 states have internal predecessors, (63), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:03,254 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 162 transitions. [2024-11-09 02:06:03,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-09 02:06:03,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:03,256 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:03,256 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 02:06:03,257 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:03,257 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:03,257 INFO L85 PathProgramCache]: Analyzing trace with hash -498859871, now seen corresponding path program 1 times [2024-11-09 02:06:03,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:03,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87930237] [2024-11-09 02:06:03,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:03,258 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:03,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:04,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:04,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:04,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:04,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:04,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:04,835 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:04,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:04,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87930237] [2024-11-09 02:06:04,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87930237] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:04,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:04,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:06:04,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774854947] [2024-11-09 02:06:04,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:04,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:06:04,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:04,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:06:04,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:06:04,837 INFO L87 Difference]: Start difference. First operand 116 states and 162 transitions. Second operand has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:05,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:05,111 INFO L93 Difference]: Finished difference Result 281 states and 390 transitions. [2024-11-09 02:06:05,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:06:05,112 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 120 [2024-11-09 02:06:05,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:05,114 INFO L225 Difference]: With dead ends: 281 [2024-11-09 02:06:05,114 INFO L226 Difference]: Without dead ends: 168 [2024-11-09 02:06:05,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:06:05,115 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 110 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:05,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 418 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:06:05,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-09 02:06:05,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 131. [2024-11-09 02:06:05,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 117 states have (on average 1.3418803418803418) internal successors, (157), 117 states have internal predecessors, (157), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:06:05,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 181 transitions. [2024-11-09 02:06:05,130 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 181 transitions. Word has length 120 [2024-11-09 02:06:05,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:05,131 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 181 transitions. [2024-11-09 02:06:05,131 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.6) internal successors, (63), 6 states have internal predecessors, (63), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:05,131 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 181 transitions. [2024-11-09 02:06:05,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 02:06:05,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:05,136 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:05,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 02:06:05,137 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:05,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:05,137 INFO L85 PathProgramCache]: Analyzing trace with hash -1573808733, now seen corresponding path program 1 times [2024-11-09 02:06:05,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:05,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116513558] [2024-11-09 02:06:05,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:05,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:05,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:06,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:06,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,229 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:06,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:06,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:06,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:06,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:06,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:06,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:06,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,244 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:06,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:06,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116513558] [2024-11-09 02:06:06,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116513558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:06,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:06,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:06:06,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1505142744] [2024-11-09 02:06:06,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:06,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:06:06,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:06,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:06:06,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:06:06,247 INFO L87 Difference]: Start difference. First operand 131 states and 181 transitions. Second operand has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:06,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:06,578 INFO L93 Difference]: Finished difference Result 297 states and 410 transitions. [2024-11-09 02:06:06,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 02:06:06,579 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 121 [2024-11-09 02:06:06,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:06,580 INFO L225 Difference]: With dead ends: 297 [2024-11-09 02:06:06,581 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 02:06:06,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:06:06,582 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 51 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 249 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 249 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:06,582 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 506 Invalid, 254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 249 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:06:06,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 02:06:06,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 135. [2024-11-09 02:06:06,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 121 states have (on average 1.3305785123966942) internal successors, (161), 121 states have internal predecessors, (161), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:06:06,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 185 transitions. [2024-11-09 02:06:06,589 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 185 transitions. Word has length 121 [2024-11-09 02:06:06,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:06,589 INFO L471 AbstractCegarLoop]: Abstraction has 135 states and 185 transitions. [2024-11-09 02:06:06,589 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 12.8) internal successors, (64), 6 states have internal predecessors, (64), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:06,589 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 185 transitions. [2024-11-09 02:06:06,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-09 02:06:06,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:06,591 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:06,591 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 02:06:06,592 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:06,592 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:06,592 INFO L85 PathProgramCache]: Analyzing trace with hash 430177635, now seen corresponding path program 1 times [2024-11-09 02:06:06,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:06,592 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869080596] [2024-11-09 02:06:06,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:06,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:06,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:06,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:06,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:06,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:06,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:06,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:06,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:06,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:06,853 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:06,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:06,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869080596] [2024-11-09 02:06:06,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869080596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:06,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:06,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:06:06,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1849001162] [2024-11-09 02:06:06,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:06,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:06:06,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:06,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:06:06,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:06:06,855 INFO L87 Difference]: Start difference. First operand 135 states and 185 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:06,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:06,888 INFO L93 Difference]: Finished difference Result 270 states and 371 transitions. [2024-11-09 02:06:06,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:06:06,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 121 [2024-11-09 02:06:06,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:06,891 INFO L225 Difference]: With dead ends: 270 [2024-11-09 02:06:06,891 INFO L226 Difference]: Without dead ends: 138 [2024-11-09 02:06:06,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:06:06,892 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 433 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 583 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:06,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 583 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:06:06,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-09 02:06:06,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 138. [2024-11-09 02:06:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 124 states have (on average 1.3225806451612903) internal successors, (164), 124 states have internal predecessors, (164), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-11-09 02:06:06,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 188 transitions. [2024-11-09 02:06:06,899 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 188 transitions. Word has length 121 [2024-11-09 02:06:06,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:06,900 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 188 transitions. [2024-11-09 02:06:06,900 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 5 states have internal predecessors, (64), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:06,901 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 188 transitions. [2024-11-09 02:06:06,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 02:06:06,902 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:06,902 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:06,902 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 02:06:06,902 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:06,902 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:06,903 INFO L85 PathProgramCache]: Analyzing trace with hash -587009944, now seen corresponding path program 1 times [2024-11-09 02:06:06,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:06,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1069521811] [2024-11-09 02:06:06,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:06,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:07,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:07,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:07,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:07,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:07,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:07,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:07,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:07,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:07,954 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:07,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:07,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1069521811] [2024-11-09 02:06:07,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1069521811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:07,955 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:07,955 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:06:07,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1154244830] [2024-11-09 02:06:07,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:07,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:06:07,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:07,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:06:07,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:06:07,957 INFO L87 Difference]: Start difference. First operand 138 states and 188 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:08,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:08,352 INFO L93 Difference]: Finished difference Result 345 states and 467 transitions. [2024-11-09 02:06:08,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:06:08,353 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-09 02:06:08,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:08,354 INFO L225 Difference]: With dead ends: 345 [2024-11-09 02:06:08,354 INFO L226 Difference]: Without dead ends: 210 [2024-11-09 02:06:08,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:06:08,355 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 68 mSDsluCounter, 462 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 620 SdHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:08,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 620 Invalid, 313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:06:08,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-09 02:06:08,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 207. [2024-11-09 02:06:08,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 207 states, 190 states have (on average 1.3210526315789475) internal successors, (251), 191 states have internal predecessors, (251), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:06:08,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 207 states to 207 states and 279 transitions. [2024-11-09 02:06:08,365 INFO L78 Accepts]: Start accepts. Automaton has 207 states and 279 transitions. Word has length 122 [2024-11-09 02:06:08,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:08,367 INFO L471 AbstractCegarLoop]: Abstraction has 207 states and 279 transitions. [2024-11-09 02:06:08,368 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:08,368 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 279 transitions. [2024-11-09 02:06:08,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 02:06:08,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:08,370 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:08,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 02:06:08,370 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:08,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:08,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1608078298, now seen corresponding path program 1 times [2024-11-09 02:06:08,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:08,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1213313465] [2024-11-09 02:06:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:08,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:08,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:09,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:09,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:09,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:09,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:09,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:09,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:09,711 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:09,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:09,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1213313465] [2024-11-09 02:06:09,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1213313465] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:09,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:09,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 02:06:09,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022611799] [2024-11-09 02:06:09,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:09,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 02:06:09,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:09,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 02:06:09,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 02:06:09,713 INFO L87 Difference]: Start difference. First operand 207 states and 279 transitions. Second operand has 8 states, 6 states have (on average 10.833333333333334) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 02:06:10,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:10,372 INFO L93 Difference]: Finished difference Result 423 states and 567 transitions. [2024-11-09 02:06:10,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:06:10,373 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 6 states have (on average 10.833333333333334) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2024-11-09 02:06:10,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:10,376 INFO L225 Difference]: With dead ends: 423 [2024-11-09 02:06:10,376 INFO L226 Difference]: Without dead ends: 219 [2024-11-09 02:06:10,377 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:06:10,378 INFO L432 NwaCegarLoop]: 167 mSDtfsCounter, 74 mSDsluCounter, 704 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 521 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:10,378 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 871 Invalid, 521 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 02:06:10,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2024-11-09 02:06:10,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 206. [2024-11-09 02:06:10,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 206 states, 189 states have (on average 1.3174603174603174) internal successors, (249), 190 states have internal predecessors, (249), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:06:10,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 206 states to 206 states and 277 transitions. [2024-11-09 02:06:10,387 INFO L78 Accepts]: Start accepts. Automaton has 206 states and 277 transitions. Word has length 122 [2024-11-09 02:06:10,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:10,388 INFO L471 AbstractCegarLoop]: Abstraction has 206 states and 277 transitions. [2024-11-09 02:06:10,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 6 states have (on average 10.833333333333334) internal successors, (65), 8 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 02:06:10,388 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 277 transitions. [2024-11-09 02:06:10,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 02:06:10,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:10,389 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:10,390 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 02:06:10,390 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:10,390 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:10,390 INFO L85 PathProgramCache]: Analyzing trace with hash 315149736, now seen corresponding path program 1 times [2024-11-09 02:06:10,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:10,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315538678] [2024-11-09 02:06:10,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:10,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:10,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:12,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:12,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:12,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:12,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:12,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,854 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:12,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:12,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:12,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:12,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:12,862 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:12,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:12,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315538678] [2024-11-09 02:06:12,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315538678] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:12,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:12,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 02:06:12,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359276190] [2024-11-09 02:06:12,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:12,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 02:06:12,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:12,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 02:06:12,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:06:12,864 INFO L87 Difference]: Start difference. First operand 206 states and 277 transitions. Second operand has 14 states, 12 states have (on average 5.416666666666667) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 02:06:14,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:14,653 INFO L93 Difference]: Finished difference Result 485 states and 645 transitions. [2024-11-09 02:06:14,653 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-09 02:06:14,654 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 5.416666666666667) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 122 [2024-11-09 02:06:14,654 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:14,656 INFO L225 Difference]: With dead ends: 485 [2024-11-09 02:06:14,656 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 02:06:14,657 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=62, Invalid=358, Unknown=0, NotChecked=0, Total=420 [2024-11-09 02:06:14,657 INFO L432 NwaCegarLoop]: 184 mSDtfsCounter, 133 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 1663 SdHoareTripleChecker+Invalid, 1072 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:14,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 1663 Invalid, 1072 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-09 02:06:14,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 02:06:14,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 219. [2024-11-09 02:06:14,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 202 states have (on average 1.316831683168317) internal successors, (266), 203 states have internal predecessors, (266), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:06:14,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 294 transitions. [2024-11-09 02:06:14,669 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 294 transitions. Word has length 122 [2024-11-09 02:06:14,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:14,669 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 294 transitions. [2024-11-09 02:06:14,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 5.416666666666667) internal successors, (65), 14 states have internal predecessors, (65), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 02:06:14,669 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 294 transitions. [2024-11-09 02:06:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 02:06:14,671 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:14,671 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:14,671 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 02:06:14,671 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:14,672 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1288609818, now seen corresponding path program 1 times [2024-11-09 02:06:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:14,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735328523] [2024-11-09 02:06:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:14,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:16,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:16,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:16,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:16,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:16,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:16,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:16,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:16,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:16,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:16,735 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:16,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:16,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735328523] [2024-11-09 02:06:16,736 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735328523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:16,736 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:16,736 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 02:06:16,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956251898] [2024-11-09 02:06:16,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:16,737 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 02:06:16,737 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:16,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 02:06:16,738 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2024-11-09 02:06:16,738 INFO L87 Difference]: Start difference. First operand 219 states and 294 transitions. Second operand has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:18,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:18,745 INFO L93 Difference]: Finished difference Result 628 states and 852 transitions. [2024-11-09 02:06:18,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 02:06:18,746 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-09 02:06:18,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:18,748 INFO L225 Difference]: With dead ends: 628 [2024-11-09 02:06:18,748 INFO L226 Difference]: Without dead ends: 412 [2024-11-09 02:06:18,750 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=430, Unknown=0, NotChecked=0, Total=506 [2024-11-09 02:06:18,752 INFO L432 NwaCegarLoop]: 211 mSDtfsCounter, 254 mSDsluCounter, 1586 mSDsCounter, 0 mSdLazyCounter, 1409 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 1797 SdHoareTripleChecker+Invalid, 1433 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 1409 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:18,752 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 1797 Invalid, 1433 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 1409 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-09 02:06:18,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2024-11-09 02:06:18,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 232. [2024-11-09 02:06:18,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 232 states, 215 states have (on average 1.3209302325581396) internal successors, (284), 216 states have internal predecessors, (284), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:06:18,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 232 states to 232 states and 312 transitions. [2024-11-09 02:06:18,771 INFO L78 Accepts]: Start accepts. Automaton has 232 states and 312 transitions. Word has length 122 [2024-11-09 02:06:18,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:18,771 INFO L471 AbstractCegarLoop]: Abstraction has 232 states and 312 transitions. [2024-11-09 02:06:18,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 5.416666666666667) internal successors, (65), 13 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:18,771 INFO L276 IsEmpty]: Start isEmpty. Operand 232 states and 312 transitions. [2024-11-09 02:06:18,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-09 02:06:18,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:18,773 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:18,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 02:06:18,773 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:18,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:18,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1985289124, now seen corresponding path program 1 times [2024-11-09 02:06:18,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:18,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145019554] [2024-11-09 02:06:18,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:18,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:18,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:19,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:19,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:19,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:19,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:19,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:19,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:19,726 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:19,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:19,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145019554] [2024-11-09 02:06:19,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145019554] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:19,726 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:19,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:06:19,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533335272] [2024-11-09 02:06:19,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:19,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:06:19,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:19,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:06:19,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:06:19,728 INFO L87 Difference]: Start difference. First operand 232 states and 312 transitions. Second operand has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:20,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:20,153 INFO L93 Difference]: Finished difference Result 503 states and 673 transitions. [2024-11-09 02:06:20,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:06:20,154 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 122 [2024-11-09 02:06:20,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:20,157 INFO L225 Difference]: With dead ends: 503 [2024-11-09 02:06:20,157 INFO L226 Difference]: Without dead ends: 274 [2024-11-09 02:06:20,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:06:20,160 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 66 mSDsluCounter, 541 mSDsCounter, 0 mSdLazyCounter, 342 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 342 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:20,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 736 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 342 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:06:20,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states. [2024-11-09 02:06:20,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 221. [2024-11-09 02:06:20,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 204 states have (on average 1.3088235294117647) internal successors, (267), 205 states have internal predecessors, (267), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:06:20,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 295 transitions. [2024-11-09 02:06:20,175 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 295 transitions. Word has length 122 [2024-11-09 02:06:20,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:20,175 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 295 transitions. [2024-11-09 02:06:20,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.0) internal successors, (65), 6 states have internal predecessors, (65), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:20,176 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 295 transitions. [2024-11-09 02:06:20,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:06:20,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:20,177 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:20,177 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 02:06:20,177 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:20,178 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:20,178 INFO L85 PathProgramCache]: Analyzing trace with hash -520966790, now seen corresponding path program 1 times [2024-11-09 02:06:20,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:20,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827371297] [2024-11-09 02:06:20,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:20,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,393 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:20,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:20,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:20,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,403 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:20,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:20,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:20,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,414 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:20,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:20,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827371297] [2024-11-09 02:06:20,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [827371297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:20,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:20,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:06:20,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126618038] [2024-11-09 02:06:20,415 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:20,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:06:20,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:20,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:06:20,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:06:20,416 INFO L87 Difference]: Start difference. First operand 221 states and 295 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:20,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:20,617 INFO L93 Difference]: Finished difference Result 476 states and 634 transitions. [2024-11-09 02:06:20,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:06:20,618 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2024-11-09 02:06:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:20,621 INFO L225 Difference]: With dead ends: 476 [2024-11-09 02:06:20,621 INFO L226 Difference]: Without dead ends: 258 [2024-11-09 02:06:20,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:06:20,624 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 43 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:20,625 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 488 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 02:06:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-09 02:06:20,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 224. [2024-11-09 02:06:20,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 207 states have (on average 1.3043478260869565) internal successors, (270), 208 states have internal predecessors, (270), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:06:20,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 298 transitions. [2024-11-09 02:06:20,640 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 298 transitions. Word has length 123 [2024-11-09 02:06:20,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:20,640 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 298 transitions. [2024-11-09 02:06:20,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:20,641 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 298 transitions. [2024-11-09 02:06:20,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-09 02:06:20,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:20,642 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:20,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 02:06:20,642 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:20,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:20,643 INFO L85 PathProgramCache]: Analyzing trace with hash 2094466316, now seen corresponding path program 1 times [2024-11-09 02:06:20,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:20,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20586343] [2024-11-09 02:06:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:20,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:20,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:20,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:20,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:20,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:20,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:20,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:21,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:21,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:21,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:21,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:21,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:21,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:21,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:21,009 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:21,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:21,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20586343] [2024-11-09 02:06:21,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20586343] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:21,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:21,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 02:06:21,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090981025] [2024-11-09 02:06:21,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:21,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 02:06:21,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:21,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 02:06:21,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:06:21,013 INFO L87 Difference]: Start difference. First operand 224 states and 298 transitions. Second operand has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:21,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:21,432 INFO L93 Difference]: Finished difference Result 589 states and 786 transitions. [2024-11-09 02:06:21,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 02:06:21,432 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 123 [2024-11-09 02:06:21,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:21,435 INFO L225 Difference]: With dead ends: 589 [2024-11-09 02:06:21,435 INFO L226 Difference]: Without dead ends: 368 [2024-11-09 02:06:21,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-09 02:06:21,437 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 124 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 347 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:21,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 392 Invalid, 347 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 02:06:21,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2024-11-09 02:06:21,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 226. [2024-11-09 02:06:21,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 209 states have (on average 1.291866028708134) internal successors, (270), 210 states have internal predecessors, (270), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:06:21,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 298 transitions. [2024-11-09 02:06:21,450 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 298 transitions. Word has length 123 [2024-11-09 02:06:21,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:21,451 INFO L471 AbstractCegarLoop]: Abstraction has 226 states and 298 transitions. [2024-11-09 02:06:21,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.2) internal successors, (66), 5 states have internal predecessors, (66), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:21,451 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 298 transitions. [2024-11-09 02:06:21,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 02:06:21,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:21,452 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:21,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 02:06:21,453 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:21,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:21,453 INFO L85 PathProgramCache]: Analyzing trace with hash 882604046, now seen corresponding path program 1 times [2024-11-09 02:06:21,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:21,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1729060752] [2024-11-09 02:06:21,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:21,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:21,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:24,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:24,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:24,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:24,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:24,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:24,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:24,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:24,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:24,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:24,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:24,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:24,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:24,466 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:24,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:24,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1729060752] [2024-11-09 02:06:24,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1729060752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:24,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:24,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-11-09 02:06:24,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128925742] [2024-11-09 02:06:24,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:24,467 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 02:06:24,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:24,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 02:06:24,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2024-11-09 02:06:24,470 INFO L87 Difference]: Start difference. First operand 226 states and 298 transitions. Second operand has 14 states, 11 states have (on average 6.090909090909091) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 02:06:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:26,441 INFO L93 Difference]: Finished difference Result 505 states and 663 transitions. [2024-11-09 02:06:26,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 02:06:26,442 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 6.090909090909091) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) Word has length 124 [2024-11-09 02:06:26,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:26,444 INFO L225 Difference]: With dead ends: 505 [2024-11-09 02:06:26,444 INFO L226 Difference]: Without dead ends: 282 [2024-11-09 02:06:26,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2024-11-09 02:06:26,447 INFO L432 NwaCegarLoop]: 182 mSDtfsCounter, 70 mSDsluCounter, 1497 mSDsCounter, 0 mSdLazyCounter, 1099 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 1679 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:26,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 1679 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1099 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-09 02:06:26,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2024-11-09 02:06:26,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 216. [2024-11-09 02:06:26,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 199 states have (on average 1.2914572864321607) internal successors, (257), 200 states have internal predecessors, (257), 14 states have call successors, (14), 2 states have call predecessors, (14), 2 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2024-11-09 02:06:26,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 285 transitions. [2024-11-09 02:06:26,463 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 285 transitions. Word has length 124 [2024-11-09 02:06:26,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:26,463 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 285 transitions. [2024-11-09 02:06:26,463 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 6.090909090909091) internal successors, (67), 14 states have internal predecessors, (67), 4 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 4 states have call successors, (12) [2024-11-09 02:06:26,463 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 285 transitions. [2024-11-09 02:06:26,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-09 02:06:26,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:26,465 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:26,465 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-09 02:06:26,465 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:26,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash 589855564, now seen corresponding path program 1 times [2024-11-09 02:06:26,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:26,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750976706] [2024-11-09 02:06:26,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:26,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:26,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:27,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:27,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:27,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:27,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:27,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:27,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:27,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:27,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:27,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:27,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:27,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:27,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:27,968 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:27,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:27,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750976706] [2024-11-09 02:06:27,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750976706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:27,969 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:27,969 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 02:06:27,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [543383243] [2024-11-09 02:06:27,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:27,969 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 02:06:27,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:27,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 02:06:27,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2024-11-09 02:06:27,970 INFO L87 Difference]: Start difference. First operand 216 states and 285 transitions. Second operand has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:29,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:29,031 INFO L93 Difference]: Finished difference Result 527 states and 699 transitions. [2024-11-09 02:06:29,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 02:06:29,032 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 124 [2024-11-09 02:06:29,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:29,034 INFO L225 Difference]: With dead ends: 527 [2024-11-09 02:06:29,034 INFO L226 Difference]: Without dead ends: 314 [2024-11-09 02:06:29,035 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=43, Invalid=197, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:06:29,037 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 120 mSDsluCounter, 1175 mSDsCounter, 0 mSdLazyCounter, 935 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 121 SdHoareTripleChecker+Valid, 1404 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 935 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:29,037 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [121 Valid, 1404 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 935 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 02:06:29,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-11-09 02:06:29,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 297. [2024-11-09 02:06:29,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 266 states have (on average 1.2969924812030076) internal successors, (345), 268 states have internal predecessors, (345), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 02:06:29,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 397 transitions. [2024-11-09 02:06:29,063 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 397 transitions. Word has length 124 [2024-11-09 02:06:29,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:29,063 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 397 transitions. [2024-11-09 02:06:29,063 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.7) internal successors, (67), 11 states have internal predecessors, (67), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:29,064 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 397 transitions. [2024-11-09 02:06:29,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:06:29,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:29,067 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:29,067 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 02:06:29,067 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:29,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:29,068 INFO L85 PathProgramCache]: Analyzing trace with hash 1729668551, now seen corresponding path program 1 times [2024-11-09 02:06:29,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:29,068 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86468715] [2024-11-09 02:06:29,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:29,068 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:29,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:29,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:29,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:29,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:29,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:29,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:29,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:29,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:29,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:29,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:29,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:29,274 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:29,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:29,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86468715] [2024-11-09 02:06:29,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86468715] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:29,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 02:06:29,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [329586523] [2024-11-09 02:06:29,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:29,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 02:06:29,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:29,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 02:06:29,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:06:29,278 INFO L87 Difference]: Start difference. First operand 297 states and 397 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:29,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:29,318 INFO L93 Difference]: Finished difference Result 591 states and 791 transitions. [2024-11-09 02:06:29,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 02:06:29,319 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-09 02:06:29,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:29,322 INFO L225 Difference]: With dead ends: 591 [2024-11-09 02:06:29,322 INFO L226 Difference]: Without dead ends: 297 [2024-11-09 02:06:29,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 02:06:29,324 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 1 mSDsluCounter, 286 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:29,324 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 433 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:06:29,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 297 states. [2024-11-09 02:06:29,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 297 to 297. [2024-11-09 02:06:29,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 266 states have (on average 1.2857142857142858) internal successors, (342), 268 states have internal predecessors, (342), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 02:06:29,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 394 transitions. [2024-11-09 02:06:29,355 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 394 transitions. Word has length 125 [2024-11-09 02:06:29,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:29,355 INFO L471 AbstractCegarLoop]: Abstraction has 297 states and 394 transitions. [2024-11-09 02:06:29,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:29,356 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 394 transitions. [2024-11-09 02:06:29,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:06:29,357 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:29,357 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:29,357 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 02:06:29,358 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:29,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:29,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1895486879, now seen corresponding path program 1 times [2024-11-09 02:06:29,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:29,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791128891] [2024-11-09 02:06:29,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:29,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:29,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:30,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:30,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:30,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:30,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,673 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:30,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:30,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:30,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:30,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:30,687 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:30,687 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:30,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791128891] [2024-11-09 02:06:30,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791128891] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:30,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:30,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 02:06:30,688 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241686236] [2024-11-09 02:06:30,688 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:30,689 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 02:06:30,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:30,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 02:06:30,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2024-11-09 02:06:30,690 INFO L87 Difference]: Start difference. First operand 297 states and 394 transitions. Second operand has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:31,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:31,551 INFO L93 Difference]: Finished difference Result 642 states and 844 transitions. [2024-11-09 02:06:31,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 02:06:31,552 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2024-11-09 02:06:31,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:31,554 INFO L225 Difference]: With dead ends: 642 [2024-11-09 02:06:31,554 INFO L226 Difference]: Without dead ends: 348 [2024-11-09 02:06:31,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:06:31,556 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 104 mSDsluCounter, 1076 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 1295 SdHoareTripleChecker+Invalid, 761 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:31,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [105 Valid, 1295 Invalid, 761 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-09 02:06:31,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 348 states. [2024-11-09 02:06:31,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 348 to 293. [2024-11-09 02:06:31,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 262 states have (on average 1.282442748091603) internal successors, (336), 264 states have internal predecessors, (336), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 02:06:31,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 388 transitions. [2024-11-09 02:06:31,581 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 388 transitions. Word has length 125 [2024-11-09 02:06:31,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:31,581 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 388 transitions. [2024-11-09 02:06:31,582 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 7.555555555555555) internal successors, (68), 10 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:31,582 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 388 transitions. [2024-11-09 02:06:31,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:06:31,583 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:31,583 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:31,583 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 02:06:31,583 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:31,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:31,584 INFO L85 PathProgramCache]: Analyzing trace with hash 2014807907, now seen corresponding path program 1 times [2024-11-09 02:06:31,584 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:31,584 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861747680] [2024-11-09 02:06:31,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:31,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:31,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:31,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:31,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:31,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:31,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:31,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:31,958 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:31,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:31,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861747680] [2024-11-09 02:06:31,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861747680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:31,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:31,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:06:31,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418577459] [2024-11-09 02:06:31,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:31,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:06:31,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:31,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:06:31,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:06:31,961 INFO L87 Difference]: Start difference. First operand 293 states and 388 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:32,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:32,278 INFO L93 Difference]: Finished difference Result 873 states and 1158 transitions. [2024-11-09 02:06:32,278 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 02:06:32,279 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 125 [2024-11-09 02:06:32,279 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:32,283 INFO L225 Difference]: With dead ends: 873 [2024-11-09 02:06:32,283 INFO L226 Difference]: Without dead ends: 583 [2024-11-09 02:06:32,284 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-09 02:06:32,284 INFO L432 NwaCegarLoop]: 233 mSDtfsCounter, 120 mSDsluCounter, 764 mSDsCounter, 0 mSdLazyCounter, 333 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 333 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:32,285 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 997 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 333 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:06:32,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2024-11-09 02:06:32,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 578. [2024-11-09 02:06:32,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 517 states have (on average 1.2843326885880078) internal successors, (664), 521 states have internal predecessors, (664), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 02:06:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 768 transitions. [2024-11-09 02:06:32,338 INFO L78 Accepts]: Start accepts. Automaton has 578 states and 768 transitions. Word has length 125 [2024-11-09 02:06:32,339 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:32,339 INFO L471 AbstractCegarLoop]: Abstraction has 578 states and 768 transitions. [2024-11-09 02:06:32,339 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 6 states have internal predecessors, (68), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-11-09 02:06:32,339 INFO L276 IsEmpty]: Start isEmpty. Operand 578 states and 768 transitions. [2024-11-09 02:06:32,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:06:32,341 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:32,341 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:32,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 02:06:32,342 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:32,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:32,342 INFO L85 PathProgramCache]: Analyzing trace with hash 2037440161, now seen corresponding path program 1 times [2024-11-09 02:06:32,343 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:32,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524487578] [2024-11-09 02:06:32,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:32,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:32,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:34,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:34,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:34,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:34,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:34,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:34,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:34,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:34,222 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:34,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:34,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524487578] [2024-11-09 02:06:34,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524487578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:34,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:34,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2024-11-09 02:06:34,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156173113] [2024-11-09 02:06:34,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:34,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 02:06:34,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:34,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 02:06:34,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2024-11-09 02:06:34,226 INFO L87 Difference]: Start difference. First operand 578 states and 768 transitions. Second operand has 16 states, 14 states have (on average 4.857142857142857) internal successors, (68), 16 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 02:06:35,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:35,931 INFO L93 Difference]: Finished difference Result 1621 states and 2138 transitions. [2024-11-09 02:06:35,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 02:06:35,934 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.857142857142857) internal successors, (68), 16 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) Word has length 125 [2024-11-09 02:06:35,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:35,940 INFO L225 Difference]: With dead ends: 1621 [2024-11-09 02:06:35,940 INFO L226 Difference]: Without dead ends: 1046 [2024-11-09 02:06:35,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=158, Invalid=772, Unknown=0, NotChecked=0, Total=930 [2024-11-09 02:06:35,944 INFO L432 NwaCegarLoop]: 250 mSDtfsCounter, 304 mSDsluCounter, 1410 mSDsCounter, 0 mSdLazyCounter, 1399 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 1660 SdHoareTripleChecker+Invalid, 1440 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 1399 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:35,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 1660 Invalid, 1440 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 1399 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-09 02:06:35,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-09 02:06:36,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 620. [2024-11-09 02:06:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 559 states have (on average 1.2844364937388193) internal successors, (718), 563 states have internal predecessors, (718), 52 states have call successors, (52), 8 states have call predecessors, (52), 8 states have return successors, (52), 48 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-09 02:06:36,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 822 transitions. [2024-11-09 02:06:36,011 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 822 transitions. Word has length 125 [2024-11-09 02:06:36,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:36,012 INFO L471 AbstractCegarLoop]: Abstraction has 620 states and 822 transitions. [2024-11-09 02:06:36,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.857142857142857) internal successors, (68), 16 states have internal predecessors, (68), 3 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 3 states have call successors, (12) [2024-11-09 02:06:36,012 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 822 transitions. [2024-11-09 02:06:36,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 126 [2024-11-09 02:06:36,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:36,014 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:36,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 02:06:36,014 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:36,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:36,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1555927261, now seen corresponding path program 1 times [2024-11-09 02:06:36,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:36,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590409144] [2024-11-09 02:06:36,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:36,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-09 02:06:36,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 02:06:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:06:36,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:06:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-09 02:06:36,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:06:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-09 02:06:36,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:06:36,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:06:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:06:36,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:06:36,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:06:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:06:36,958 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-11-09 02:06:36,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:06:36,958 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590409144] [2024-11-09 02:06:36,958 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590409144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:06:36,958 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:06:36,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 02:06:36,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352808352] [2024-11-09 02:06:36,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:06:36,960 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 02:06:36,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:06:36,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 02:06:36,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 02:06:36,961 INFO L87 Difference]: Start difference. First operand 620 states and 822 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:37,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:06:37,329 INFO L93 Difference]: Finished difference Result 1214 states and 1609 transitions. [2024-11-09 02:06:37,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 02:06:37,330 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 125 [2024-11-09 02:06:37,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:06:37,333 INFO L225 Difference]: With dead ends: 1214 [2024-11-09 02:06:37,334 INFO L226 Difference]: Without dead ends: 597 [2024-11-09 02:06:37,335 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 02:06:37,336 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 65 mSDsluCounter, 505 mSDsCounter, 0 mSdLazyCounter, 299 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 680 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 02:06:37,336 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 680 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 299 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 02:06:37,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 597 states. [2024-11-09 02:06:37,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 597 to 310. [2024-11-09 02:06:37,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 279 states have (on average 1.2759856630824373) internal successors, (356), 281 states have internal predecessors, (356), 26 states have call successors, (26), 4 states have call predecessors, (26), 4 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-09 02:06:37,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 408 transitions. [2024-11-09 02:06:37,364 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 408 transitions. Word has length 125 [2024-11-09 02:06:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:06:37,364 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 408 transitions. [2024-11-09 02:06:37,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-11-09 02:06:37,365 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 408 transitions. [2024-11-09 02:06:37,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2024-11-09 02:06:37,366 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:06:37,366 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 02:06:37,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 02:06:37,367 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:06:37,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:06:37,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1610679730, now seen corresponding path program 1 times [2024-11-09 02:06:37,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:06:37,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [619705232] [2024-11-09 02:06:37,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:06:37,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:06:37,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat