./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.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 da17d270b97e746bcc3bb567476dd5627c9f96457d30034078a1fde8f8099861 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 06:31:01,400 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 06:31:01,481 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 06:31:01,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 06:31:01,486 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 06:31:01,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 06:31:01,519 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 06:31:01,520 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 06:31:01,521 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 06:31:01,523 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 06:31:01,523 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 06:31:01,523 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 06:31:01,524 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 06:31:01,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 06:31:01,525 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 06:31:01,527 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 06:31:01,527 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 06:31:01,527 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 06:31:01,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 06:31:01,528 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 06:31:01,528 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 06:31:01,532 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 06:31:01,532 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 06:31:01,533 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 06:31:01,533 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 06:31:01,533 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 06:31:01,533 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 06:31:01,533 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 06:31:01,534 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 06:31:01,534 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 06:31:01,534 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 06:31:01,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 06:31:01,534 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:31:01,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 06:31:01,535 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 06:31:01,537 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 06:31:01,537 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 06:31:01,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 06:31:01,538 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 06:31:01,538 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 06:31:01,539 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 06:31:01,539 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 06:31:01,539 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 -> da17d270b97e746bcc3bb567476dd5627c9f96457d30034078a1fde8f8099861 [2024-10-13 06:31:01,843 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 06:31:01,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 06:31:01,878 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 06:31:01,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 06:31:01,880 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 06:31:01,881 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i [2024-10-13 06:31:03,511 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 06:31:03,716 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 06:31:03,717 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-66.i [2024-10-13 06:31:03,728 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d46479544/4ddb5bdc124145cfa2717b9a343463bd/FLAG50068c96b [2024-10-13 06:31:04,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d46479544/4ddb5bdc124145cfa2717b9a343463bd [2024-10-13 06:31:04,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 06:31:04,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 06:31:04,079 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 06:31:04,080 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 06:31:04,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 06:31:04,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,087 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c17c254 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04, skipping insertion in model container [2024-10-13 06:31:04,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,123 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 06:31:04,399 WARN L248 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-66.i[916,929] [2024-10-13 06:31:04,487 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:31:04,504 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 06:31:04,518 WARN L248 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-66.i[916,929] [2024-10-13 06:31:04,573 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 06:31:04,601 INFO L204 MainTranslator]: Completed translation [2024-10-13 06:31:04,602 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04 WrapperNode [2024-10-13 06:31:04,602 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 06:31:04,603 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 06:31:04,603 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 06:31:04,603 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 06:31:04,611 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,625 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,677 INFO L138 Inliner]: procedures = 26, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 426 [2024-10-13 06:31:04,678 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 06:31:04,681 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 06:31:04,681 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 06:31:04,681 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 06:31:04,699 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,700 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,710 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,743 INFO L175 MemorySlicer]: Split 123 memory accesses to 2 slices as follows [2, 121]. 98 percent of accesses are in the largest equivalence class. The 14 initializations are split as follows [2, 12]. The 16 writes are split as follows [0, 16]. [2024-10-13 06:31:04,743 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,744 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,775 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,779 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,783 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,786 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,792 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 06:31:04,793 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 06:31:04,794 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 06:31:04,794 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 06:31:04,795 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (1/1) ... [2024-10-13 06:31:04,801 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 06:31:04,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 06:31:04,838 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-10-13 06:31:04,845 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-10-13 06:31:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 06:31:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-10-13 06:31:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-10-13 06:31:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-10-13 06:31:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-10-13 06:31:04,903 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 06:31:04,903 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 06:31:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 06:31:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-10-13 06:31:04,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 06:31:04,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 06:31:05,013 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 06:31:05,015 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 06:31:05,587 INFO L? ?]: Removed 107 outVars from TransFormulas that were not future-live. [2024-10-13 06:31:05,587 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 06:31:05,624 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 06:31:05,626 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 06:31:05,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:31:05 BoogieIcfgContainer [2024-10-13 06:31:05,627 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 06:31:05,630 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 06:31:05,631 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 06:31:05,636 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 06:31:05,636 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 06:31:04" (1/3) ... [2024-10-13 06:31:05,637 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b9aa8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:31:05, skipping insertion in model container [2024-10-13 06:31:05,637 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 06:31:04" (2/3) ... [2024-10-13 06:31:05,638 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9b9aa8b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 06:31:05, skipping insertion in model container [2024-10-13 06:31:05,638 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 06:31:05" (3/3) ... [2024-10-13 06:31:05,639 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-66.i [2024-10-13 06:31:05,655 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 06:31:05,656 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 06:31:05,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 06:31:05,738 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;@25574287, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 06:31:05,738 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 06:31:05,743 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:31:05,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 06:31:05,762 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:05,763 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:05,763 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:05,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:05,770 INFO L85 PathProgramCache]: Analyzing trace with hash 1993153253, now seen corresponding path program 1 times [2024-10-13 06:31:05,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:05,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232465623] [2024-10-13 06:31:05,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:05,782 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:06,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:06,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:06,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:06,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:06,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:06,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:06,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:06,616 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:06,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:06,618 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232465623] [2024-10-13 06:31:06,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232465623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:06,619 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:06,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:31:06,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113088631] [2024-10-13 06:31:06,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:06,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:31:06,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:06,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:31:06,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:31:06,661 INFO L87 Difference]: Start difference. First operand has 79 states, 62 states have (on average 1.4516129032258065) internal successors, (90), 63 states have internal predecessors, (90), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:06,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:06,753 INFO L93 Difference]: Finished difference Result 158 states and 252 transitions. [2024-10-13 06:31:06,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:31:06,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2024-10-13 06:31:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:06,771 INFO L225 Difference]: With dead ends: 158 [2024-10-13 06:31:06,771 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 06:31:06,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-10-13 06:31:06,782 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 1 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:06,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 311 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:31:06,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 06:31:06,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2024-10-13 06:31:06,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 63 states have (on average 1.380952380952381) internal successors, (87), 63 states have internal predecessors, (87), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:31:06,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 115 transitions. [2024-10-13 06:31:06,836 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 115 transitions. Word has length 104 [2024-10-13 06:31:06,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:06,838 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 115 transitions. [2024-10-13 06:31:06,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:06,839 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 115 transitions. [2024-10-13 06:31:06,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 06:31:06,841 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:06,842 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:06,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 06:31:06,842 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:06,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:06,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2050411555, now seen corresponding path program 1 times [2024-10-13 06:31:06,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:06,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408778573] [2024-10-13 06:31:06,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:06,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:06,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:07,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:07,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:07,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:07,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:07,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:07,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:07,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:07,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:07,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:07,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:07,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:07,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:07,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408778573] [2024-10-13 06:31:07,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [408778573] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:07,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:07,203 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:31:07,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384526964] [2024-10-13 06:31:07,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:07,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:31:07,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:07,210 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:31:07,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:31:07,210 INFO L87 Difference]: Start difference. First operand 79 states and 115 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:07,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:07,273 INFO L93 Difference]: Finished difference Result 160 states and 233 transitions. [2024-10-13 06:31:07,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:31:07,274 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2024-10-13 06:31:07,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:07,276 INFO L225 Difference]: With dead ends: 160 [2024-10-13 06:31:07,279 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 06:31:07,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 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-10-13 06:31:07,281 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 1 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:07,282 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 315 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:31:07,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 06:31:07,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2024-10-13 06:31:07,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 65 states have (on average 1.3692307692307693) internal successors, (89), 65 states have internal predecessors, (89), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-13 06:31:07,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 117 transitions. [2024-10-13 06:31:07,299 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 117 transitions. Word has length 104 [2024-10-13 06:31:07,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:07,300 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 117 transitions. [2024-10-13 06:31:07,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2024-10-13 06:31:07,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2024-10-13 06:31:07,302 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:07,303 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:07,303 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 06:31:07,304 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:07,304 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:07,304 INFO L85 PathProgramCache]: Analyzing trace with hash 2050471137, now seen corresponding path program 1 times [2024-10-13 06:31:07,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:07,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663423592] [2024-10-13 06:31:07,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:07,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:08,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:08,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:08,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,460 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:08,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:08,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:08,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:08,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:08,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:08,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:08,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:08,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,527 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:08,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:08,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:08,544 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:08,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:08,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663423592] [2024-10-13 06:31:08,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663423592] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:08,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:08,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:31:08,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965209296] [2024-10-13 06:31:08,548 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:08,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:31:08,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:08,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:31:08,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:31:08,550 INFO L87 Difference]: Start difference. First operand 81 states and 117 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:08,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:08,854 INFO L93 Difference]: Finished difference Result 241 states and 349 transitions. [2024-10-13 06:31:08,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:31:08,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 104 [2024-10-13 06:31:08,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:08,858 INFO L225 Difference]: With dead ends: 241 [2024-10-13 06:31:08,861 INFO L226 Difference]: Without dead ends: 161 [2024-10-13 06:31:08,862 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:31:08,863 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 74 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 172 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 172 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:08,864 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 254 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 172 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:31:08,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-10-13 06:31:08,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 153. [2024-10-13 06:31:08,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 122 states have (on average 1.3524590163934427) internal successors, (165), 122 states have internal predecessors, (165), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 06:31:08,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 221 transitions. [2024-10-13 06:31:08,887 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 221 transitions. Word has length 104 [2024-10-13 06:31:08,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:08,887 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 221 transitions. [2024-10-13 06:31:08,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:08,888 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 221 transitions. [2024-10-13 06:31:08,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:31:08,889 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:08,890 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:08,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 06:31:08,890 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:08,891 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:08,891 INFO L85 PathProgramCache]: Analyzing trace with hash 2064766436, now seen corresponding path program 1 times [2024-10-13 06:31:08,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:08,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980733985] [2024-10-13 06:31:08,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:08,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:11,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:11,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:11,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:11,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:11,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:11,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:11,961 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:11,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:11,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:11,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:11,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:11,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:11,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:11,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:11,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:11,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:11,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:11,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:11,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:11,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:12,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:12,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:12,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:12,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:12,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:12,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:12,020 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:12,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:12,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980733985] [2024-10-13 06:31:12,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980733985] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:12,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:12,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 06:31:12,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636508680] [2024-10-13 06:31:12,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:12,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 06:31:12,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:12,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 06:31:12,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:31:12,027 INFO L87 Difference]: Start difference. First operand 153 states and 221 transitions. Second operand has 14 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-13 06:31:13,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:13,629 INFO L93 Difference]: Finished difference Result 437 states and 630 transitions. [2024-10-13 06:31:13,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 06:31:13,631 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 105 [2024-10-13 06:31:13,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:13,633 INFO L225 Difference]: With dead ends: 437 [2024-10-13 06:31:13,634 INFO L226 Difference]: Without dead ends: 285 [2024-10-13 06:31:13,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=894, Unknown=0, NotChecked=0, Total=1056 [2024-10-13 06:31:13,636 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 292 mSDsluCounter, 556 mSDsCounter, 0 mSdLazyCounter, 1130 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 625 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 1130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:13,637 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 625 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 1130 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-10-13 06:31:13,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2024-10-13 06:31:13,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 161. [2024-10-13 06:31:13,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 130 states have (on average 1.3384615384615384) internal successors, (174), 130 states have internal predecessors, (174), 28 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-10-13 06:31:13,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 230 transitions. [2024-10-13 06:31:13,668 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 230 transitions. Word has length 105 [2024-10-13 06:31:13,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:13,669 INFO L471 AbstractCegarLoop]: Abstraction has 161 states and 230 transitions. [2024-10-13 06:31:13,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 14 states have internal predecessors, (38), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-13 06:31:13,669 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 230 transitions. [2024-10-13 06:31:13,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:31:13,671 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:13,671 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:13,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 06:31:13,672 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:13,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:13,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1972035422, now seen corresponding path program 1 times [2024-10-13 06:31:13,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:13,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530216799] [2024-10-13 06:31:13,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:13,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:14,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:14,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:14,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:14,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:14,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:14,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:14,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:14,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:14,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:14,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:14,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530216799] [2024-10-13 06:31:14,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530216799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:14,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:14,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:31:14,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314209583] [2024-10-13 06:31:14,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:14,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:31:14,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:14,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:31:14,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:31:14,509 INFO L87 Difference]: Start difference. First operand 161 states and 230 transitions. Second operand has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:15,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:15,031 INFO L93 Difference]: Finished difference Result 355 states and 502 transitions. [2024-10-13 06:31:15,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:31:15,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2024-10-13 06:31:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:15,035 INFO L225 Difference]: With dead ends: 355 [2024-10-13 06:31:15,037 INFO L226 Difference]: Without dead ends: 267 [2024-10-13 06:31:15,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:31:15,038 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 199 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 410 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:15,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 345 Invalid, 410 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:31:15,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2024-10-13 06:31:15,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 195. [2024-10-13 06:31:15,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 156 states have (on average 1.3269230769230769) internal successors, (207), 157 states have internal predecessors, (207), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:31:15,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 275 transitions. [2024-10-13 06:31:15,081 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 275 transitions. Word has length 105 [2024-10-13 06:31:15,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:15,083 INFO L471 AbstractCegarLoop]: Abstraction has 195 states and 275 transitions. [2024-10-13 06:31:15,084 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.6) internal successors, (38), 6 states have internal predecessors, (38), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 275 transitions. [2024-10-13 06:31:15,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-10-13 06:31:15,087 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:15,088 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:15,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 06:31:15,088 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:15,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:15,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1043698082, now seen corresponding path program 1 times [2024-10-13 06:31:15,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:15,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [530950289] [2024-10-13 06:31:15,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:15,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:16,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:16,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:16,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:16,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:16,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:16,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:16,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:16,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,150 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:16,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:16,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:16,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:16,158 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:16,158 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:16,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [530950289] [2024-10-13 06:31:16,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [530950289] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:16,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:16,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:31:16,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481971137] [2024-10-13 06:31:16,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:16,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:31:16,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:16,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:31:16,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:31:16,160 INFO L87 Difference]: Start difference. First operand 195 states and 275 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:16,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:16,892 INFO L93 Difference]: Finished difference Result 370 states and 521 transitions. [2024-10-13 06:31:16,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:31:16,893 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 105 [2024-10-13 06:31:16,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:16,896 INFO L225 Difference]: With dead ends: 370 [2024-10-13 06:31:16,896 INFO L226 Difference]: Without dead ends: 258 [2024-10-13 06:31:16,897 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:31:16,898 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 178 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:16,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 348 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 595 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:31:16,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-10-13 06:31:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 189. [2024-10-13 06:31:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 150 states have (on average 1.3066666666666666) internal successors, (196), 151 states have internal predecessors, (196), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:31:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 264 transitions. [2024-10-13 06:31:16,936 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 264 transitions. Word has length 105 [2024-10-13 06:31:16,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:16,938 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 264 transitions. [2024-10-13 06:31:16,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:16,938 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 264 transitions. [2024-10-13 06:31:16,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 06:31:16,941 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:16,941 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:16,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 06:31:16,942 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:16,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:16,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1475694180, now seen corresponding path program 1 times [2024-10-13 06:31:16,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:16,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283050310] [2024-10-13 06:31:16,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:16,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:17,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:17,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:17,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,047 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,050 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:17,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:17,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283050310] [2024-10-13 06:31:17,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283050310] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:17,051 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:17,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:31:17,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506826269] [2024-10-13 06:31:17,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:17,052 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:31:17,053 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:17,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:31:17,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:31:17,054 INFO L87 Difference]: Start difference. First operand 189 states and 264 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:17,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:17,094 INFO L93 Difference]: Finished difference Result 367 states and 513 transitions. [2024-10-13 06:31:17,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:31:17,095 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2024-10-13 06:31:17,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:17,097 INFO L225 Difference]: With dead ends: 367 [2024-10-13 06:31:17,097 INFO L226 Difference]: Without dead ends: 191 [2024-10-13 06:31:17,098 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-10-13 06:31:17,102 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:17,102 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 211 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:31:17,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2024-10-13 06:31:17,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2024-10-13 06:31:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 152 states have (on average 1.3026315789473684) internal successors, (198), 153 states have internal predecessors, (198), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:31:17,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 266 transitions. [2024-10-13 06:31:17,128 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 266 transitions. Word has length 108 [2024-10-13 06:31:17,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:17,129 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 266 transitions. [2024-10-13 06:31:17,130 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:17,130 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 266 transitions. [2024-10-13 06:31:17,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 06:31:17,131 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:17,131 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:17,131 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 06:31:17,132 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:17,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:17,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1217528742, now seen corresponding path program 1 times [2024-10-13 06:31:17,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:17,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960499966] [2024-10-13 06:31:17,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:17,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:17,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:17,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:17,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:17,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:17,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:17,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:17,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,312 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:17,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,316 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:17,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:17,321 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:17,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:17,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960499966] [2024-10-13 06:31:17,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960499966] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:17,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:17,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:31:17,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641626974] [2024-10-13 06:31:17,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:17,322 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:31:17,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:17,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:31:17,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:31:17,324 INFO L87 Difference]: Start difference. First operand 191 states and 266 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:17,381 INFO L93 Difference]: Finished difference Result 375 states and 521 transitions. [2024-10-13 06:31:17,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:31:17,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 108 [2024-10-13 06:31:17,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:17,384 INFO L225 Difference]: With dead ends: 375 [2024-10-13 06:31:17,384 INFO L226 Difference]: Without dead ends: 197 [2024-10-13 06:31:17,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 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-10-13 06:31:17,386 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:17,387 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 413 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:31:17,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2024-10-13 06:31:17,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2024-10-13 06:31:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 158 states have (on average 1.2911392405063291) internal successors, (204), 159 states have internal predecessors, (204), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:31:17,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 272 transitions. [2024-10-13 06:31:17,425 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 272 transitions. Word has length 108 [2024-10-13 06:31:17,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:17,426 INFO L471 AbstractCegarLoop]: Abstraction has 197 states and 272 transitions. [2024-10-13 06:31:17,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 states have internal predecessors, (41), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:17,426 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 272 transitions. [2024-10-13 06:31:17,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 06:31:17,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:17,427 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:17,427 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-10-13 06:31:17,428 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:17,428 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:17,428 INFO L85 PathProgramCache]: Analyzing trace with hash -1897635123, now seen corresponding path program 1 times [2024-10-13 06:31:17,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:17,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1852401646] [2024-10-13 06:31:17,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:17,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:17,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:19,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,898 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:19,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:19,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:19,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:19,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:19,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:19,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:19,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:19,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:19,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:19,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:19,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1852401646] [2024-10-13 06:31:19,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1852401646] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:19,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:19,926 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 06:31:19,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518102891] [2024-10-13 06:31:19,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:19,927 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 06:31:19,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:19,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 06:31:19,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:31:19,929 INFO L87 Difference]: Start difference. First operand 197 states and 272 transitions. Second operand has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 06:31:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:24,898 INFO L93 Difference]: Finished difference Result 539 states and 738 transitions. [2024-10-13 06:31:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-10-13 06:31:24,899 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 108 [2024-10-13 06:31:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:24,901 INFO L225 Difference]: With dead ends: 539 [2024-10-13 06:31:24,901 INFO L226 Difference]: Without dead ends: 435 [2024-10-13 06:31:24,902 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=144, Invalid=786, Unknown=0, NotChecked=0, Total=930 [2024-10-13 06:31:24,903 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 364 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 1995 mSolverCounterSat, 165 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 1125 SdHoareTripleChecker+Invalid, 2160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 165 IncrementalHoareTripleChecker+Valid, 1995 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:24,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [366 Valid, 1125 Invalid, 2160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [165 Valid, 1995 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-10-13 06:31:24,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 435 states. [2024-10-13 06:31:24,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 435 to 201. [2024-10-13 06:31:24,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 163 states have internal predecessors, (210), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:31:24,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2024-10-13 06:31:24,943 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 278 transitions. Word has length 108 [2024-10-13 06:31:24,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:24,943 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-10-13 06:31:24,943 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 3.4166666666666665) internal successors, (41), 14 states have internal predecessors, (41), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 06:31:24,944 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 278 transitions. [2024-10-13 06:31:24,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 06:31:24,946 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:24,947 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:24,947 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-13 06:31:24,947 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:24,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:24,948 INFO L85 PathProgramCache]: Analyzing trace with hash 1376263819, now seen corresponding path program 1 times [2024-10-13 06:31:24,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:24,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44899056] [2024-10-13 06:31:24,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:24,949 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:25,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:26,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:26,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:26,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:26,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:26,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:26,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:26,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:26,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:26,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:26,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:26,135 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:26,135 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:26,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44899056] [2024-10-13 06:31:26,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44899056] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:26,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:26,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:31:26,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375413317] [2024-10-13 06:31:26,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:26,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:31:26,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:26,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:31:26,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:31:26,137 INFO L87 Difference]: Start difference. First operand 201 states and 278 transitions. Second operand has 7 states, 5 states have (on average 8.2) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 06:31:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:26,480 INFO L93 Difference]: Finished difference Result 346 states and 479 transitions. [2024-10-13 06:31:26,481 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:31:26,481 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 8.2) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 108 [2024-10-13 06:31:26,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:26,483 INFO L225 Difference]: With dead ends: 346 [2024-10-13 06:31:26,483 INFO L226 Difference]: Without dead ends: 238 [2024-10-13 06:31:26,484 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:31:26,484 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 44 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 354 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 356 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:26,484 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 563 Invalid, 356 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 354 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:31:26,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-10-13 06:31:26,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 201. [2024-10-13 06:31:26,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 201 states, 162 states have (on average 1.2962962962962963) internal successors, (210), 163 states have internal predecessors, (210), 34 states have call successors, (34), 4 states have call predecessors, (34), 4 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:31:26,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 201 states to 201 states and 278 transitions. [2024-10-13 06:31:26,511 INFO L78 Accepts]: Start accepts. Automaton has 201 states and 278 transitions. Word has length 108 [2024-10-13 06:31:26,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:26,511 INFO L471 AbstractCegarLoop]: Abstraction has 201 states and 278 transitions. [2024-10-13 06:31:26,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 8.2) internal successors, (41), 7 states have internal predecessors, (41), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 06:31:26,512 INFO L276 IsEmpty]: Start isEmpty. Operand 201 states and 278 transitions. [2024-10-13 06:31:26,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2024-10-13 06:31:26,513 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:26,513 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:26,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-13 06:31:26,513 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:26,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:26,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1579683723, now seen corresponding path program 1 times [2024-10-13 06:31:26,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:26,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918814463] [2024-10-13 06:31:26,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:26,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:26,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:28,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:28,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:28,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:28,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:28,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:28,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:28,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,198 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:28,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:28,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:28,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:28,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:28,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:28,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:28,214 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:28,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:28,214 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918814463] [2024-10-13 06:31:28,214 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918814463] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:28,214 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:28,214 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-13 06:31:28,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1270514116] [2024-10-13 06:31:28,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:28,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-10-13 06:31:28,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:28,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-10-13 06:31:28,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:31:28,217 INFO L87 Difference]: Start difference. First operand 201 states and 278 transitions. Second operand has 14 states, 11 states have (on average 3.727272727272727) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-13 06:31:30,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:30,328 INFO L93 Difference]: Finished difference Result 525 states and 718 transitions. [2024-10-13 06:31:30,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-13 06:31:30,329 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 3.727272727272727) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 108 [2024-10-13 06:31:30,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:30,331 INFO L225 Difference]: With dead ends: 525 [2024-10-13 06:31:30,331 INFO L226 Difference]: Without dead ends: 417 [2024-10-13 06:31:30,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 214 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=190, Invalid=932, Unknown=0, NotChecked=0, Total=1122 [2024-10-13 06:31:30,333 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 399 mSDsluCounter, 954 mSDsCounter, 0 mSdLazyCounter, 1693 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 399 SdHoareTripleChecker+Valid, 1073 SdHoareTripleChecker+Invalid, 1889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:30,334 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [399 Valid, 1073 Invalid, 1889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1693 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-10-13 06:31:30,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2024-10-13 06:31:30,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 293. [2024-10-13 06:31:30,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 293 states, 240 states have (on average 1.3041666666666667) internal successors, (313), 242 states have internal predecessors, (313), 44 states have call successors, (44), 8 states have call predecessors, (44), 8 states have return successors, (44), 42 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-13 06:31:30,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 293 states to 293 states and 401 transitions. [2024-10-13 06:31:30,394 INFO L78 Accepts]: Start accepts. Automaton has 293 states and 401 transitions. Word has length 108 [2024-10-13 06:31:30,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:30,398 INFO L471 AbstractCegarLoop]: Abstraction has 293 states and 401 transitions. [2024-10-13 06:31:30,398 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 3.727272727272727) internal successors, (41), 14 states have internal predecessors, (41), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-13 06:31:30,398 INFO L276 IsEmpty]: Start isEmpty. Operand 293 states and 401 transitions. [2024-10-13 06:31:30,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:31:30,400 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:30,400 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:30,400 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 06:31:30,401 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:30,401 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:30,401 INFO L85 PathProgramCache]: Analyzing trace with hash -1541036681, now seen corresponding path program 1 times [2024-10-13 06:31:30,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:30,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347432764] [2024-10-13 06:31:30,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:30,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:30,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:31,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:31,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:31,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:31,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:31,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:31,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:31,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:31,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:31,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:31,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:31,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:31,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:31,555 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:31,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:31,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347432764] [2024-10-13 06:31:31,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1347432764] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:31,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:31,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-13 06:31:31,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350681133] [2024-10-13 06:31:31,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:31,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 06:31:31,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:31,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 06:31:31,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:31:31,557 INFO L87 Difference]: Start difference. First operand 293 states and 401 transitions. Second operand has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:32,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:32,364 INFO L93 Difference]: Finished difference Result 527 states and 716 transitions. [2024-10-13 06:31:32,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 06:31:32,365 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-10-13 06:31:32,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:32,367 INFO L225 Difference]: With dead ends: 527 [2024-10-13 06:31:32,367 INFO L226 Difference]: Without dead ends: 419 [2024-10-13 06:31:32,368 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=279, Unknown=0, NotChecked=0, Total=342 [2024-10-13 06:31:32,369 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 125 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 724 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 736 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:32,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 704 Invalid, 736 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 724 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:31:32,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2024-10-13 06:31:32,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 270. [2024-10-13 06:31:32,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 270 states, 233 states have (on average 1.3390557939914163) internal successors, (312), 234 states have internal predecessors, (312), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 06:31:32,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 270 states to 270 states and 372 transitions. [2024-10-13 06:31:32,414 INFO L78 Accepts]: Start accepts. Automaton has 270 states and 372 transitions. Word has length 110 [2024-10-13 06:31:32,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:32,414 INFO L471 AbstractCegarLoop]: Abstraction has 270 states and 372 transitions. [2024-10-13 06:31:32,415 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.3) internal successors, (43), 11 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 270 states and 372 transitions. [2024-10-13 06:31:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:31:32,417 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:32,417 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:32,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 06:31:32,418 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:32,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:32,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1069309923, now seen corresponding path program 1 times [2024-10-13 06:31:32,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:32,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922971617] [2024-10-13 06:31:32,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:32,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:32,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:33,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:33,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:33,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:33,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:33,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:33,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:33,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:33,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:33,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:33,296 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:33,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:33,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922971617] [2024-10-13 06:31:33,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922971617] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:33,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:33,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:31:33,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103486559] [2024-10-13 06:31:33,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:33,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:31:33,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:33,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:31:33,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:31:33,298 INFO L87 Difference]: Start difference. First operand 270 states and 372 transitions. Second operand has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:34,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:34,079 INFO L93 Difference]: Finished difference Result 545 states and 747 transitions. [2024-10-13 06:31:34,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 06:31:34,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-10-13 06:31:34,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:34,082 INFO L225 Difference]: With dead ends: 545 [2024-10-13 06:31:34,082 INFO L226 Difference]: Without dead ends: 424 [2024-10-13 06:31:34,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-10-13 06:31:34,083 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 270 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 674 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 525 SdHoareTripleChecker+Invalid, 824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 674 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:34,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 525 Invalid, 824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 674 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-10-13 06:31:34,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2024-10-13 06:31:34,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 281. [2024-10-13 06:31:34,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 281 states, 244 states have (on average 1.3360655737704918) internal successors, (326), 245 states have internal predecessors, (326), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 06:31:34,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 281 states to 281 states and 386 transitions. [2024-10-13 06:31:34,127 INFO L78 Accepts]: Start accepts. Automaton has 281 states and 386 transitions. Word has length 110 [2024-10-13 06:31:34,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:34,127 INFO L471 AbstractCegarLoop]: Abstraction has 281 states and 386 transitions. [2024-10-13 06:31:34,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.375) internal successors, (43), 9 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:34,128 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 386 transitions. [2024-10-13 06:31:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:31:34,129 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:34,129 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:34,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 06:31:34,130 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:34,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:34,130 INFO L85 PathProgramCache]: Analyzing trace with hash -218986061, now seen corresponding path program 1 times [2024-10-13 06:31:34,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:34,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26565095] [2024-10-13 06:31:34,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:34,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:34,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:35,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:35,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:35,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:35,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:35,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:35,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:35,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:35,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:35,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:35,166 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:35,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:35,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26565095] [2024-10-13 06:31:35,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [26565095] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:35,166 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:35,166 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:31:35,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241349327] [2024-10-13 06:31:35,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:35,167 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:31:35,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:35,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:31:35,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:31:35,168 INFO L87 Difference]: Start difference. First operand 281 states and 386 transitions. Second operand has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:36,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:36,390 INFO L93 Difference]: Finished difference Result 563 states and 776 transitions. [2024-10-13 06:31:36,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 06:31:36,391 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 110 [2024-10-13 06:31:36,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:36,394 INFO L225 Difference]: With dead ends: 563 [2024-10-13 06:31:36,394 INFO L226 Difference]: Without dead ends: 436 [2024-10-13 06:31:36,395 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=165, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:31:36,395 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 219 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 1298 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 1341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 1298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:36,396 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 719 Invalid, 1341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 1298 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-10-13 06:31:36,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2024-10-13 06:31:36,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 286. [2024-10-13 06:31:36,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 249 states have (on average 1.3333333333333333) internal successors, (332), 250 states have internal predecessors, (332), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 06:31:36,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 392 transitions. [2024-10-13 06:31:36,461 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 392 transitions. Word has length 110 [2024-10-13 06:31:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:36,462 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 392 transitions. [2024-10-13 06:31:36,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.777777777777778) internal successors, (43), 10 states have internal predecessors, (43), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 392 transitions. [2024-10-13 06:31:36,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:31:36,463 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:36,464 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:36,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 06:31:36,464 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:36,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:36,464 INFO L85 PathProgramCache]: Analyzing trace with hash -1036634511, now seen corresponding path program 1 times [2024-10-13 06:31:36,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:36,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416289447] [2024-10-13 06:31:36,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:36,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:36,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:36,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:36,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:36,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:36,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:36,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:36,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:36,717 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:36,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:36,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416289447] [2024-10-13 06:31:36,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416289447] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:36,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:36,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 06:31:36,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [732448148] [2024-10-13 06:31:36,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:36,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 06:31:36,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:36,720 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 06:31:36,720 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:31:36,720 INFO L87 Difference]: Start difference. First operand 286 states and 392 transitions. Second operand has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:37,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:37,040 INFO L93 Difference]: Finished difference Result 471 states and 647 transitions. [2024-10-13 06:31:37,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 06:31:37,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-10-13 06:31:37,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:37,043 INFO L225 Difference]: With dead ends: 471 [2024-10-13 06:31:37,043 INFO L226 Difference]: Without dead ends: 345 [2024-10-13 06:31:37,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-10-13 06:31:37,046 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 70 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:37,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 408 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:31:37,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2024-10-13 06:31:37,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 286. [2024-10-13 06:31:37,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 249 states have (on average 1.3293172690763053) internal successors, (331), 250 states have internal predecessors, (331), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 06:31:37,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 391 transitions. [2024-10-13 06:31:37,090 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 391 transitions. Word has length 110 [2024-10-13 06:31:37,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:37,090 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 391 transitions. [2024-10-13 06:31:37,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.6) internal successors, (43), 5 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 391 transitions. [2024-10-13 06:31:37,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2024-10-13 06:31:37,092 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:37,092 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:37,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-13 06:31:37,093 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:37,093 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:37,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1091063261, now seen corresponding path program 1 times [2024-10-13 06:31:37,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:37,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655929116] [2024-10-13 06:31:37,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:37,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:37,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:37,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:37,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:37,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:37,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:37,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:37,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:37,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:37,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:37,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:37,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:37,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:37,643 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:37,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:37,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655929116] [2024-10-13 06:31:37,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655929116] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:37,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:37,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:31:37,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219492564] [2024-10-13 06:31:37,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:37,644 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:31:37,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:37,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:31:37,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:31:37,645 INFO L87 Difference]: Start difference. First operand 286 states and 391 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:38,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:38,084 INFO L93 Difference]: Finished difference Result 565 states and 770 transitions. [2024-10-13 06:31:38,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:31:38,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 110 [2024-10-13 06:31:38,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:38,088 INFO L225 Difference]: With dead ends: 565 [2024-10-13 06:31:38,088 INFO L226 Difference]: Without dead ends: 397 [2024-10-13 06:31:38,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:31:38,090 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 171 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 280 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 280 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:38,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 164 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 280 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:31:38,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2024-10-13 06:31:38,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 273. [2024-10-13 06:31:38,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 273 states, 236 states have (on average 1.3135593220338984) internal successors, (310), 237 states have internal predecessors, (310), 30 states have call successors, (30), 6 states have call predecessors, (30), 6 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-13 06:31:38,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 273 states to 273 states and 370 transitions. [2024-10-13 06:31:38,140 INFO L78 Accepts]: Start accepts. Automaton has 273 states and 370 transitions. Word has length 110 [2024-10-13 06:31:38,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:38,140 INFO L471 AbstractCegarLoop]: Abstraction has 273 states and 370 transitions. [2024-10-13 06:31:38,141 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 6 states have internal predecessors, (43), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:38,141 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 370 transitions. [2024-10-13 06:31:38,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 06:31:38,142 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:38,143 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:38,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 06:31:38,143 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:38,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:38,144 INFO L85 PathProgramCache]: Analyzing trace with hash -475173374, now seen corresponding path program 1 times [2024-10-13 06:31:38,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:38,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34883012] [2024-10-13 06:31:38,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:38,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:38,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:38,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:38,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:38,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,677 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:38,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:38,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:38,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,683 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:38,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:38,686 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:38,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:38,686 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34883012] [2024-10-13 06:31:38,686 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34883012] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:38,686 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:38,687 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:31:38,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45863725] [2024-10-13 06:31:38,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:38,687 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:31:38,687 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:38,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:31:38,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:31:38,689 INFO L87 Difference]: Start difference. First operand 273 states and 370 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:38,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:38,975 INFO L93 Difference]: Finished difference Result 612 states and 827 transitions. [2024-10-13 06:31:38,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:31:38,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-10-13 06:31:38,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:38,978 INFO L225 Difference]: With dead ends: 612 [2024-10-13 06:31:38,978 INFO L226 Difference]: Without dead ends: 340 [2024-10-13 06:31:38,979 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-10-13 06:31:38,980 INFO L432 NwaCegarLoop]: 90 mSDtfsCounter, 58 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 328 SdHoareTripleChecker+Invalid, 292 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:38,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 328 Invalid, 292 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:31:38,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2024-10-13 06:31:39,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 337. [2024-10-13 06:31:39,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 337 states, 294 states have (on average 1.3095238095238095) internal successors, (385), 296 states have internal predecessors, (385), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:31:39,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 337 states and 453 transitions. [2024-10-13 06:31:39,025 INFO L78 Accepts]: Start accepts. Automaton has 337 states and 453 transitions. Word has length 111 [2024-10-13 06:31:39,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:39,025 INFO L471 AbstractCegarLoop]: Abstraction has 337 states and 453 transitions. [2024-10-13 06:31:39,025 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:39,025 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 453 transitions. [2024-10-13 06:31:39,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 06:31:39,026 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:39,026 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:39,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-10-13 06:31:39,027 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:39,027 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:39,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1292821824, now seen corresponding path program 1 times [2024-10-13 06:31:39,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:39,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203270113] [2024-10-13 06:31:39,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:39,027 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,413 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:39,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:39,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,418 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:39,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:39,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,422 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:39,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:39,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:39,431 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:39,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:39,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203270113] [2024-10-13 06:31:39,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203270113] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:39,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:39,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:31:39,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [405235652] [2024-10-13 06:31:39,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:39,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:31:39,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:39,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:31:39,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:31:39,434 INFO L87 Difference]: Start difference. First operand 337 states and 453 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:39,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:39,734 INFO L93 Difference]: Finished difference Result 674 states and 905 transitions. [2024-10-13 06:31:39,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:31:39,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-10-13 06:31:39,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:39,737 INFO L225 Difference]: With dead ends: 674 [2024-10-13 06:31:39,737 INFO L226 Difference]: Without dead ends: 338 [2024-10-13 06:31:39,738 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 33 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-10-13 06:31:39,738 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 39 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:39,738 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 344 Invalid, 295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:31:39,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 338 states. [2024-10-13 06:31:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 338 to 335. [2024-10-13 06:31:39,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 292 states have (on average 1.3047945205479452) internal successors, (381), 294 states have internal predecessors, (381), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:31:39,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 449 transitions. [2024-10-13 06:31:39,785 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 449 transitions. Word has length 111 [2024-10-13 06:31:39,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:39,786 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 449 transitions. [2024-10-13 06:31:39,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 449 transitions. [2024-10-13 06:31:39,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 06:31:39,787 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:39,787 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:39,788 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 06:31:39,788 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:39,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:39,788 INFO L85 PathProgramCache]: Analyzing trace with hash 1317524780, now seen corresponding path program 1 times [2024-10-13 06:31:39,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:39,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98619989] [2024-10-13 06:31:39,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:39,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:40,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:40,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:40,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:40,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:40,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:40,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:40,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:40,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:40,381 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:40,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:40,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98619989] [2024-10-13 06:31:40,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98619989] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:40,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:40,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 06:31:40,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213286395] [2024-10-13 06:31:40,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:40,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 06:31:40,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:40,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 06:31:40,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 06:31:40,383 INFO L87 Difference]: Start difference. First operand 335 states and 449 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:40,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:40,605 INFO L93 Difference]: Finished difference Result 676 states and 904 transitions. [2024-10-13 06:31:40,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 06:31:40,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 111 [2024-10-13 06:31:40,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:40,607 INFO L225 Difference]: With dead ends: 676 [2024-10-13 06:31:40,608 INFO L226 Difference]: Without dead ends: 342 [2024-10-13 06:31:40,609 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 06:31:40,609 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 58 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:40,609 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 209 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:31:40,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2024-10-13 06:31:40,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 335. [2024-10-13 06:31:40,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 292 states have (on average 1.3013698630136987) internal successors, (380), 294 states have internal predecessors, (380), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:31:40,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 448 transitions. [2024-10-13 06:31:40,656 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 448 transitions. Word has length 111 [2024-10-13 06:31:40,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:40,657 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 448 transitions. [2024-10-13 06:31:40,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:40,657 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 448 transitions. [2024-10-13 06:31:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-10-13 06:31:40,658 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:40,658 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:40,658 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-10-13 06:31:40,659 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:40,659 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:40,659 INFO L85 PathProgramCache]: Analyzing trace with hash 1991028222, now seen corresponding path program 1 times [2024-10-13 06:31:40,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:40,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991754034] [2024-10-13 06:31:40,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:40,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:40,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:41,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:41,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:41,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:41,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:41,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:41,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:41,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:41,198 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:41,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:41,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991754034] [2024-10-13 06:31:41,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991754034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:41,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:41,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:31:41,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540197248] [2024-10-13 06:31:41,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:41,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:31:41,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:41,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:31:41,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:31:41,200 INFO L87 Difference]: Start difference. First operand 335 states and 448 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:41,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:41,529 INFO L93 Difference]: Finished difference Result 648 states and 863 transitions. [2024-10-13 06:31:41,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:31:41,530 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 111 [2024-10-13 06:31:41,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:41,533 INFO L225 Difference]: With dead ends: 648 [2024-10-13 06:31:41,533 INFO L226 Difference]: Without dead ends: 314 [2024-10-13 06:31:41,534 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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-10-13 06:31:41,536 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 38 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 269 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 344 SdHoareTripleChecker+Invalid, 275 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:41,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 344 Invalid, 275 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 269 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:31:41,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2024-10-13 06:31:41,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 311. [2024-10-13 06:31:41,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 311 states, 268 states have (on average 1.2835820895522387) internal successors, (344), 270 states have internal predecessors, (344), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:31:41,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 311 states to 311 states and 412 transitions. [2024-10-13 06:31:41,613 INFO L78 Accepts]: Start accepts. Automaton has 311 states and 412 transitions. Word has length 111 [2024-10-13 06:31:41,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:41,614 INFO L471 AbstractCegarLoop]: Abstraction has 311 states and 412 transitions. [2024-10-13 06:31:41,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:41,614 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 412 transitions. [2024-10-13 06:31:41,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 06:31:41,615 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:41,615 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:41,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-10-13 06:31:41,616 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:41,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:41,616 INFO L85 PathProgramCache]: Analyzing trace with hash -584174144, now seen corresponding path program 1 times [2024-10-13 06:31:41,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:41,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492592612] [2024-10-13 06:31:41,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:41,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:42,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:42,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:42,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:42,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:42,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:42,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:42,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,438 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:42,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:42,441 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:42,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:42,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492592612] [2024-10-13 06:31:42,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492592612] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:42,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:42,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:31:42,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1163337578] [2024-10-13 06:31:42,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:42,442 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:31:42,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:42,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:31:42,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:31:42,443 INFO L87 Difference]: Start difference. First operand 311 states and 412 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:42,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:42,742 INFO L93 Difference]: Finished difference Result 346 states and 453 transitions. [2024-10-13 06:31:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:31:42,743 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2024-10-13 06:31:42,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:42,745 INFO L225 Difference]: With dead ends: 346 [2024-10-13 06:31:42,745 INFO L226 Difference]: Without dead ends: 344 [2024-10-13 06:31:42,746 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:31:42,747 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 59 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 323 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:42,747 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 323 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:31:42,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 344 states. [2024-10-13 06:31:42,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 344 to 319. [2024-10-13 06:31:42,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 276 states have (on average 1.2753623188405796) internal successors, (352), 278 states have internal predecessors, (352), 34 states have call successors, (34), 8 states have call predecessors, (34), 8 states have return successors, (34), 32 states have call predecessors, (34), 34 states have call successors, (34) [2024-10-13 06:31:42,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 420 transitions. [2024-10-13 06:31:42,800 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 420 transitions. Word has length 112 [2024-10-13 06:31:42,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:42,800 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 420 transitions. [2024-10-13 06:31:42,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:42,801 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 420 transitions. [2024-10-13 06:31:42,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 06:31:42,802 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:42,802 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:42,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-10-13 06:31:42,802 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:42,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:42,803 INFO L85 PathProgramCache]: Analyzing trace with hash -584114562, now seen corresponding path program 1 times [2024-10-13 06:31:42,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:42,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077128282] [2024-10-13 06:31:42,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:42,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:42,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:43,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:43,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:43,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:43,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:43,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:43,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:43,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:43,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:43,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:43,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:43,489 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:43,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:43,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077128282] [2024-10-13 06:31:43,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077128282] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:43,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:43,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:31:43,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859432153] [2024-10-13 06:31:43,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:43,490 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:31:43,490 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:43,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:31:43,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:31:43,492 INFO L87 Difference]: Start difference. First operand 319 states and 420 transitions. Second operand has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:43,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:43,861 INFO L93 Difference]: Finished difference Result 682 states and 891 transitions. [2024-10-13 06:31:43,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:31:43,862 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2024-10-13 06:31:43,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:43,865 INFO L225 Difference]: With dead ends: 682 [2024-10-13 06:31:43,865 INFO L226 Difference]: Without dead ends: 364 [2024-10-13 06:31:43,867 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:31:43,868 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 75 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 363 SdHoareTripleChecker+Invalid, 299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:43,868 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 363 Invalid, 299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:31:43,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-10-13 06:31:43,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 363. [2024-10-13 06:31:43,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 363 states, 303 states have (on average 1.2376237623762376) internal successors, (375), 306 states have internal predecessors, (375), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 06:31:43,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 363 states and 467 transitions. [2024-10-13 06:31:43,933 INFO L78 Accepts]: Start accepts. Automaton has 363 states and 467 transitions. Word has length 112 [2024-10-13 06:31:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:43,933 INFO L471 AbstractCegarLoop]: Abstraction has 363 states and 467 transitions. [2024-10-13 06:31:43,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.0) internal successors, (45), 6 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:43,933 INFO L276 IsEmpty]: Start isEmpty. Operand 363 states and 467 transitions. [2024-10-13 06:31:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-10-13 06:31:43,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:43,934 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:43,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-10-13 06:31:43,935 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:43,935 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:43,935 INFO L85 PathProgramCache]: Analyzing trace with hash -526856260, now seen corresponding path program 1 times [2024-10-13 06:31:43,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:43,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [620295301] [2024-10-13 06:31:43,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:43,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:43,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:44,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:44,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:44,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:44,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:44,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:44,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:44,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:44,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:44,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:44,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:44,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:44,664 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:44,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:44,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [620295301] [2024-10-13 06:31:44,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [620295301] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:44,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:44,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:31:44,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693677346] [2024-10-13 06:31:44,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:44,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:31:44,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:44,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:31:44,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:31:44,666 INFO L87 Difference]: Start difference. First operand 363 states and 467 transitions. Second operand has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:44,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:44,977 INFO L93 Difference]: Finished difference Result 679 states and 873 transitions. [2024-10-13 06:31:44,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:31:44,978 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 112 [2024-10-13 06:31:44,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:44,981 INFO L225 Difference]: With dead ends: 679 [2024-10-13 06:31:44,981 INFO L226 Difference]: Without dead ends: 496 [2024-10-13 06:31:44,982 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:31:44,983 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 35 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:44,983 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 477 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:31:44,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-10-13 06:31:45,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 442. [2024-10-13 06:31:45,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 442 states, 382 states have (on average 1.2408376963350785) internal successors, (474), 385 states have internal predecessors, (474), 46 states have call successors, (46), 13 states have call predecessors, (46), 13 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 06:31:45,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 442 states to 442 states and 566 transitions. [2024-10-13 06:31:45,051 INFO L78 Accepts]: Start accepts. Automaton has 442 states and 566 transitions. Word has length 112 [2024-10-13 06:31:45,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:45,052 INFO L471 AbstractCegarLoop]: Abstraction has 442 states and 566 transitions. [2024-10-13 06:31:45,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.5) internal successors, (45), 7 states have internal predecessors, (45), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:45,052 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 566 transitions. [2024-10-13 06:31:45,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 06:31:45,053 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:45,053 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:45,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-10-13 06:31:45,054 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:45,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:45,054 INFO L85 PathProgramCache]: Analyzing trace with hash -533105034, now seen corresponding path program 1 times [2024-10-13 06:31:45,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:45,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861551423] [2024-10-13 06:31:45,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:45,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,340 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:45,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:45,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:45,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:45,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:45,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:45,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:45,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:45,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:45,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:45,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:45,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:45,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:45,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:45,378 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:45,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:45,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861551423] [2024-10-13 06:31:45,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861551423] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:45,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:45,379 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:31:45,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502132547] [2024-10-13 06:31:45,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:45,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:31:45,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:45,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:31:45,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:31:45,381 INFO L87 Difference]: Start difference. First operand 442 states and 566 transitions. Second operand has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:45,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:45,891 INFO L93 Difference]: Finished difference Result 887 states and 1140 transitions. [2024-10-13 06:31:45,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:31:45,892 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 113 [2024-10-13 06:31:45,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:45,895 INFO L225 Difference]: With dead ends: 887 [2024-10-13 06:31:45,895 INFO L226 Difference]: Without dead ends: 619 [2024-10-13 06:31:45,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:31:45,897 INFO L432 NwaCegarLoop]: 77 mSDtfsCounter, 233 mSDsluCounter, 236 mSDsCounter, 0 mSdLazyCounter, 309 mSolverCounterSat, 176 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 176 IncrementalHoareTripleChecker+Valid, 309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:45,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [233 Valid, 313 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [176 Valid, 309 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:31:45,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 619 states. [2024-10-13 06:31:45,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 619 to 491. [2024-10-13 06:31:45,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 491 states, 428 states have (on average 1.2383177570093458) internal successors, (530), 431 states have internal predecessors, (530), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 06:31:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 491 states and 626 transitions. [2024-10-13 06:31:45,975 INFO L78 Accepts]: Start accepts. Automaton has 491 states and 626 transitions. Word has length 113 [2024-10-13 06:31:45,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:45,976 INFO L471 AbstractCegarLoop]: Abstraction has 491 states and 626 transitions. [2024-10-13 06:31:45,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.571428571428571) internal successors, (46), 7 states have internal predecessors, (46), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:45,976 INFO L276 IsEmpty]: Start isEmpty. Operand 491 states and 626 transitions. [2024-10-13 06:31:45,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 06:31:45,977 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:45,977 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:45,977 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2024-10-13 06:31:45,980 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:45,981 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:45,981 INFO L85 PathProgramCache]: Analyzing trace with hash -162527700, now seen corresponding path program 1 times [2024-10-13 06:31:45,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:45,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114109409] [2024-10-13 06:31:45,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:45,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:46,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:46,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:46,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:46,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:46,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:46,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:46,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:46,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:46,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:46,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:46,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:46,493 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:46,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:46,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114109409] [2024-10-13 06:31:46,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [114109409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:46,494 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:46,494 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:31:46,494 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895331350] [2024-10-13 06:31:46,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:46,495 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:31:46,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:46,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:31:46,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:31:46,496 INFO L87 Difference]: Start difference. First operand 491 states and 626 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:47,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:47,127 INFO L93 Difference]: Finished difference Result 835 states and 1066 transitions. [2024-10-13 06:31:47,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:31:47,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-10-13 06:31:47,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:47,132 INFO L225 Difference]: With dead ends: 835 [2024-10-13 06:31:47,132 INFO L226 Difference]: Without dead ends: 569 [2024-10-13 06:31:47,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:31:47,134 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 157 mSDsluCounter, 337 mSDsCounter, 0 mSdLazyCounter, 591 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:47,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 419 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 591 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:31:47,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-13 06:31:47,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 483. [2024-10-13 06:31:47,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 483 states, 420 states have (on average 1.2333333333333334) internal successors, (518), 423 states have internal predecessors, (518), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 06:31:47,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 483 states to 483 states and 614 transitions. [2024-10-13 06:31:47,215 INFO L78 Accepts]: Start accepts. Automaton has 483 states and 614 transitions. Word has length 113 [2024-10-13 06:31:47,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:47,215 INFO L471 AbstractCegarLoop]: Abstraction has 483 states and 614 transitions. [2024-10-13 06:31:47,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:47,215 INFO L276 IsEmpty]: Start isEmpty. Operand 483 states and 614 transitions. [2024-10-13 06:31:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 06:31:47,220 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:47,220 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:47,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-13 06:31:47,221 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:47,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:47,221 INFO L85 PathProgramCache]: Analyzing trace with hash -1173644950, now seen corresponding path program 1 times [2024-10-13 06:31:47,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:47,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627656919] [2024-10-13 06:31:47,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:47,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:47,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:47,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:47,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:47,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:47,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:47,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:47,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:47,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:47,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:47,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,850 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:47,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:47,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:47,854 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:47,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:47,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627656919] [2024-10-13 06:31:47,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627656919] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:47,855 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:47,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-13 06:31:47,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464575694] [2024-10-13 06:31:47,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:47,855 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 06:31:47,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:47,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 06:31:47,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-10-13 06:31:47,857 INFO L87 Difference]: Start difference. First operand 483 states and 614 transitions. Second operand has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:48,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:48,468 INFO L93 Difference]: Finished difference Result 789 states and 1007 transitions. [2024-10-13 06:31:48,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:31:48,469 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-10-13 06:31:48,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:48,473 INFO L225 Difference]: With dead ends: 789 [2024-10-13 06:31:48,473 INFO L226 Difference]: Without dead ends: 569 [2024-10-13 06:31:48,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=153, Unknown=0, NotChecked=0, Total=210 [2024-10-13 06:31:48,475 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 242 mSDsluCounter, 372 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 459 SdHoareTripleChecker+Invalid, 661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:48,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 459 Invalid, 661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:31:48,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2024-10-13 06:31:48,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 487. [2024-10-13 06:31:48,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 424 states have (on average 1.2358490566037736) internal successors, (524), 427 states have internal predecessors, (524), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 06:31:48,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 620 transitions. [2024-10-13 06:31:48,545 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 620 transitions. Word has length 113 [2024-10-13 06:31:48,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:48,545 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 620 transitions. [2024-10-13 06:31:48,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 5.75) internal successors, (46), 9 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:48,545 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 620 transitions. [2024-10-13 06:31:48,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2024-10-13 06:31:48,546 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:48,547 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:48,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2024-10-13 06:31:48,547 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:48,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:48,548 INFO L85 PathProgramCache]: Analyzing trace with hash 2096224880, now seen corresponding path program 1 times [2024-10-13 06:31:48,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:48,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117886062] [2024-10-13 06:31:48,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:48,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:48,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:48,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:48,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:48,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:48,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:48,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:48,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:48,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:48,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:48,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:49,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:49,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:49,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:49,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:49,007 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:49,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:49,007 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117886062] [2024-10-13 06:31:49,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117886062] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:49,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:49,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:31:49,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190343146] [2024-10-13 06:31:49,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:49,008 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:31:49,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:49,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:31:49,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:31:49,009 INFO L87 Difference]: Start difference. First operand 487 states and 620 transitions. Second operand has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:49,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:49,516 INFO L93 Difference]: Finished difference Result 828 states and 1053 transitions. [2024-10-13 06:31:49,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:31:49,517 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 113 [2024-10-13 06:31:49,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:49,520 INFO L225 Difference]: With dead ends: 828 [2024-10-13 06:31:49,520 INFO L226 Difference]: Without dead ends: 570 [2024-10-13 06:31:49,521 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2024-10-13 06:31:49,522 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 239 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 239 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:49,522 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [239 Valid, 388 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 06:31:49,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 570 states. [2024-10-13 06:31:49,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 570 to 487. [2024-10-13 06:31:49,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 487 states, 424 states have (on average 1.2311320754716981) internal successors, (522), 427 states have internal predecessors, (522), 48 states have call successors, (48), 14 states have call predecessors, (48), 14 states have return successors, (48), 45 states have call predecessors, (48), 48 states have call successors, (48) [2024-10-13 06:31:49,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 487 states to 487 states and 618 transitions. [2024-10-13 06:31:49,593 INFO L78 Accepts]: Start accepts. Automaton has 487 states and 618 transitions. Word has length 113 [2024-10-13 06:31:49,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:49,593 INFO L471 AbstractCegarLoop]: Abstraction has 487 states and 618 transitions. [2024-10-13 06:31:49,593 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 6.571428571428571) internal successors, (46), 8 states have internal predecessors, (46), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:49,593 INFO L276 IsEmpty]: Start isEmpty. Operand 487 states and 618 transitions. [2024-10-13 06:31:49,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:31:49,594 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:49,594 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:49,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-13 06:31:49,595 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:49,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:49,595 INFO L85 PathProgramCache]: Analyzing trace with hash 103281636, now seen corresponding path program 1 times [2024-10-13 06:31:49,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:49,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [339112928] [2024-10-13 06:31:49,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:49,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:49,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:50,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:50,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:50,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:50,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:50,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:50,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:50,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,543 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:50,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:50,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:50,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:50,548 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:50,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:50,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [339112928] [2024-10-13 06:31:50,549 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [339112928] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:50,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:50,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:31:50,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [489550989] [2024-10-13 06:31:50,549 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:50,549 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:31:50,549 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:50,551 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:31:50,551 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:31:50,551 INFO L87 Difference]: Start difference. First operand 487 states and 618 transitions. Second operand has 8 states, 5 states have (on average 9.4) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-13 06:31:50,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:50,964 INFO L93 Difference]: Finished difference Result 804 states and 1018 transitions. [2024-10-13 06:31:50,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:31:50,964 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 5 states have (on average 9.4) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 114 [2024-10-13 06:31:50,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:50,968 INFO L225 Difference]: With dead ends: 804 [2024-10-13 06:31:50,968 INFO L226 Difference]: Without dead ends: 564 [2024-10-13 06:31:50,969 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 42 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-10-13 06:31:50,970 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 41 mSDsluCounter, 373 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:50,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 476 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:31:50,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 564 states. [2024-10-13 06:31:51,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 564 to 484. [2024-10-13 06:31:51,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 484 states, 418 states have (on average 1.215311004784689) internal successors, (508), 422 states have internal predecessors, (508), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 06:31:51,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 484 states to 484 states and 608 transitions. [2024-10-13 06:31:51,063 INFO L78 Accepts]: Start accepts. Automaton has 484 states and 608 transitions. Word has length 114 [2024-10-13 06:31:51,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:51,064 INFO L471 AbstractCegarLoop]: Abstraction has 484 states and 608 transitions. [2024-10-13 06:31:51,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 5 states have (on average 9.4) internal successors, (47), 8 states have internal predecessors, (47), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-13 06:31:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 484 states and 608 transitions. [2024-10-13 06:31:51,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:31:51,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:51,068 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:51,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-13 06:31:51,069 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:51,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:51,069 INFO L85 PathProgramCache]: Analyzing trace with hash -258381462, now seen corresponding path program 1 times [2024-10-13 06:31:51,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:51,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775642914] [2024-10-13 06:31:51,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:51,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:51,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:51,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:51,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:51,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:51,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:51,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:51,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:51,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:51,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:51,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:51,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:51,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,134 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:51,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:51,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775642914] [2024-10-13 06:31:51,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775642914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:51,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:51,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 06:31:51,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182211090] [2024-10-13 06:31:51,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:51,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 06:31:51,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:51,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 06:31:51,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 06:31:51,140 INFO L87 Difference]: Start difference. First operand 484 states and 608 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:51,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:51,239 INFO L93 Difference]: Finished difference Result 928 states and 1171 transitions. [2024-10-13 06:31:51,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 06:31:51,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-13 06:31:51,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:51,242 INFO L225 Difference]: With dead ends: 928 [2024-10-13 06:31:51,242 INFO L226 Difference]: Without dead ends: 489 [2024-10-13 06:31:51,244 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 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-10-13 06:31:51,246 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 0 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:51,246 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 209 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 06:31:51,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-13 06:31:51,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 489. [2024-10-13 06:31:51,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 489 states, 423 states have (on average 1.2127659574468086) internal successors, (513), 427 states have internal predecessors, (513), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 06:31:51,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 489 states to 489 states and 613 transitions. [2024-10-13 06:31:51,337 INFO L78 Accepts]: Start accepts. Automaton has 489 states and 613 transitions. Word has length 114 [2024-10-13 06:31:51,337 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:51,338 INFO L471 AbstractCegarLoop]: Abstraction has 489 states and 613 transitions. [2024-10-13 06:31:51,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:51,338 INFO L276 IsEmpty]: Start isEmpty. Operand 489 states and 613 transitions. [2024-10-13 06:31:51,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:31:51,339 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:51,339 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:51,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-13 06:31:51,339 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:51,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:51,340 INFO L85 PathProgramCache]: Analyzing trace with hash 134645548, now seen corresponding path program 1 times [2024-10-13 06:31:51,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:51,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102404053] [2024-10-13 06:31:51,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:51,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:51,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:51,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:51,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:51,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:51,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:51,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:51,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:51,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:51,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:51,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:51,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:51,912 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:51,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:51,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102404053] [2024-10-13 06:31:51,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102404053] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:51,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:51,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 06:31:51,913 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213329550] [2024-10-13 06:31:51,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:51,913 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 06:31:51,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:51,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 06:31:51,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-13 06:31:51,914 INFO L87 Difference]: Start difference. First operand 489 states and 613 transitions. Second operand has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:52,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:52,172 INFO L93 Difference]: Finished difference Result 933 states and 1170 transitions. [2024-10-13 06:31:52,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:31:52,173 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-13 06:31:52,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:52,175 INFO L225 Difference]: With dead ends: 933 [2024-10-13 06:31:52,175 INFO L226 Difference]: Without dead ends: 489 [2024-10-13 06:31:52,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 38 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-10-13 06:31:52,176 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 32 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:52,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 337 Invalid, 270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:31:52,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-10-13 06:31:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 486. [2024-10-13 06:31:52,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 486 states, 420 states have (on average 1.207142857142857) internal successors, (507), 424 states have internal predecessors, (507), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 46 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 06:31:52,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 486 states and 607 transitions. [2024-10-13 06:31:52,280 INFO L78 Accepts]: Start accepts. Automaton has 486 states and 607 transitions. Word has length 114 [2024-10-13 06:31:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:52,280 INFO L471 AbstractCegarLoop]: Abstraction has 486 states and 607 transitions. [2024-10-13 06:31:52,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 9.4) internal successors, (47), 6 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:52,280 INFO L276 IsEmpty]: Start isEmpty. Operand 486 states and 607 transitions. [2024-10-13 06:31:52,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:31:52,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:52,282 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:52,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2024-10-13 06:31:52,282 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:52,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:52,282 INFO L85 PathProgramCache]: Analyzing trace with hash 442683116, now seen corresponding path program 1 times [2024-10-13 06:31:52,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:52,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023560086] [2024-10-13 06:31:52,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:52,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:52,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:52,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:52,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:52,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:52,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:52,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:52,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:52,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:52,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:52,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:52,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:52,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:52,717 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:52,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:52,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023560086] [2024-10-13 06:31:52,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023560086] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:52,718 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:52,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:31:52,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771988280] [2024-10-13 06:31:52,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:52,719 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:31:52,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:52,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:31:52,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:31:52,720 INFO L87 Difference]: Start difference. First operand 486 states and 607 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:53,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:53,148 INFO L93 Difference]: Finished difference Result 1122 states and 1400 transitions. [2024-10-13 06:31:53,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 06:31:53,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-13 06:31:53,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:53,152 INFO L225 Difference]: With dead ends: 1122 [2024-10-13 06:31:53,153 INFO L226 Difference]: Without dead ends: 681 [2024-10-13 06:31:53,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2024-10-13 06:31:53,154 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 213 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 435 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:53,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 435 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:31:53,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2024-10-13 06:31:53,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 623. [2024-10-13 06:31:53,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 623 states, 557 states have (on average 1.2244165170556554) internal successors, (682), 560 states have internal predecessors, (682), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 06:31:53,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 623 states to 623 states and 782 transitions. [2024-10-13 06:31:53,247 INFO L78 Accepts]: Start accepts. Automaton has 623 states and 782 transitions. Word has length 114 [2024-10-13 06:31:53,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:53,248 INFO L471 AbstractCegarLoop]: Abstraction has 623 states and 782 transitions. [2024-10-13 06:31:53,248 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 623 states and 782 transitions. [2024-10-13 06:31:53,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:31:53,249 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:53,250 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:53,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2024-10-13 06:31:53,250 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:53,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:53,251 INFO L85 PathProgramCache]: Analyzing trace with hash 835710126, now seen corresponding path program 1 times [2024-10-13 06:31:53,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:53,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283804094] [2024-10-13 06:31:53,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:53,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:53,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:53,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:53,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:53,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:53,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:53,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:53,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:53,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:53,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:53,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:53,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:53,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:53,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:53,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:53,905 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:53,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:53,905 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283804094] [2024-10-13 06:31:53,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283804094] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:53,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:53,906 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:31:53,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1545981134] [2024-10-13 06:31:53,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:53,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:31:53,907 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:53,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:31:53,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:31:53,908 INFO L87 Difference]: Start difference. First operand 623 states and 782 transitions. Second operand has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:54,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:54,373 INFO L93 Difference]: Finished difference Result 1176 states and 1464 transitions. [2024-10-13 06:31:54,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:31:54,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 114 [2024-10-13 06:31:54,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:54,378 INFO L225 Difference]: With dead ends: 1176 [2024-10-13 06:31:54,378 INFO L226 Difference]: Without dead ends: 735 [2024-10-13 06:31:54,379 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:31:54,380 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 134 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 542 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 134 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 552 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 542 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:54,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [134 Valid, 629 Invalid, 552 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 542 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:31:54,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 735 states. [2024-10-13 06:31:54,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 735 to 651. [2024-10-13 06:31:54,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 651 states, 585 states have (on average 1.2153846153846153) internal successors, (711), 588 states have internal predecessors, (711), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 06:31:54,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 651 states to 651 states and 811 transitions. [2024-10-13 06:31:54,473 INFO L78 Accepts]: Start accepts. Automaton has 651 states and 811 transitions. Word has length 114 [2024-10-13 06:31:54,474 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:54,474 INFO L471 AbstractCegarLoop]: Abstraction has 651 states and 811 transitions. [2024-10-13 06:31:54,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.875) internal successors, (47), 8 states have internal predecessors, (47), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-13 06:31:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 651 states and 811 transitions. [2024-10-13 06:31:54,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2024-10-13 06:31:54,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:54,475 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:54,476 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2024-10-13 06:31:54,476 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:54,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:54,476 INFO L85 PathProgramCache]: Analyzing trace with hash 1054564844, now seen corresponding path program 1 times [2024-10-13 06:31:54,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:54,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611836955] [2024-10-13 06:31:54,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:54,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:54,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:54,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:54,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:54,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:54,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:54,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:54,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:54,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:54,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:54,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:54,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:54,929 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:54,929 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:54,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611836955] [2024-10-13 06:31:54,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611836955] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:54,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:54,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:31:54,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104050911] [2024-10-13 06:31:54,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:54,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:31:54,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:54,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:31:54,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:31:54,932 INFO L87 Difference]: Start difference. First operand 651 states and 811 transitions. Second operand has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:55,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:55,417 INFO L93 Difference]: Finished difference Result 1197 states and 1484 transitions. [2024-10-13 06:31:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 06:31:55,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 114 [2024-10-13 06:31:55,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:55,421 INFO L225 Difference]: With dead ends: 1197 [2024-10-13 06:31:55,421 INFO L226 Difference]: Without dead ends: 697 [2024-10-13 06:31:55,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:31:55,422 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 145 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:55,423 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 325 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:31:55,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 697 states. [2024-10-13 06:31:55,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 697 to 645. [2024-10-13 06:31:55,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 579 states have (on average 1.2107081174438687) internal successors, (701), 582 states have internal predecessors, (701), 50 states have call successors, (50), 15 states have call predecessors, (50), 15 states have return successors, (50), 47 states have call predecessors, (50), 50 states have call successors, (50) [2024-10-13 06:31:55,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 801 transitions. [2024-10-13 06:31:55,493 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 801 transitions. Word has length 114 [2024-10-13 06:31:55,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:55,493 INFO L471 AbstractCegarLoop]: Abstraction has 645 states and 801 transitions. [2024-10-13 06:31:55,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 7.833333333333333) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:55,494 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 801 transitions. [2024-10-13 06:31:55,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-13 06:31:55,494 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:55,494 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:55,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2024-10-13 06:31:55,495 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:55,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:55,495 INFO L85 PathProgramCache]: Analyzing trace with hash 1535602200, now seen corresponding path program 1 times [2024-10-13 06:31:55,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:55,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795088322] [2024-10-13 06:31:55,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:55,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:56,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:56,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:56,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:56,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:56,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:56,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:56,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:56,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:56,214 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:56,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:56,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795088322] [2024-10-13 06:31:56,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795088322] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:56,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:56,215 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-13 06:31:56,215 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [127219944] [2024-10-13 06:31:56,215 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:56,216 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 06:31:56,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:56,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 06:31:56,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-13 06:31:56,217 INFO L87 Difference]: Start difference. First operand 645 states and 801 transitions. Second operand has 7 states, 5 states have (on average 9.6) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 06:31:56,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:56,536 INFO L93 Difference]: Finished difference Result 933 states and 1155 transitions. [2024-10-13 06:31:56,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-13 06:31:56,536 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 9.6) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 115 [2024-10-13 06:31:56,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:56,540 INFO L225 Difference]: With dead ends: 933 [2024-10-13 06:31:56,540 INFO L226 Difference]: Without dead ends: 658 [2024-10-13 06:31:56,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:31:56,541 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 35 mSDsluCounter, 318 mSDsCounter, 0 mSdLazyCounter, 323 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 416 SdHoareTripleChecker+Invalid, 324 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 323 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:56,542 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 416 Invalid, 324 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 323 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 06:31:56,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 658 states. [2024-10-13 06:31:56,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 658 to 526. [2024-10-13 06:31:56,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 464 states have (on average 1.1982758620689655) internal successors, (556), 465 states have internal predecessors, (556), 46 states have call successors, (46), 15 states have call predecessors, (46), 15 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-10-13 06:31:56,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 648 transitions. [2024-10-13 06:31:56,615 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 648 transitions. Word has length 115 [2024-10-13 06:31:56,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:56,616 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 648 transitions. [2024-10-13 06:31:56,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 9.6) internal successors, (48), 7 states have internal predecessors, (48), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 06:31:56,616 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 648 transitions. [2024-10-13 06:31:56,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-10-13 06:31:56,617 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:56,617 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:56,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2024-10-13 06:31:56,617 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:56,618 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:56,618 INFO L85 PathProgramCache]: Analyzing trace with hash 857282979, now seen corresponding path program 1 times [2024-10-13 06:31:56,618 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:56,618 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [779609176] [2024-10-13 06:31:56,618 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:56,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:56,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:57,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:57,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:57,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:57,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:57,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:57,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:57,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:57,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:57,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:57,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:57,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:57,816 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:57,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:57,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [779609176] [2024-10-13 06:31:57,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [779609176] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:57,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:57,817 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-10-13 06:31:57,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176562128] [2024-10-13 06:31:57,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:57,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-13 06:31:57,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:57,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-13 06:31:57,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:31:57,819 INFO L87 Difference]: Start difference. First operand 526 states and 648 transitions. Second operand has 13 states, 11 states have (on average 4.454545454545454) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 06:31:58,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:58,465 INFO L93 Difference]: Finished difference Result 962 states and 1195 transitions. [2024-10-13 06:31:58,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 06:31:58,466 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 4.454545454545454) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 116 [2024-10-13 06:31:58,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:58,469 INFO L225 Difference]: With dead ends: 962 [2024-10-13 06:31:58,469 INFO L226 Difference]: Without dead ends: 730 [2024-10-13 06:31:58,470 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=295, Unknown=0, NotChecked=0, Total=342 [2024-10-13 06:31:58,470 INFO L432 NwaCegarLoop]: 123 mSDtfsCounter, 70 mSDsluCounter, 978 mSDsCounter, 0 mSdLazyCounter, 1005 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 1101 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 1005 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:58,471 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 1101 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 1005 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:31:58,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 730 states. [2024-10-13 06:31:58,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 730 to 709. [2024-10-13 06:31:58,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 709 states, 636 states have (on average 1.2154088050314464) internal successors, (773), 638 states have internal predecessors, (773), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 06:31:58,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 709 states to 709 states and 881 transitions. [2024-10-13 06:31:58,572 INFO L78 Accepts]: Start accepts. Automaton has 709 states and 881 transitions. Word has length 116 [2024-10-13 06:31:58,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:58,572 INFO L471 AbstractCegarLoop]: Abstraction has 709 states and 881 transitions. [2024-10-13 06:31:58,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 4.454545454545454) internal successors, (49), 13 states have internal predecessors, (49), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 06:31:58,573 INFO L276 IsEmpty]: Start isEmpty. Operand 709 states and 881 transitions. [2024-10-13 06:31:58,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-10-13 06:31:58,573 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:58,574 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:58,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2024-10-13 06:31:58,574 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:58,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:58,574 INFO L85 PathProgramCache]: Analyzing trace with hash 671611120, now seen corresponding path program 1 times [2024-10-13 06:31:58,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:58,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143506717] [2024-10-13 06:31:58,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:58,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:31:58,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:31:59,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:31:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:31:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:31:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,349 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:31:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:31:59,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:31:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:31:59,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:31:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:31:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:31:59,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:31:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:31:59,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:31:59,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:31:59,359 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:31:59,359 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:31:59,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143506717] [2024-10-13 06:31:59,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [143506717] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:31:59,360 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:31:59,360 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-13 06:31:59,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837350091] [2024-10-13 06:31:59,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:31:59,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 06:31:59,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:31:59,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 06:31:59,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-13 06:31:59,362 INFO L87 Difference]: Start difference. First operand 709 states and 881 transitions. Second operand has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:59,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:31:59,846 INFO L93 Difference]: Finished difference Result 1404 states and 1743 transitions. [2024-10-13 06:31:59,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-13 06:31:59,847 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 117 [2024-10-13 06:31:59,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:31:59,851 INFO L225 Difference]: With dead ends: 1404 [2024-10-13 06:31:59,851 INFO L226 Difference]: Without dead ends: 1060 [2024-10-13 06:31:59,852 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-10-13 06:31:59,852 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 84 mSDsluCounter, 687 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 832 SdHoareTripleChecker+Invalid, 543 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 06:31:59,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 832 Invalid, 543 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 06:31:59,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1060 states. [2024-10-13 06:31:59,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1060 to 814. [2024-10-13 06:31:59,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 814 states, 741 states have (on average 1.2172739541160593) internal successors, (902), 743 states have internal predecessors, (902), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 06:31:59,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 814 states to 814 states and 1010 transitions. [2024-10-13 06:31:59,955 INFO L78 Accepts]: Start accepts. Automaton has 814 states and 1010 transitions. Word has length 117 [2024-10-13 06:31:59,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:31:59,956 INFO L471 AbstractCegarLoop]: Abstraction has 814 states and 1010 transitions. [2024-10-13 06:31:59,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 7.142857142857143) internal successors, (50), 8 states have internal predecessors, (50), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-13 06:31:59,956 INFO L276 IsEmpty]: Start isEmpty. Operand 814 states and 1010 transitions. [2024-10-13 06:31:59,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 06:31:59,957 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:31:59,957 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:31:59,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2024-10-13 06:31:59,958 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:31:59,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:31:59,958 INFO L85 PathProgramCache]: Analyzing trace with hash 119339657, now seen corresponding path program 1 times [2024-10-13 06:31:59,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:31:59,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924266387] [2024-10-13 06:31:59,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:31:59,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:00,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:00,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,911 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:00,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:32:00,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:32:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:00,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:32:00,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:32:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:32:00,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:32:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:32:00,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:00,921 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:32:00,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:00,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924266387] [2024-10-13 06:32:00,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924266387] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:00,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:00,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:32:00,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891619478] [2024-10-13 06:32:00,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:00,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:32:00,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:00,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:32:00,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:32:00,923 INFO L87 Difference]: Start difference. First operand 814 states and 1010 transitions. Second operand has 10 states, 7 states have (on average 7.285714285714286) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-13 06:32:01,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:01,591 INFO L93 Difference]: Finished difference Result 1410 states and 1768 transitions. [2024-10-13 06:32:01,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-13 06:32:01,592 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 7.285714285714286) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) Word has length 118 [2024-10-13 06:32:01,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:01,597 INFO L225 Difference]: With dead ends: 1410 [2024-10-13 06:32:01,597 INFO L226 Difference]: Without dead ends: 979 [2024-10-13 06:32:01,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-13 06:32:01,598 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 58 mSDsluCounter, 525 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 656 SdHoareTripleChecker+Invalid, 900 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:01,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 656 Invalid, 900 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:32:01,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 979 states. [2024-10-13 06:32:01,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 979 to 882. [2024-10-13 06:32:01,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 809 states have (on average 1.2274412855377008) internal successors, (993), 811 states have internal predecessors, (993), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 06:32:01,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1101 transitions. [2024-10-13 06:32:01,700 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1101 transitions. Word has length 118 [2024-10-13 06:32:01,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:01,701 INFO L471 AbstractCegarLoop]: Abstraction has 882 states and 1101 transitions. [2024-10-13 06:32:01,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 7.285714285714286) internal successors, (51), 10 states have internal predecessors, (51), 4 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 4 states have call successors, (14) [2024-10-13 06:32:01,701 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1101 transitions. [2024-10-13 06:32:01,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 06:32:01,702 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:01,702 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:32:01,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2024-10-13 06:32:01,703 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:01,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:01,703 INFO L85 PathProgramCache]: Analyzing trace with hash -891777593, now seen corresponding path program 1 times [2024-10-13 06:32:01,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:01,703 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1981226001] [2024-10-13 06:32:01,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:01,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:01,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 06:32:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 06:32:02,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 06:32:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,551 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-13 06:32:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-13 06:32:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-10-13 06:32:02,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-10-13 06:32:02,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,557 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-10-13 06:32:02,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-10-13 06:32:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,561 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-13 06:32:02,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-13 06:32:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-13 06:32:02,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-13 06:32:02,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-13 06:32:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 06:32:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-13 06:32:02,569 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 06:32:02,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1981226001] [2024-10-13 06:32:02,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1981226001] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 06:32:02,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 06:32:02,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-13 06:32:02,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552439291] [2024-10-13 06:32:02,570 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 06:32:02,570 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-13 06:32:02,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 06:32:02,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-13 06:32:02,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2024-10-13 06:32:02,572 INFO L87 Difference]: Start difference. First operand 882 states and 1101 transitions. Second operand has 10 states, 8 states have (on average 6.375) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 06:32:03,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 06:32:03,285 INFO L93 Difference]: Finished difference Result 1723 states and 2162 transitions. [2024-10-13 06:32:03,285 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 06:32:03,286 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 6.375) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) Word has length 118 [2024-10-13 06:32:03,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 06:32:03,291 INFO L225 Difference]: With dead ends: 1723 [2024-10-13 06:32:03,291 INFO L226 Difference]: Without dead ends: 1239 [2024-10-13 06:32:03,293 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=211, Unknown=0, NotChecked=0, Total=272 [2024-10-13 06:32:03,293 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 171 mSDsluCounter, 477 mSDsCounter, 0 mSdLazyCounter, 809 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 559 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 809 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-13 06:32:03,294 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 559 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 809 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-13 06:32:03,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1239 states. [2024-10-13 06:32:03,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1239 to 937. [2024-10-13 06:32:03,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 937 states, 864 states have (on average 1.2256944444444444) internal successors, (1059), 866 states have internal predecessors, (1059), 54 states have call successors, (54), 18 states have call predecessors, (54), 18 states have return successors, (54), 52 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 06:32:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 937 states to 937 states and 1167 transitions. [2024-10-13 06:32:03,403 INFO L78 Accepts]: Start accepts. Automaton has 937 states and 1167 transitions. Word has length 118 [2024-10-13 06:32:03,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 06:32:03,404 INFO L471 AbstractCegarLoop]: Abstraction has 937 states and 1167 transitions. [2024-10-13 06:32:03,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 6.375) internal successors, (51), 10 states have internal predecessors, (51), 3 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 3 states have call successors, (14) [2024-10-13 06:32:03,404 INFO L276 IsEmpty]: Start isEmpty. Operand 937 states and 1167 transitions. [2024-10-13 06:32:03,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2024-10-13 06:32:03,406 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 06:32:03,406 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-13 06:32:03,406 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2024-10-13 06:32:03,406 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 06:32:03,406 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 06:32:03,407 INFO L85 PathProgramCache]: Analyzing trace with hash 30284617, now seen corresponding path program 1 times [2024-10-13 06:32:03,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 06:32:03,407 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133729677] [2024-10-13 06:32:03,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 06:32:03,407 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 06:32:03,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat